./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/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_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB --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-d790fec [2024-11-28 02:50:56,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:50:56,909 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-28 02:50:56,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:50:56,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:50:56,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:50:56,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:50:56,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:50:56,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:50:56,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:50:56,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:50:56,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:50:56,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:50:56,939 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-28 02:50:56,939 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-28 02:50:56,939 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-28 02:50:56,939 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-28 02:50:56,939 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-28 02:50:56,939 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-28 02:50:56,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:50:56,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-28 02:50:56,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:50:56,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:50:56,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:50:56,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:50:56,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:50:56,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-28 02:50:56,941 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-28 02:50:56,941 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_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB 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-28 02:50:57,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:50:57,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:50:57,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:50:57,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:50:57,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:50:57,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2024-11-28 02:51:00,224 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/data/0ce401df3/c0393349d6c44351942f9da345077fa3/FLAGbb33f0dc5 [2024-11-28 02:51:00,475 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:51:00,476 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2024-11-28 02:51:00,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/data/0ce401df3/c0393349d6c44351942f9da345077fa3/FLAGbb33f0dc5 [2024-11-28 02:51:00,781 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/data/0ce401df3/c0393349d6c44351942f9da345077fa3 [2024-11-28 02:51:00,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:51:00,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:51:00,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:51:00,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:51:00,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:51:00,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:51:00" (1/1) ... [2024-11-28 02:51:00,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d1b14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:00, skipping insertion in model container [2024-11-28 02:51:00,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:51:00" (1/1) ... [2024-11-28 02:51:00,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:51:00,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:51:00,976 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:51:00,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:51:01,002 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:51:01,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01 WrapperNode [2024-11-28 02:51:01,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:51:01,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:51:01,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:51:01,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:51:01,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,038 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-28 02:51:01,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:51:01,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:51:01,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:51:01,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:51:01,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,054 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-28 02:51:01,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:51:01,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:51:01,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:51:01,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:51:01,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (1/1) ... [2024-11-28 02:51:01,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 02:51:01,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:01,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 02:51:01,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-28 02:51:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:51:01,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:51:01,180 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:51:01,182 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:51:01,240 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-28 02:51:01,240 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:51:01,249 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:51:01,249 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:51:01,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:51:01 BoogieIcfgContainer [2024-11-28 02:51:01,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:51:01,251 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-28 02:51:01,251 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-28 02:51:01,257 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-28 02:51:01,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 02:51:01,258 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:51:00" (1/3) ... [2024-11-28 02:51:01,259 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62ae8516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:51:01, skipping insertion in model container [2024-11-28 02:51:01,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 02:51:01,259 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:51:01" (2/3) ... [2024-11-28 02:51:01,259 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62ae8516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:51:01, skipping insertion in model container [2024-11-28 02:51:01,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 02:51:01,260 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:51:01" (3/3) ... [2024-11-28 02:51:01,261 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2024-11-28 02:51:01,311 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-28 02:51:01,311 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-28 02:51:01,311 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-28 02:51:01,311 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-28 02:51:01,311 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-28 02:51:01,311 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-28 02:51:01,312 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-28 02:51:01,312 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-28 02:51:01,317 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-28 02:51:01,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 02:51:01,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:01,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:01,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:01,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 02:51:01,341 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-28 02:51:01,342 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-28 02:51:01,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 02:51:01,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:01,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:01,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:01,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 02:51:01,350 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-28 02:51:01,351 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-28 02:51:01,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-28 02:51:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:01,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811099514] [2024-11-28 02:51:01,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:01,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:01,445 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:01,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:01,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1174027, now seen corresponding path program 1 times [2024-11-28 02:51:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449457948] [2024-11-28 02:51:01,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:51:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449457948] [2024-11-28 02:51:01,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449457948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:01,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804915483] [2024-11-28 02:51:01,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:01,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:01,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:01,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:01,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:51:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:01,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:51:01,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:01,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804915483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:51:01,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:51:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-28 02:51:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966459251] [2024-11-28 02:51:01,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:01,657 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:51:01,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:51:01,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:51:01,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:51:01,688 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-28 02:51:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:01,720 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-11-28 02:51:01,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2024-11-28 02:51:01,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-28 02:51:01,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2024-11-28 02:51:01,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-28 02:51:01,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-28 02:51:01,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-11-28 02:51:01,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:51:01,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-28 02:51:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-11-28 02:51:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-28 02:51:01,751 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-28 02:51:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-28 02:51:01,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-28 02:51:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:51:01,757 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-28 02:51:01,757 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-28 02:51:01,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2024-11-28 02:51:01,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-28 02:51:01,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:01,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:01,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:01,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-28 02:51:01,759 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-28 02:51:01,759 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-28 02:51:01,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-28 02:51:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551513575] [2024-11-28 02:51:01,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:01,763 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:01,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1846436115, now seen corresponding path program 1 times [2024-11-28 02:51:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927062550] [2024-11-28 02:51:01,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:51:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927062550] [2024-11-28 02:51:01,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927062550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135820488] [2024-11-28 02:51:01,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:01,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:01,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:01,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:01,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:51:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:01,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:51:01,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:01,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:01,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135820488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:51:01,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:51:01,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-28 02:51:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683983811] [2024-11-28 02:51:01,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:01,998 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:51:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:51:01,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:51:01,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:51:01,999 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-28 02:51:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:02,071 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-28 02:51:02,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2024-11-28 02:51:02,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-28 02:51:02,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2024-11-28 02:51:02,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-28 02:51:02,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-28 02:51:02,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2024-11-28 02:51:02,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:51:02,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-28 02:51:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2024-11-28 02:51:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-28 02:51:02,077 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-28 02:51:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-28 02:51:02,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-28 02:51:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:51:02,079 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-28 02:51:02,079 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-28 02:51:02,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2024-11-28 02:51:02,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-28 02:51:02,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:02,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:02,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:02,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1] [2024-11-28 02:51:02,080 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-28 02:51:02,080 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-28 02:51:02,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-28 02:51:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120789569] [2024-11-28 02:51:02,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:02,086 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:02,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:02,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash 790692643, now seen corresponding path program 2 times [2024-11-28 02:51:02,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:02,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235912564] [2024-11-28 02:51:02,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:02,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:51:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235912564] [2024-11-28 02:51:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235912564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681315833] [2024-11-28 02:51:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:02,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:02,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:02,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:51:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:02,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 02:51:02,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:02,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:02,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681315833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:51:02,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:51:02,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-28 02:51:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143167963] [2024-11-28 02:51:02,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:02,677 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:51:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:51:02,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:51:02,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:51:02,678 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-28 02:51:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:02,769 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-28 02:51:02,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2024-11-28 02:51:02,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-28 02:51:02,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 35 transitions. [2024-11-28 02:51:02,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-28 02:51:02,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-28 02:51:02,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2024-11-28 02:51:02,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:51:02,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-28 02:51:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2024-11-28 02:51:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-28 02:51:02,776 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-28 02:51:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-28 02:51:02,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-28 02:51:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:51:02,778 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-28 02:51:02,778 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-28 02:51:02,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2024-11-28 02:51:02,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-28 02:51:02,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:02,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:02,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:02,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 1, 1, 1, 1] [2024-11-28 02:51:02,780 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-28 02:51:02,780 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-28 02:51:02,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-28 02:51:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077130998] [2024-11-28 02:51:02,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:02,789 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:02,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:02,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 920983363, now seen corresponding path program 3 times [2024-11-28 02:51:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122790619] [2024-11-28 02:51:02,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:03,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:51:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122790619] [2024-11-28 02:51:03,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122790619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578929805] [2024-11-28 02:51:03,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:03,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:03,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:03,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:03,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:51:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:03,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 02:51:03,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:03,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578929805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:51:04,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:51:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2024-11-28 02:51:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791187047] [2024-11-28 02:51:04,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:04,069 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:51:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:51:04,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 02:51:04,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2024-11-28 02:51:04,073 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-28 02:51:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:04,242 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2024-11-28 02:51:04,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 67 transitions. [2024-11-28 02:51:04,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-11-28 02:51:04,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 67 transitions. [2024-11-28 02:51:04,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-28 02:51:04,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-28 02:51:04,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 67 transitions. [2024-11-28 02:51:04,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:51:04,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-11-28 02:51:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 67 transitions. [2024-11-28 02:51:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 02:51:04,256 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-28 02:51:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2024-11-28 02:51:04,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-11-28 02:51:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 02:51:04,261 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-11-28 02:51:04,261 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-28 02:51:04,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 67 transitions. [2024-11-28 02:51:04,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-11-28 02:51:04,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:04,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:04,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:04,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 1, 1, 1, 1] [2024-11-28 02:51:04,265 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-28 02:51:04,266 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-28 02:51:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-28 02:51:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:04,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343347540] [2024-11-28 02:51:04,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:04,275 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:04,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 514359171, now seen corresponding path program 4 times [2024-11-28 02:51:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133714197] [2024-11-28 02:51:04,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:51:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133714197] [2024-11-28 02:51:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133714197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921552643] [2024-11-28 02:51:05,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:05,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:05,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:05,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:05,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:51:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:05,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 02:51:05,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:05,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921552643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:51:07,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:51:07,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2024-11-28 02:51:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521560690] [2024-11-28 02:51:07,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:07,627 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:51:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:51:07,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 02:51:07,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2024-11-28 02:51:07,632 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-28 02:51:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:07,899 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2024-11-28 02:51:07,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 131 transitions. [2024-11-28 02:51:07,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2024-11-28 02:51:07,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 131 transitions. [2024-11-28 02:51:07,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2024-11-28 02:51:07,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2024-11-28 02:51:07,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 131 transitions. [2024-11-28 02:51:07,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:51:07,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-11-28 02:51:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 131 transitions. [2024-11-28 02:51:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-28 02:51:07,915 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-28 02:51:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2024-11-28 02:51:07,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-11-28 02:51:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-28 02:51:07,921 INFO L425 stractBuchiCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-11-28 02:51:07,921 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-28 02:51:07,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 131 transitions. [2024-11-28 02:51:07,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2024-11-28 02:51:07,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:07,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:07,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:07,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [62, 62, 1, 1, 1, 1] [2024-11-28 02:51:07,928 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-28 02:51:07,928 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-28 02:51:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-28 02:51:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207960056] [2024-11-28 02:51:07,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:07,931 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:07,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:07,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -585347069, now seen corresponding path program 5 times [2024-11-28 02:51:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241619318] [2024-11-28 02:51:07,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:51:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241619318] [2024-11-28 02:51:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241619318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183093046] [2024-11-28 02:51:11,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:11,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:11,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:11,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:11,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:51:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:11,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 02:51:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:11,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183093046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:51:16,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:51:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2024-11-28 02:51:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230597671] [2024-11-28 02:51:16,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:16,463 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:51:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:51:16,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-28 02:51:16,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2024-11-28 02:51:16,475 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-28 02:51:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:17,039 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2024-11-28 02:51:17,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 259 transitions. [2024-11-28 02:51:17,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2024-11-28 02:51:17,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 259 transitions. [2024-11-28 02:51:17,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2024-11-28 02:51:17,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2024-11-28 02:51:17,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 259 transitions. [2024-11-28 02:51:17,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:51:17,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-11-28 02:51:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 259 transitions. [2024-11-28 02:51:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-28 02:51:17,056 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-28 02:51:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2024-11-28 02:51:17,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-11-28 02:51:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-11-28 02:51:17,064 INFO L425 stractBuchiCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-11-28 02:51:17,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-28 02:51:17,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 259 transitions. [2024-11-28 02:51:17,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2024-11-28 02:51:17,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:17,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:17,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:17,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 1, 1, 1, 1] [2024-11-28 02:51:17,073 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-28 02:51:17,073 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-28 02:51:17,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-28 02:51:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:17,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227490001] [2024-11-28 02:51:17,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:17,081 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:17,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:17,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2051542781, now seen corresponding path program 6 times [2024-11-28 02:51:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052045631] [2024-11-28 02:51:17,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:17,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:51:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052045631] [2024-11-28 02:51:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052045631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029591401] [2024-11-28 02:51:27,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:27,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:27,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:27,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:27,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:51:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:27,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-28 02:51:27,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:27,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:51:47,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029591401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:51:47,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:51:47,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 256 [2024-11-28 02:51:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140171790] [2024-11-28 02:51:47,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:51:47,187 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:51:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:51:47,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2024-11-28 02:51:47,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2024-11-28 02:51:47,202 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-28 02:51:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:48,772 INFO L93 Difference]: Finished difference Result 514 states and 515 transitions. [2024-11-28 02:51:48,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 515 transitions. [2024-11-28 02:51:48,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 512 [2024-11-28 02:51:48,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 514 states and 515 transitions. [2024-11-28 02:51:48,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 514 [2024-11-28 02:51:48,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 514 [2024-11-28 02:51:48,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 514 states and 515 transitions. [2024-11-28 02:51:48,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:51:48,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-11-28 02:51:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states and 515 transitions. [2024-11-28 02:51:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-11-28 02:51:48,797 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-28 02:51:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 515 transitions. [2024-11-28 02:51:48,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-11-28 02:51:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2024-11-28 02:51:48,806 INFO L425 stractBuchiCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-11-28 02:51:48,806 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-28 02:51:48,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 514 states and 515 transitions. [2024-11-28 02:51:48,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 512 [2024-11-28 02:51:48,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:51:48,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:51:48,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:51:48,814 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [254, 254, 1, 1, 1, 1] [2024-11-28 02:51:48,814 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-28 02:51:48,814 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-28 02:51:48,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-28 02:51:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944286271] [2024-11-28 02:51:48,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:48,819 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:51:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:51:48,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:51:48,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 96416515, now seen corresponding path program 7 times [2024-11-28 02:51:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:51:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682016237] [2024-11-28 02:51:48,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:25,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:52:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682016237] [2024-11-28 02:52:25,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682016237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:52:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108359738] [2024-11-28 02:52:25,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:25,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:52:25,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:52:25,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:52:25,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:52:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:25,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 256 conjuncts are in the unsatisfiable core [2024-11-28 02:52:25,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:52:26,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108359738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:53,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [257, 257, 257] total 512 [2024-11-28 02:53:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049310693] [2024-11-28 02:53:53,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:53,443 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:53:53,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:53:53,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 512 interpolants. [2024-11-28 02:53:53,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130816, Invalid=130816, Unknown=0, NotChecked=0, Total=261632 [2024-11-28 02:53:53,484 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-28 02:54:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:04,474 INFO L93 Difference]: Finished difference Result 1026 states and 1027 transitions. [2024-11-28 02:54:04,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1026 states and 1027 transitions. [2024-11-28 02:54:04,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1024 [2024-11-28 02:54:04,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1026 states to 1026 states and 1027 transitions. [2024-11-28 02:54:04,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1026 [2024-11-28 02:54:04,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1026 [2024-11-28 02:54:04,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1027 transitions. [2024-11-28 02:54:04,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:54:04,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-11-28 02:54:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1027 transitions. [2024-11-28 02:54:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2024-11-28 02:54:04,536 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-28 02:54:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1027 transitions. [2024-11-28 02:54:04,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-11-28 02:54:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 512 states. [2024-11-28 02:54:04,551 INFO L425 stractBuchiCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-11-28 02:54:04,551 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-28 02:54:04,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1026 states and 1027 transitions. [2024-11-28 02:54:04,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1024 [2024-11-28 02:54:04,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:54:04,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:54:04,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-28 02:54:04,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [510, 510, 1, 1, 1, 1] [2024-11-28 02:54:04,575 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-28 02:54:04,575 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-28 02:54:04,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-28 02:54:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:54:04,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332560046] [2024-11-28 02:54:04,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:54:04,580 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:54:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:54:04,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:54:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1056065789, now seen corresponding path program 8 times [2024-11-28 02:54:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:54:04,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725197689] [2024-11-28 02:54:04,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:57:24,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:57:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725197689] [2024-11-28 02:57:24,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725197689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:57:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402141403] [2024-11-28 02:57:24,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:57:24,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:57:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:57:24,369 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:57:24,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21146bd7-2d67-4bb0-b151-d7656f7848c7/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:57:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:57:24,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 512 conjuncts are in the unsatisfiable core [2024-11-28 02:57:24,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:57:26,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402141403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:03:28,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:03:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [513, 513, 513] total 1001 [2024-11-28 03:03:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612775393] [2024-11-28 03:03:28,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:28,211 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 03:03:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:03:28,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 1001 interpolants. [2024-11-28 03:03:28,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=500500, Invalid=500500, Unknown=0, NotChecked=0, Total=1001000 [2024-11-28 03:03:28,370 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)