./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer --witnessprinter.witness.filename witness.graphml --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 446a3f39420f718ff3d1f0852398f1e5da972fdc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:47:30,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:47:30,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:47:30,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:47:30,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:47:30,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:47:30,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:47:30,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:47:30,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:47:30,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:47:30,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:47:30,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:47:30,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:47:30,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:47:30,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:47:30,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:47:30,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:47:30,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:47:30,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:47:30,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:47:30,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:47:30,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:47:30,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:47:30,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:47:30,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:47:30,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:47:30,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:47:30,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:47:30,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:47:30,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:47:30,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:47:30,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:47:30,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:47:30,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:47:30,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:47:30,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:47:30,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:47:30,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:47:30,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:47:30,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:47:30,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:47:30,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-29 20:47:30,472 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:47:30,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:47:30,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:47:30,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:47:30,474 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:47:30,475 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 20:47:30,475 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 20:47:30,475 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 20:47:30,475 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 20:47:30,475 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 20:47:30,476 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 20:47:30,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:47:30,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 20:47:30,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:47:30,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:47:30,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 20:47:30,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 20:47:30,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 20:47:30,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:47:30,478 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 20:47:30,478 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:47:30,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 20:47:30,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:47:30,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:47:30,479 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 20:47:30,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:47:30,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:47:30,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:47:30,480 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 20:47:30,482 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 20:47:30,483 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 446a3f39420f718ff3d1f0852398f1e5da972fdc [2020-11-29 20:47:30,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:47:30,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:47:30,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:47:30,771 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:47:30,772 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:47:30,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2020-11-29 20:47:30,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/data/1f9eb222e/40bf38597dbd404890fc5bcd3500acc8/FLAG1fe4eb9d6 [2020-11-29 20:47:31,284 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:47:31,285 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2020-11-29 20:47:31,291 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/data/1f9eb222e/40bf38597dbd404890fc5bcd3500acc8/FLAG1fe4eb9d6 [2020-11-29 20:47:31,695 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/data/1f9eb222e/40bf38597dbd404890fc5bcd3500acc8 [2020-11-29 20:47:31,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:47:31,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:47:31,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:47:31,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:47:31,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:47:31,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:31,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49746dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31, skipping insertion in model container [2020-11-29 20:47:31,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:31,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:47:31,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:47:31,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:47:31,953 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:47:31,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:47:31,984 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:47:31,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31 WrapperNode [2020-11-29 20:47:31,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:47:31,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:47:31,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:47:31,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:47:31,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:47:32,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:47:32,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:47:32,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:47:32,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... [2020-11-29 20:47:32,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:47:32,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:47:32,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:47:32,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:47:32,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:47:32,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:47:32,255 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:47:32,255 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-29 20:47:32,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:47:32 BoogieIcfgContainer [2020-11-29 20:47:32,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:47:32,257 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 20:47:32,257 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 20:47:32,261 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 20:47:32,262 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:47:32,262 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 08:47:31" (1/3) ... [2020-11-29 20:47:32,263 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@716c2e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 08:47:32, skipping insertion in model container [2020-11-29 20:47:32,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:47:32,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:47:31" (2/3) ... [2020-11-29 20:47:32,264 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@716c2e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 08:47:32, skipping insertion in model container [2020-11-29 20:47:32,264 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 20:47:32,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:47:32" (3/3) ... [2020-11-29 20:47:32,266 INFO L373 chiAutomizerObserver]: Analyzing ICFG NarrowKonv.c [2020-11-29 20:47:32,324 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 20:47:32,324 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 20:47:32,325 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 20:47:32,325 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:47:32,325 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:47:32,325 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 20:47:32,325 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:47:32,325 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 20:47:32,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-11-29 20:47:32,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-29 20:47:32,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:32,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:32,368 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-11-29 20:47:32,368 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:32,368 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 20:47:32,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-11-29 20:47:32,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-29 20:47:32,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:32,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:32,370 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-11-29 20:47:32,370 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:32,378 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 4#L12-1true [2020-11-29 20:47:32,379 INFO L796 eck$LassoCheckResult]: Loop: 4#L12-1true assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6#L12true assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4#L12-1true [2020-11-29 20:47:32,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-11-29 20:47:32,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:32,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392427908] [2020-11-29 20:47:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,514 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:32,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 1 times [2020-11-29 20:47:32,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:32,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408786798] [2020-11-29 20:47:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,536 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:32,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash 31083, now seen corresponding path program 1 times [2020-11-29 20:47:32,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:32,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544525644] [2020-11-29 20:47:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:32,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544525644] [2020-11-29 20:47:32,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:47:32,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 20:47:32,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350402733] [2020-11-29 20:47:32,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:47:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:47:32,818 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2020-11-29 20:47:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:32,868 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-11-29 20:47:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:47:32,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-11-29 20:47:32,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 20:47:32,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 7 states and 10 transitions. [2020-11-29 20:47:32,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:47:32,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:47:32,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-11-29 20:47:32,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 20:47:32,881 INFO L691 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-11-29 20:47:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-11-29 20:47:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-11-29 20:47:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-29 20:47:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-11-29 20:47:32,918 INFO L714 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-11-29 20:47:32,919 INFO L594 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-11-29 20:47:32,919 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 20:47:32,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-11-29 20:47:32,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-29 20:47:32,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:32,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:32,921 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-11-29 20:47:32,921 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 20:47:32,922 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 35#L12-1 [2020-11-29 20:47:32,922 INFO L796 eck$LassoCheckResult]: Loop: 35#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 39#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35#L12-1 [2020-11-29 20:47:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-11-29 20:47:32,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:32,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709522702] [2020-11-29 20:47:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,948 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:32,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 1 times [2020-11-29 20:47:32,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:32,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104261871] [2020-11-29 20:47:32,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,983 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:32,984 INFO L82 PathProgramCache]: Analyzing trace with hash 963343, now seen corresponding path program 1 times [2020-11-29 20:47:32,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:32,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099767336] [2020-11-29 20:47:32,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:32,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:32,998 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:33,055 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:33,056 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:33,057 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:33,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:33,057 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 20:47:33,057 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,057 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:33,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:33,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2020-11-29 20:47:33,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:33,058 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:33,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:33,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:33,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:33,269 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:33,270 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:33,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:33,283 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,293 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-29 20:47:33,293 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:33,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 20:47:33,354 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-29 20:47:33,355 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:33,402 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 20:47:33,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 20:47:33,502 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 20:47:33,504 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:33,504 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:33,504 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:33,504 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:33,504 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 20:47:33,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:33,505 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:33,505 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2020-11-29 20:47:33,505 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:33,505 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:33,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:33,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:33,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:33,639 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:33,643 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:33,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:33,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:33,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:33,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:33,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:33,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:47:33,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:33,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:33,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:33,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:33,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:33,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:33,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:47:33,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:33,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:33,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:33,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:47:33,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:33,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:33,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:47:33,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 20:47:33,788 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 20:47:33,794 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-11-29 20:47:33,794 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:33,807 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 20:47:33,807 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 20:47:33,807 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 20:47:33,808 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~range~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:33,849 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 20:47:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:33,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:47:33,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:33,983 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:47:33,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:34,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 20:47:34,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-29 20:47:34,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2020-11-29 20:47:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 20:47:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 20:47:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2020-11-29 20:47:34,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 3 letters. [2020-11-29 20:47:34,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:34,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 3 letters. [2020-11-29 20:47:34,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:34,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 6 letters. [2020-11-29 20:47:34,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:34,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2020-11-29 20:47:34,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-29 20:47:34,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2020-11-29 20:47:34,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-29 20:47:34,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:47:34,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2020-11-29 20:47:34,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:34,077 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-11-29 20:47:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2020-11-29 20:47:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-11-29 20:47:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-29 20:47:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2020-11-29 20:47:34,082 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-11-29 20:47:34,082 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-11-29 20:47:34,082 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 20:47:34,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2020-11-29 20:47:34,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-29 20:47:34,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:34,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:34,084 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 20:47:34,084 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:34,084 INFO L794 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 85#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 90#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 91#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 86#L12-1 [2020-11-29 20:47:34,084 INFO L796 eck$LassoCheckResult]: Loop: 86#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 87#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 86#L12-1 [2020-11-29 20:47:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 1 times [2020-11-29 20:47:34,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324921455] [2020-11-29 20:47:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,102 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 2 times [2020-11-29 20:47:34,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680127193] [2020-11-29 20:47:34,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,113 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash 925771032, now seen corresponding path program 1 times [2020-11-29 20:47:34,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350025506] [2020-11-29 20:47:34,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:34,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350025506] [2020-11-29 20:47:34,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712522655] [2020-11-29 20:47:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-11-29 20:47:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:34,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 20:47:34,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:34,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:34,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2020-11-29 20:47:34,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42914359] [2020-11-29 20:47:34,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:47:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:47:34,301 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-11-29 20:47:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:34,356 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-11-29 20:47:34,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:47:34,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2020-11-29 20:47:34,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-29 20:47:34,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2020-11-29 20:47:34,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-29 20:47:34,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 20:47:34,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-11-29 20:47:34,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:34,359 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-11-29 20:47:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-11-29 20:47:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-29 20:47:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-29 20:47:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-11-29 20:47:34,362 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-11-29 20:47:34,362 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-11-29 20:47:34,362 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 20:47:34,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-11-29 20:47:34,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-29 20:47:34,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:34,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:34,363 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-11-29 20:47:34,364 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:34,366 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 142#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 139#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 141#L12-1 [2020-11-29 20:47:34,366 INFO L796 eck$LassoCheckResult]: Loop: 141#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 144#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 141#L12-1 [2020-11-29 20:47:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869310, now seen corresponding path program 1 times [2020-11-29 20:47:34,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136274683] [2020-11-29 20:47:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,399 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 3 times [2020-11-29 20:47:34,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110598854] [2020-11-29 20:47:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,406 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,407 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1659585997, now seen corresponding path program 1 times [2020-11-29 20:47:34,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116690248] [2020-11-29 20:47:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:34,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116690248] [2020-11-29 20:47:34,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:47:34,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:47:34,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590876348] [2020-11-29 20:47:34,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:34,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:47:34,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:47:34,489 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-11-29 20:47:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:34,529 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2020-11-29 20:47:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:47:34,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2020-11-29 20:47:34,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-29 20:47:34,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2020-11-29 20:47:34,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-29 20:47:34,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-29 20:47:34,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2020-11-29 20:47:34,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:34,534 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-29 20:47:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2020-11-29 20:47:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-11-29 20:47:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-29 20:47:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-11-29 20:47:34,537 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-29 20:47:34,537 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-29 20:47:34,537 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 20:47:34,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-11-29 20:47:34,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:34,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:34,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:34,539 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-11-29 20:47:34,539 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 20:47:34,539 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 175#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 181#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 183#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 176#L12-1 [2020-11-29 20:47:34,540 INFO L796 eck$LassoCheckResult]: Loop: 176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 176#L12-1 [2020-11-29 20:47:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1365869310, now seen corresponding path program 2 times [2020-11-29 20:47:34,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792226784] [2020-11-29 20:47:34,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,567 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,568 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 2 times [2020-11-29 20:47:34,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221796857] [2020-11-29 20:47:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,590 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash -92441875, now seen corresponding path program 3 times [2020-11-29 20:47:34,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:34,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642979506] [2020-11-29 20:47:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:34,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:34,616 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:34,656 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:34,656 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:34,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:34,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:34,656 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 20:47:34,657 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:34,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:34,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:34,657 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2020-11-29 20:47:34,657 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:34,657 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:34,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:34,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:34,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:34,756 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:34,757 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:34,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:34,790 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:34,795 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-29 20:47:34,795 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:34,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:34,852 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:34,858 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-29 20:47:34,858 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:34,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:34,904 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:34,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 20:47:34,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 20:47:34,992 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 20:47:34,994 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:34,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:34,995 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:34,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:34,995 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 20:47:34,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:34,995 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:34,995 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:34,995 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2020-11-29 20:47:34,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:34,995 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:34,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:35,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:35,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:35,094 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:35,094 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:35,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:35,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:35,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:35,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:35,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:35,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:47:35,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:35,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:35,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:35,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:35,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:35,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:35,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:35,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:47:35,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:35,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:35,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:35,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:35,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:47:35,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:35,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:35,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:35,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:47:35,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:35,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 20:47:35,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-29 20:47:35,298 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:35,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 20:47:35,307 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 20:47:35,307 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 20:47:35,307 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:35,348 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 20:47:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:35,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:47:35,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:35,394 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:47:35,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:35,412 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 20:47:35,412 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-11-29 20:47:35,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 32 states and 38 transitions. Complement of second has 5 states. [2020-11-29 20:47:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 20:47:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 20:47:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-11-29 20:47:35,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 3 letters. [2020-11-29 20:47:35,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:35,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 3 letters. [2020-11-29 20:47:35,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:35,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 6 letters. [2020-11-29 20:47:35,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:35,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2020-11-29 20:47:35,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:35,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 34 transitions. [2020-11-29 20:47:35,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-29 20:47:35,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 20:47:35,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2020-11-29 20:47:35,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:35,443 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-11-29 20:47:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2020-11-29 20:47:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-11-29 20:47:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-29 20:47:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-11-29 20:47:35,448 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-11-29 20:47:35,448 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-11-29 20:47:35,449 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 20:47:35,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-11-29 20:47:35,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:35,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:35,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:35,451 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1] [2020-11-29 20:47:35,451 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:35,452 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 273#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 288#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 285#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 278#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 279#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 290#L12-1 [2020-11-29 20:47:35,452 INFO L796 eck$LassoCheckResult]: Loop: 290#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 292#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 290#L12-1 [2020-11-29 20:47:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash -92441877, now seen corresponding path program 4 times [2020-11-29 20:47:35,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:35,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249151346] [2020-11-29 20:47:35,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:35,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249151346] [2020-11-29 20:47:35,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523864893] [2020-11-29 20:47:35,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:35,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:47:35,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:35,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:47:35,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:35,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:35,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-11-29 20:47:35,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173064212] [2020-11-29 20:47:35,601 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 4 times [2020-11-29 20:47:35,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:35,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703534185] [2020-11-29 20:47:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:35,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:35,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:35,614 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:35,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:47:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:47:35,654 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-11-29 20:47:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:35,719 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-11-29 20:47:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:47:35,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2020-11-29 20:47:35,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:35,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 36 transitions. [2020-11-29 20:47:35,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-29 20:47:35,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-11-29 20:47:35,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2020-11-29 20:47:35,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:35,730 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-11-29 20:47:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2020-11-29 20:47:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-11-29 20:47:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-29 20:47:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2020-11-29 20:47:35,734 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2020-11-29 20:47:35,734 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2020-11-29 20:47:35,734 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 20:47:35,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2020-11-29 20:47:35,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:35,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:35,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:35,737 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1] [2020-11-29 20:47:35,737 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:35,737 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 385#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 377#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 396#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 394#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 392#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 388#L12-1 [2020-11-29 20:47:35,737 INFO L796 eck$LassoCheckResult]: Loop: 388#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 390#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 388#L12-1 [2020-11-29 20:47:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:35,738 INFO L82 PathProgramCache]: Analyzing trace with hash -861851360, now seen corresponding path program 5 times [2020-11-29 20:47:35,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:35,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511974631] [2020-11-29 20:47:35,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:35,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511974631] [2020-11-29 20:47:35,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336225964] [2020-11-29 20:47:35,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:35,844 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-11-29 20:47:35,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:35,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:47:35,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:35,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:35,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-11-29 20:47:35,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094618547] [2020-11-29 20:47:35,917 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 5 times [2020-11-29 20:47:35,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:35,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798271782] [2020-11-29 20:47:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:35,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:35,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:35,924 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:35,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:47:35,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:47:35,947 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-11-29 20:47:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:36,085 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-11-29 20:47:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:47:36,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2020-11-29 20:47:36,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:36,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 37 states and 42 transitions. [2020-11-29 20:47:36,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-11-29 20:47:36,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-29 20:47:36,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2020-11-29 20:47:36,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:36,089 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-11-29 20:47:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2020-11-29 20:47:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-11-29 20:47:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-29 20:47:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-11-29 20:47:36,093 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-11-29 20:47:36,093 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-11-29 20:47:36,093 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 20:47:36,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2020-11-29 20:47:36,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:36,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:36,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:36,095 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1] [2020-11-29 20:47:36,095 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:36,095 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 502#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 501#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 496#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 497#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 489#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 512#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 510#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 509#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 505#L12-1 [2020-11-29 20:47:36,095 INFO L796 eck$LassoCheckResult]: Loop: 505#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 507#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 505#L12-1 [2020-11-29 20:47:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash -99300661, now seen corresponding path program 6 times [2020-11-29 20:47:36,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:36,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38062694] [2020-11-29 20:47:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:36,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38062694] [2020-11-29 20:47:36,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841309648] [2020-11-29 20:47:36,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-11-29 20:47:36,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-11-29 20:47:36,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:36,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 20:47:36,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:36,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:36,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-11-29 20:47:36,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473813049] [2020-11-29 20:47:36,341 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 6 times [2020-11-29 20:47:36,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:36,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839577614] [2020-11-29 20:47:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:36,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:36,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:36,347 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:36,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:36,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 20:47:36,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:47:36,380 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-11-29 20:47:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:36,461 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-11-29 20:47:36,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:47:36,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 50 transitions. [2020-11-29 20:47:36,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:36,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 48 transitions. [2020-11-29 20:47:36,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-29 20:47:36,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-29 20:47:36,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 48 transitions. [2020-11-29 20:47:36,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:36,465 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2020-11-29 20:47:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 48 transitions. [2020-11-29 20:47:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-11-29 20:47:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-29 20:47:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2020-11-29 20:47:36,469 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2020-11-29 20:47:36,469 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2020-11-29 20:47:36,469 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 20:47:36,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 46 transitions. [2020-11-29 20:47:36,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:36,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:36,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:36,470 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 2, 1] [2020-11-29 20:47:36,471 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:36,471 INFO L794 eck$LassoCheckResult]: Stem: 623#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 624#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 639#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 638#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 637#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 636#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 634#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 635#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 632#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 633#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 662#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 627#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 628#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 630#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 660#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 648#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 644#L12-1 [2020-11-29 20:47:36,471 INFO L796 eck$LassoCheckResult]: Loop: 644#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 646#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 644#L12-1 [2020-11-29 20:47:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash 966544704, now seen corresponding path program 7 times [2020-11-29 20:47:36,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:36,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181355352] [2020-11-29 20:47:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:36,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181355352] [2020-11-29 20:47:36,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558419678] [2020-11-29 20:47:36,562 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:36,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 20:47:36,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:36,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:36,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-11-29 20:47:36,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033807933] [2020-11-29 20:47:36,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 7 times [2020-11-29 20:47:36,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:36,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244440135] [2020-11-29 20:47:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:36,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:36,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:36,700 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:36,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 20:47:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:47:36,724 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-11-29 20:47:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:36,769 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2020-11-29 20:47:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:47:36,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 56 transitions. [2020-11-29 20:47:36,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:36,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 49 states and 54 transitions. [2020-11-29 20:47:36,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-11-29 20:47:36,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-11-29 20:47:36,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 54 transitions. [2020-11-29 20:47:36,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:36,773 INFO L691 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-11-29 20:47:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 54 transitions. [2020-11-29 20:47:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-11-29 20:47:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-29 20:47:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2020-11-29 20:47:36,777 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2020-11-29 20:47:36,777 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2020-11-29 20:47:36,777 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 20:47:36,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2020-11-29 20:47:36,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:36,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:36,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:36,778 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 2, 1] [2020-11-29 20:47:36,779 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:36,779 INFO L794 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 802#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 801#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 800#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 799#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 793#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 794#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 831#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 829#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 828#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 827#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 823#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 825#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 810#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 806#L12-1 [2020-11-29 20:47:36,779 INFO L796 eck$LassoCheckResult]: Loop: 806#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 808#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 806#L12-1 [2020-11-29 20:47:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:36,779 INFO L82 PathProgramCache]: Analyzing trace with hash 872594091, now seen corresponding path program 8 times [2020-11-29 20:47:36,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:36,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336400958] [2020-11-29 20:47:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:36,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336400958] [2020-11-29 20:47:36,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356330597] [2020-11-29 20:47:36,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:36,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:47:36,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:36,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 20:47:36,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:37,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:37,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-11-29 20:47:37,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838382162] [2020-11-29 20:47:37,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 8 times [2020-11-29 20:47:37,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:37,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914089586] [2020-11-29 20:47:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:37,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:37,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:37,113 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:37,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:37,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 20:47:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:47:37,132 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. cyclomatic complexity: 8 Second operand 15 states. [2020-11-29 20:47:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:37,220 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-11-29 20:47:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 20:47:37,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2020-11-29 20:47:37,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:37,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 60 transitions. [2020-11-29 20:47:37,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-11-29 20:47:37,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-11-29 20:47:37,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 60 transitions. [2020-11-29 20:47:37,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:37,226 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2020-11-29 20:47:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 60 transitions. [2020-11-29 20:47:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-29 20:47:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-29 20:47:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-11-29 20:47:37,231 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-11-29 20:47:37,231 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-11-29 20:47:37,231 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 20:47:37,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2020-11-29 20:47:37,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:37,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:37,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:37,233 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 1] [2020-11-29 20:47:37,233 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:37,233 INFO L794 eck$LassoCheckResult]: Stem: 970#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 985#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 982#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 981#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1022#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 975#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 977#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 979#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1007#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1004#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 994#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 990#L12-1 [2020-11-29 20:47:37,234 INFO L796 eck$LassoCheckResult]: Loop: 990#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 992#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 990#L12-1 [2020-11-29 20:47:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1986408096, now seen corresponding path program 9 times [2020-11-29 20:47:37,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:37,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282296464] [2020-11-29 20:47:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:37,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282296464] [2020-11-29 20:47:37,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005245658] [2020-11-29 20:47:37,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:37,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2020-11-29 20:47:37,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:37,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 20:47:37,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:37,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:37,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-11-29 20:47:37,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857455136] [2020-11-29 20:47:37,494 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:37,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 9 times [2020-11-29 20:47:37,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:37,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243405596] [2020-11-29 20:47:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:37,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:37,501 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:37,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:37,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:37,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 20:47:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2020-11-29 20:47:37,519 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 8 Second operand 17 states. [2020-11-29 20:47:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:37,605 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2020-11-29 20:47:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:47:37,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 68 transitions. [2020-11-29 20:47:37,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:37,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 61 states and 66 transitions. [2020-11-29 20:47:37,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2020-11-29 20:47:37,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-11-29 20:47:37,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 66 transitions. [2020-11-29 20:47:37,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:37,615 INFO L691 BuchiCegarLoop]: Abstraction has 61 states and 66 transitions. [2020-11-29 20:47:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 66 transitions. [2020-11-29 20:47:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2020-11-29 20:47:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-29 20:47:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2020-11-29 20:47:37,621 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2020-11-29 20:47:37,621 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2020-11-29 20:47:37,621 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 20:47:37,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 64 transitions. [2020-11-29 20:47:37,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:37,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:37,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:37,623 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 7, 2, 1] [2020-11-29 20:47:37,623 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:37,623 INFO L794 eck$LassoCheckResult]: Stem: 1178#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1179#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1193#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1192#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1191#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1190#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1189#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1188#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1186#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1182#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1236#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1232#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1231#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1230#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1229#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1228#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1217#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1202#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1198#L12-1 [2020-11-29 20:47:37,623 INFO L796 eck$LassoCheckResult]: Loop: 1198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1200#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1198#L12-1 [2020-11-29 20:47:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1024114037, now seen corresponding path program 10 times [2020-11-29 20:47:37,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:37,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383829676] [2020-11-29 20:47:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:37,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383829676] [2020-11-29 20:47:37,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38820786] [2020-11-29 20:47:37,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:37,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:47:37,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:37,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 20:47:37,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:38,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:38,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-11-29 20:47:38,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140998320] [2020-11-29 20:47:38,038 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 10 times [2020-11-29 20:47:38,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:38,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426982083] [2020-11-29 20:47:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:38,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:38,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:38,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:38,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 20:47:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:47:38,079 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. cyclomatic complexity: 8 Second operand 19 states. [2020-11-29 20:47:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:38,184 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-11-29 20:47:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:47:38,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 74 transitions. [2020-11-29 20:47:38,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:38,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 67 states and 72 transitions. [2020-11-29 20:47:38,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-11-29 20:47:38,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-11-29 20:47:38,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 72 transitions. [2020-11-29 20:47:38,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:38,187 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-11-29 20:47:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 72 transitions. [2020-11-29 20:47:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2020-11-29 20:47:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-29 20:47:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2020-11-29 20:47:38,191 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 70 transitions. [2020-11-29 20:47:38,191 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 70 transitions. [2020-11-29 20:47:38,191 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 20:47:38,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 70 transitions. [2020-11-29 20:47:38,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:38,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:38,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:38,198 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 2, 1] [2020-11-29 20:47:38,199 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:38,199 INFO L794 eck$LassoCheckResult]: Stem: 1409#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1410#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1423#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1422#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1421#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1420#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1419#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1416#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1417#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1414#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1473#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1472#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1471#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1470#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1469#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1468#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1467#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1466#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1465#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1464#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1463#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1462#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1461#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1460#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1446#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1445#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1443#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1433#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1429#L12-1 [2020-11-29 20:47:38,199 INFO L796 eck$LassoCheckResult]: Loop: 1429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1431#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1429#L12-1 [2020-11-29 20:47:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2066464128, now seen corresponding path program 11 times [2020-11-29 20:47:38,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:38,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815255855] [2020-11-29 20:47:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:38,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815255855] [2020-11-29 20:47:38,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516896510] [2020-11-29 20:47:38,384 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:38,423 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2020-11-29 20:47:38,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:38,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-29 20:47:38,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:38,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:38,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-11-29 20:47:38,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66419115] [2020-11-29 20:47:38,639 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 11 times [2020-11-29 20:47:38,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:38,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459970134] [2020-11-29 20:47:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:38,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:38,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:38,650 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:38,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 20:47:38,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=264, Unknown=0, NotChecked=0, Total=420 [2020-11-29 20:47:38,677 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. cyclomatic complexity: 8 Second operand 21 states. [2020-11-29 20:47:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:38,818 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-11-29 20:47:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 20:47:38,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 80 transitions. [2020-11-29 20:47:38,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:38,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 73 states and 78 transitions. [2020-11-29 20:47:38,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-11-29 20:47:38,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-11-29 20:47:38,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 78 transitions. [2020-11-29 20:47:38,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:38,821 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-11-29 20:47:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 78 transitions. [2020-11-29 20:47:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-11-29 20:47:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-29 20:47:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2020-11-29 20:47:38,826 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 76 transitions. [2020-11-29 20:47:38,826 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 76 transitions. [2020-11-29 20:47:38,826 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-29 20:47:38,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 76 transitions. [2020-11-29 20:47:38,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:38,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:38,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:38,829 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 9, 2, 1] [2020-11-29 20:47:38,829 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:38,829 INFO L794 eck$LassoCheckResult]: Stem: 1663#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1678#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1677#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1676#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1675#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1674#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1671#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1667#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1733#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1731#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1730#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1728#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1727#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1726#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1725#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1724#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1723#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1722#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1721#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1720#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1719#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1718#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1717#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1702#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1699#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1687#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1683#L12-1 [2020-11-29 20:47:38,829 INFO L796 eck$LassoCheckResult]: Loop: 1683#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1685#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1683#L12-1 [2020-11-29 20:47:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:38,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2028314005, now seen corresponding path program 12 times [2020-11-29 20:47:38,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:38,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818325339] [2020-11-29 20:47:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:38,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818325339] [2020-11-29 20:47:38,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600678665] [2020-11-29 20:47:38,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:39,012 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-11-29 20:47:39,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:39,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-29 20:47:39,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:39,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:39,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2020-11-29 20:47:39,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689426106] [2020-11-29 20:47:39,201 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 12 times [2020-11-29 20:47:39,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:39,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108900917] [2020-11-29 20:47:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:39,204 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:39,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:39,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:39,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 20:47:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2020-11-29 20:47:39,223 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. cyclomatic complexity: 8 Second operand 23 states. [2020-11-29 20:47:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:39,350 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2020-11-29 20:47:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 20:47:39,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 86 transitions. [2020-11-29 20:47:39,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:39,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 84 transitions. [2020-11-29 20:47:39,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2020-11-29 20:47:39,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-11-29 20:47:39,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 84 transitions. [2020-11-29 20:47:39,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:39,353 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-11-29 20:47:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 84 transitions. [2020-11-29 20:47:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-11-29 20:47:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-29 20:47:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-11-29 20:47:39,357 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-11-29 20:47:39,357 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-11-29 20:47:39,357 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-29 20:47:39,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 82 transitions. [2020-11-29 20:47:39,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:39,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:39,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:39,359 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 10, 2, 1] [2020-11-29 20:47:39,359 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:39,359 INFO L794 eck$LassoCheckResult]: Stem: 1940#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1954#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1947#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1945#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2015#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2014#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2013#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2012#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2007#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2004#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2003#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2002#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2001#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2000#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1979#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1976#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1974#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1964#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1960#L12-1 [2020-11-29 20:47:39,359 INFO L796 eck$LassoCheckResult]: Loop: 1960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1962#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1960#L12-1 [2020-11-29 20:47:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:39,359 INFO L82 PathProgramCache]: Analyzing trace with hash 392434080, now seen corresponding path program 13 times [2020-11-29 20:47:39,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:39,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351331889] [2020-11-29 20:47:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:39,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351331889] [2020-11-29 20:47:39,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569594769] [2020-11-29 20:47:39,548 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:39,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 20:47:39,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:39,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:39,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-11-29 20:47:39,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002105431] [2020-11-29 20:47:39,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 13 times [2020-11-29 20:47:39,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:39,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933890661] [2020-11-29 20:47:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:39,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:39,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:39,831 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:39,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:39,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 20:47:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2020-11-29 20:47:39,860 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. cyclomatic complexity: 8 Second operand 25 states. [2020-11-29 20:47:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:39,971 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2020-11-29 20:47:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 20:47:39,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 92 transitions. [2020-11-29 20:47:39,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:39,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 85 states and 90 transitions. [2020-11-29 20:47:39,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-11-29 20:47:39,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2020-11-29 20:47:39,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 90 transitions. [2020-11-29 20:47:39,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:39,974 INFO L691 BuchiCegarLoop]: Abstraction has 85 states and 90 transitions. [2020-11-29 20:47:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 90 transitions. [2020-11-29 20:47:39,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2020-11-29 20:47:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-29 20:47:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2020-11-29 20:47:39,978 INFO L714 BuchiCegarLoop]: Abstraction has 83 states and 88 transitions. [2020-11-29 20:47:39,978 INFO L594 BuchiCegarLoop]: Abstraction has 83 states and 88 transitions. [2020-11-29 20:47:39,978 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-11-29 20:47:39,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 88 transitions. [2020-11-29 20:47:39,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 20:47:39,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:39,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:39,980 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 12, 1, 1] [2020-11-29 20:47:39,980 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 20:47:39,980 INFO L794 eck$LassoCheckResult]: Stem: 2240#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 2241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2256#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2270#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2266#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2257#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2258#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2299#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2249#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2242#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2246#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2296#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2295#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2294#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2293#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2290#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2287#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2286#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2285#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2284#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2283#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2282#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2278#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2273#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2272#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2271#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2269#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2265#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2261#L12-1 [2020-11-29 20:47:39,980 INFO L796 eck$LassoCheckResult]: Loop: 2261#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2263#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2259#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2261#L12-1 [2020-11-29 20:47:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:39,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1288685295, now seen corresponding path program 14 times [2020-11-29 20:47:39,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:39,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735547728] [2020-11-29 20:47:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:39,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:39,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 3 times [2020-11-29 20:47:40,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:40,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526857857] [2020-11-29 20:47:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,007 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1489045630, now seen corresponding path program 15 times [2020-11-29 20:47:40,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:40,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065357379] [2020-11-29 20:47:40,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,026 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:40,058 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:40,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:40,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:40,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:40,058 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 20:47:40,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:40,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:40,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration16_Loop [2020-11-29 20:47:40,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:40,059 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:40,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:40,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:40,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:40,159 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:40,159 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:40,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:40,168 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,176 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-29 20:47:40,176 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:40,210 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 20:47:40,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 20:47:40,285 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 20:47:40,287 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:40,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:40,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:40,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:40,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 20:47:40,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:40,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:40,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration16_Loop [2020-11-29 20:47:40,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:40,288 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:40,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:40,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:40,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:40,365 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:40,365 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:40,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:40,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:40,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:40,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:40,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:40,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 20:47:40,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:40,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:40,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:40,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:47:40,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:40,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:40,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:40,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:47:40,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 20:47:40,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-29 20:47:40,429 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:40,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 20:47:40,432 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 20:47:40,432 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 20:47:40,432 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~range~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:40,466 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 20:47:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:40,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:47:40,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:40,574 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:47:40,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:40,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 20:47:40,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 88 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-11-29 20:47:40,606 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 88 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 111 states and 117 transitions. Complement of second has 5 states. [2020-11-29 20:47:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 20:47:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 20:47:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-11-29 20:47:40,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 40 letters. Loop has 3 letters. [2020-11-29 20:47:40,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:40,612 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-29 20:47:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:40,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:47:40,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:40,645 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:47:40,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:40,658 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 20:47:40,658 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 88 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-11-29 20:47:40,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 88 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 111 states and 117 transitions. Complement of second has 5 states. [2020-11-29 20:47:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 20:47:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 20:47:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-11-29 20:47:40,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 40 letters. Loop has 3 letters. [2020-11-29 20:47:40,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:40,679 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-29 20:47:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:40,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:47:40,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:40,722 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:47:40,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:40,738 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-29 20:47:40,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 88 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-11-29 20:47:40,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 88 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 135 states and 143 transitions. Complement of second has 4 states. [2020-11-29 20:47:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 20:47:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 20:47:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-11-29 20:47:40,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 40 letters. Loop has 3 letters. [2020-11-29 20:47:40,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:40,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 43 letters. Loop has 3 letters. [2020-11-29 20:47:40,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:40,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 40 letters. Loop has 6 letters. [2020-11-29 20:47:40,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:40,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 143 transitions. [2020-11-29 20:47:40,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-11-29 20:47:40,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 89 states and 96 transitions. [2020-11-29 20:47:40,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 20:47:40,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-11-29 20:47:40,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 96 transitions. [2020-11-29 20:47:40,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:40,764 INFO L691 BuchiCegarLoop]: Abstraction has 89 states and 96 transitions. [2020-11-29 20:47:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 96 transitions. [2020-11-29 20:47:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 47. [2020-11-29 20:47:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-29 20:47:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-11-29 20:47:40,767 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-11-29 20:47:40,767 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-11-29 20:47:40,768 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-11-29 20:47:40,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 53 transitions. [2020-11-29 20:47:40,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-11-29 20:47:40,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:40,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:40,769 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 11, 1, 1] [2020-11-29 20:47:40,769 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-11-29 20:47:40,770 INFO L794 eck$LassoCheckResult]: Stem: 3099#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 3100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3106#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3116#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3108#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3101#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3145#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3104#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3143#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3119#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3117#L12 [2020-11-29 20:47:40,770 INFO L796 eck$LassoCheckResult]: Loop: 3117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3115#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3111#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3113#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3117#L12 [2020-11-29 20:47:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -719445336, now seen corresponding path program 16 times [2020-11-29 20:47:40,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:40,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044160903] [2020-11-29 20:47:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,788 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1274769951, now seen corresponding path program 1 times [2020-11-29 20:47:40,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:40,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089211004] [2020-11-29 20:47:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:40,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:40,796 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:40,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1755888518, now seen corresponding path program 17 times [2020-11-29 20:47:40,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:40,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654335679] [2020-11-29 20:47:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 52 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:47:41,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654335679] [2020-11-29 20:47:41,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537162479] [2020-11-29 20:47:41,029 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:41,084 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2020-11-29 20:47:41,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:41,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 20:47:41,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 52 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:47:41,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:41,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2020-11-29 20:47:41,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667200124] [2020-11-29 20:47:41,440 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:41,441 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:41,441 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:41,441 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:41,441 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 20:47:41,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:41,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:41,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:41,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration17_Loop [2020-11-29 20:47:41,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:41,441 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:41,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:41,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:41,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:41,549 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:41,549 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:41,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 20:47:41,558 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:41,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 20:47:41,609 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:41,784 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 20:47:41,787 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 20:47:41,787 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 20:47:41,787 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 20:47:41,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 20:47:41,787 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 20:47:41,787 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:41,787 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 20:47:41,787 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 20:47:41,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration17_Loop [2020-11-29 20:47:41,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 20:47:41,788 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 20:47:41,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:41,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:41,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 20:47:41,876 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 20:47:41,876 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:41,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 20:47:41,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 20:47:41,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 20:47:41,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 20:47:41,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 20:47:41,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 20:47:41,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 20:47:41,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:41,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 20:47:41,902 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-29 20:47:41,902 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 20:47:41,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 20:47:41,907 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 20:47:41,907 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 20:47:41,907 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0) = 1*ULTIMATE.start_main_~range~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 20:47:41,941 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 20:47:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:41,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:47:41,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:42,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:47:42,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:42,059 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-11-29 20:47:42,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 53 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-11-29 20:47:42,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 53 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 99 states and 115 transitions. Complement of second has 6 states. [2020-11-29 20:47:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 20:47:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-11-29 20:47:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-11-29 20:47:42,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 38 letters. Loop has 6 letters. [2020-11-29 20:47:42,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:42,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 44 letters. Loop has 6 letters. [2020-11-29 20:47:42,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:42,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 38 letters. Loop has 12 letters. [2020-11-29 20:47:42,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 20:47:42,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 115 transitions. [2020-11-29 20:47:42,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:42,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 54 states and 62 transitions. [2020-11-29 20:47:42,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-29 20:47:42,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:47:42,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2020-11-29 20:47:42,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:42,107 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-11-29 20:47:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2020-11-29 20:47:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-11-29 20:47:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-29 20:47:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2020-11-29 20:47:42,109 INFO L714 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2020-11-29 20:47:42,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-29 20:47:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=441, Unknown=0, NotChecked=0, Total=702 [2020-11-29 20:47:42,111 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 27 states. [2020-11-29 20:47:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:42,268 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-11-29 20:47:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 20:47:42,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2020-11-29 20:47:42,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:42,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 62 transitions. [2020-11-29 20:47:42,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:42,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:42,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 62 transitions. [2020-11-29 20:47:42,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:42,271 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2020-11-29 20:47:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 62 transitions. [2020-11-29 20:47:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-29 20:47:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-29 20:47:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-29 20:47:42,275 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-29 20:47:42,275 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-29 20:47:42,275 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-11-29 20:47:42,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2020-11-29 20:47:42,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:42,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:42,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:42,277 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 12, 2, 1, 1] [2020-11-29 20:47:42,277 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:42,277 INFO L794 eck$LassoCheckResult]: Stem: 3662#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 3663#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3669#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3714#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3671#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3666#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3713#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3712#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3711#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3710#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3709#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3708#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3707#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3706#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3705#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3704#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3703#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3702#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3701#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3700#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3699#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3698#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3697#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3696#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3695#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3694#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3693#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3692#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3690#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3689#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3688#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3687#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3686#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3685#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3682#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3683#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3681#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3680#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3679#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3677#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3672#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 3664#L12-1 [2020-11-29 20:47:42,277 INFO L796 eck$LassoCheckResult]: Loop: 3664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3665#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 3664#L12-1 [2020-11-29 20:47:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:42,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1344774389, now seen corresponding path program 2 times [2020-11-29 20:47:42,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:42,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201880379] [2020-11-29 20:47:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 217 proven. 82 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 20:47:42,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201880379] [2020-11-29 20:47:42,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575013588] [2020-11-29 20:47:42,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:42,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:47:42,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:42,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-29 20:47:42,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:47:43,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:43,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2020-11-29 20:47:43,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800526335] [2020-11-29 20:47:43,067 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 14 times [2020-11-29 20:47:43,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:43,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386401946] [2020-11-29 20:47:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:43,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:43,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:43,073 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:43,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-29 20:47:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2020-11-29 20:47:43,122 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. cyclomatic complexity: 10 Second operand 30 states. [2020-11-29 20:47:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:44,195 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2020-11-29 20:47:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-11-29 20:47:44,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 196 transitions. [2020-11-29 20:47:44,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:44,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 166 states and 194 transitions. [2020-11-29 20:47:44,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-29 20:47:44,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-29 20:47:44,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 194 transitions. [2020-11-29 20:47:44,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:44,200 INFO L691 BuchiCegarLoop]: Abstraction has 166 states and 194 transitions. [2020-11-29 20:47:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 194 transitions. [2020-11-29 20:47:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 89. [2020-11-29 20:47:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-29 20:47:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2020-11-29 20:47:44,203 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 106 transitions. [2020-11-29 20:47:44,203 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 106 transitions. [2020-11-29 20:47:44,203 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-11-29 20:47:44,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 106 transitions. [2020-11-29 20:47:44,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:44,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:44,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:44,212 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 14, 3, 1, 1] [2020-11-29 20:47:44,212 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:44,214 INFO L794 eck$LassoCheckResult]: Stem: 4128#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 4129#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4133#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4216#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4214#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4213#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4211#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4210#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4209#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4208#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4207#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4206#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4205#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4204#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4203#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4202#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4201#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4200#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4199#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4197#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4196#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4195#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4194#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4193#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4192#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4191#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4190#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4189#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4187#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4184#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4183#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4182#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4181#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4180#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4156#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4154#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4152#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4150#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4145#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4141#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4137#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4136#L12-1 [2020-11-29 20:47:44,214 INFO L796 eck$LassoCheckResult]: Loop: 4136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4135#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4136#L12-1 [2020-11-29 20:47:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash -227533164, now seen corresponding path program 3 times [2020-11-29 20:47:44,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:44,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778088318] [2020-11-29 20:47:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 34 proven. 135 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-11-29 20:47:44,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778088318] [2020-11-29 20:47:44,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300212321] [2020-11-29 20:47:44,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:44,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-29 20:47:44,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:44,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:47:44,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2020-11-29 20:47:44,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:44,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-11-29 20:47:44,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241507699] [2020-11-29 20:47:44,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:44,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 15 times [2020-11-29 20:47:44,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:44,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962041684] [2020-11-29 20:47:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:44,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:44,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:44,369 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:44,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:47:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:47:44,392 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. cyclomatic complexity: 20 Second operand 8 states. [2020-11-29 20:47:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:44,535 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2020-11-29 20:47:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:47:44,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 214 transitions. [2020-11-29 20:47:44,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:44,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 173 states and 212 transitions. [2020-11-29 20:47:44,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:44,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:44,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 212 transitions. [2020-11-29 20:47:44,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:44,541 INFO L691 BuchiCegarLoop]: Abstraction has 173 states and 212 transitions. [2020-11-29 20:47:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 212 transitions. [2020-11-29 20:47:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 98. [2020-11-29 20:47:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-29 20:47:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2020-11-29 20:47:44,546 INFO L714 BuchiCegarLoop]: Abstraction has 98 states and 116 transitions. [2020-11-29 20:47:44,547 INFO L594 BuchiCegarLoop]: Abstraction has 98 states and 116 transitions. [2020-11-29 20:47:44,547 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-11-29 20:47:44,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 116 transitions. [2020-11-29 20:47:44,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:44,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:44,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:44,552 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 16, 4, 1, 1] [2020-11-29 20:47:44,552 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:44,553 INFO L794 eck$LassoCheckResult]: Stem: 4572#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 4573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4578#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4579#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4669#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4581#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4576#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4668#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4667#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4666#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4665#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4663#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4662#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4660#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4659#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4657#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4656#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4654#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4653#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4652#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4651#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4650#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4649#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4647#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4646#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4645#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4644#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4643#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4642#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4641#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4640#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4639#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4638#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4637#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4635#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4636#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4634#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4633#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4632#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4631#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4630#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4629#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4628#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4627#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4626#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4624#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4600#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4597#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4598#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4595#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4590#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4589#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4588#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4582#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4574#L12-1 [2020-11-29 20:47:44,553 INFO L796 eck$LassoCheckResult]: Loop: 4574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4575#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4574#L12-1 [2020-11-29 20:47:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash 812435755, now seen corresponding path program 4 times [2020-11-29 20:47:44,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:44,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60732762] [2020-11-29 20:47:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 144 proven. 186 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2020-11-29 20:47:44,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60732762] [2020-11-29 20:47:44,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910593435] [2020-11-29 20:47:44,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:44,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:47:44,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:44,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 20:47:44,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 429 proven. 174 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-29 20:47:45,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:45,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20] total 25 [2020-11-29 20:47:45,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287650459] [2020-11-29 20:47:45,207 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 16 times [2020-11-29 20:47:45,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:45,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48081693] [2020-11-29 20:47:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:45,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:45,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:45,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:45,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 20:47:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2020-11-29 20:47:45,243 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. cyclomatic complexity: 22 Second operand 25 states. [2020-11-29 20:47:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:46,463 INFO L93 Difference]: Finished difference Result 254 states and 296 transitions. [2020-11-29 20:47:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-11-29 20:47:46,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 296 transitions. [2020-11-29 20:47:46,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:46,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 248 states and 290 transitions. [2020-11-29 20:47:46,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-29 20:47:46,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-29 20:47:46,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 290 transitions. [2020-11-29 20:47:46,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:46,469 INFO L691 BuchiCegarLoop]: Abstraction has 248 states and 290 transitions. [2020-11-29 20:47:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 290 transitions. [2020-11-29 20:47:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 116. [2020-11-29 20:47:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-11-29 20:47:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2020-11-29 20:47:46,472 INFO L714 BuchiCegarLoop]: Abstraction has 116 states and 136 transitions. [2020-11-29 20:47:46,472 INFO L594 BuchiCegarLoop]: Abstraction has 116 states and 136 transitions. [2020-11-29 20:47:46,472 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-11-29 20:47:46,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 136 transitions. [2020-11-29 20:47:46,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:46,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:46,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:46,474 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 19, 4, 1, 1] [2020-11-29 20:47:46,474 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:46,475 INFO L794 eck$LassoCheckResult]: Stem: 5269#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 5270#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5271#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5274#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5379#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5377#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5376#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5373#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5361#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5358#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5355#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5352#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5346#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5343#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5341#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5340#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5339#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5338#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5337#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5336#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5328#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5323#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5321#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5282#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5281#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5278#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 5277#L12-1 [2020-11-29 20:47:46,475 INFO L796 eck$LassoCheckResult]: Loop: 5277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5276#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 5277#L12-1 [2020-11-29 20:47:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash -933829070, now seen corresponding path program 5 times [2020-11-29 20:47:46,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:46,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375179186] [2020-11-29 20:47:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 266 proven. 240 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-11-29 20:47:46,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375179186] [2020-11-29 20:47:46,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91104955] [2020-11-29 20:47:46,589 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:46,634 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2020-11-29 20:47:46,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:46,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 20:47:46,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 569 proven. 205 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-29 20:47:47,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:47,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2020-11-29 20:47:47,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623880012] [2020-11-29 20:47:47,037 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 17 times [2020-11-29 20:47:47,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:47,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124826205] [2020-11-29 20:47:47,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:47,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:47,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:47,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:47,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-29 20:47:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2020-11-29 20:47:47,075 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. cyclomatic complexity: 24 Second operand 26 states. [2020-11-29 20:47:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:48,224 INFO L93 Difference]: Finished difference Result 252 states and 291 transitions. [2020-11-29 20:47:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2020-11-29 20:47:48,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 291 transitions. [2020-11-29 20:47:48,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:48,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 244 states and 283 transitions. [2020-11-29 20:47:48,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-29 20:47:48,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-29 20:47:48,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 283 transitions. [2020-11-29 20:47:48,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:48,229 INFO L691 BuchiCegarLoop]: Abstraction has 244 states and 283 transitions. [2020-11-29 20:47:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 283 transitions. [2020-11-29 20:47:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 119. [2020-11-29 20:47:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-29 20:47:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2020-11-29 20:47:48,233 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2020-11-29 20:47:48,233 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2020-11-29 20:47:48,233 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-11-29 20:47:48,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 138 transitions. [2020-11-29 20:47:48,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:48,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:48,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:48,235 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [26, 25, 21, 4, 1, 1] [2020-11-29 20:47:48,235 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:48,236 INFO L794 eck$LassoCheckResult]: Stem: 5965#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 5966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5970#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6083#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6078#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6077#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6075#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6073#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6065#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6063#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6060#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6059#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6057#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6056#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6054#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6053#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6051#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6048#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6046#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6042#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6037#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6034#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6033#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6032#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6013#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6031#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6030#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6029#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6028#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6027#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6025#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6024#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6016#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6006#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6005#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5978#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5974#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 5973#L12-1 [2020-11-29 20:47:48,236 INFO L796 eck$LassoCheckResult]: Loop: 5973#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5972#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 5973#L12-1 [2020-11-29 20:47:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:48,236 INFO L82 PathProgramCache]: Analyzing trace with hash 247033814, now seen corresponding path program 6 times [2020-11-29 20:47:48,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:48,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128567151] [2020-11-29 20:47:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 297 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2020-11-29 20:47:48,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128567151] [2020-11-29 20:47:48,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709513267] [2020-11-29 20:47:48,332 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:48,368 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-11-29 20:47:48,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:48,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 20:47:48,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 230 proven. 5 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2020-11-29 20:47:48,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:48,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2020-11-29 20:47:48,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798914322] [2020-11-29 20:47:48,426 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 18 times [2020-11-29 20:47:48,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:48,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290734523] [2020-11-29 20:47:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:48,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:48,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:48,431 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:48,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 20:47:48,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:47:48,453 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. cyclomatic complexity: 23 Second operand 13 states. [2020-11-29 20:47:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:48,843 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2020-11-29 20:47:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-29 20:47:48,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 163 transitions. [2020-11-29 20:47:48,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:48,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 161 transitions. [2020-11-29 20:47:48,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-29 20:47:48,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-29 20:47:48,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 161 transitions. [2020-11-29 20:47:48,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:48,846 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 161 transitions. [2020-11-29 20:47:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 161 transitions. [2020-11-29 20:47:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2020-11-29 20:47:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-11-29 20:47:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2020-11-29 20:47:48,850 INFO L714 BuchiCegarLoop]: Abstraction has 126 states and 145 transitions. [2020-11-29 20:47:48,850 INFO L594 BuchiCegarLoop]: Abstraction has 126 states and 145 transitions. [2020-11-29 20:47:48,850 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-11-29 20:47:48,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 145 transitions. [2020-11-29 20:47:48,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:48,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:48,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:48,852 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [28, 27, 22, 5, 1, 1] [2020-11-29 20:47:48,852 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:48,852 INFO L794 eck$LassoCheckResult]: Stem: 6506#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 6507#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6509#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6512#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6631#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6513#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6514#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6510#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6511#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6630#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6629#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6628#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6627#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6626#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6624#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6623#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6622#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6621#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6620#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6617#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6616#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6614#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6613#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6612#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6610#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6609#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6608#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6607#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6606#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6603#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6597#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6598#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6594#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6580#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6579#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6578#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6577#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6576#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6575#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6572#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6571#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6570#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6569#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6566#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6564#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6563#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6562#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6561#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6530#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6526#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6525#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6524#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6519#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6520#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6517#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 6516#L12-1 [2020-11-29 20:47:48,852 INFO L796 eck$LassoCheckResult]: Loop: 6516#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6515#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 6516#L12-1 [2020-11-29 20:47:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -399996620, now seen corresponding path program 7 times [2020-11-29 20:47:48,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:48,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528993091] [2020-11-29 20:47:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2020-11-29 20:47:48,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528993091] [2020-11-29 20:47:48,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:47:48,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:47:48,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068679605] [2020-11-29 20:47:48,906 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 19 times [2020-11-29 20:47:48,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:48,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138231755] [2020-11-29 20:47:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:48,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:48,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:48,912 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:48,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:48,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:47:48,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:47:48,928 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. cyclomatic complexity: 23 Second operand 4 states. [2020-11-29 20:47:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:48,946 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2020-11-29 20:47:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:47:48,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 144 transitions. [2020-11-29 20:47:48,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:48,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 144 transitions. [2020-11-29 20:47:48,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:48,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:48,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 144 transitions. [2020-11-29 20:47:48,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:48,949 INFO L691 BuchiCegarLoop]: Abstraction has 126 states and 144 transitions. [2020-11-29 20:47:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 144 transitions. [2020-11-29 20:47:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2020-11-29 20:47:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-29 20:47:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2020-11-29 20:47:48,952 INFO L714 BuchiCegarLoop]: Abstraction has 121 states and 139 transitions. [2020-11-29 20:47:48,952 INFO L594 BuchiCegarLoop]: Abstraction has 121 states and 139 transitions. [2020-11-29 20:47:48,952 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-11-29 20:47:48,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 139 transitions. [2020-11-29 20:47:48,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:48,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:48,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:48,954 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [29, 28, 23, 5, 1, 1] [2020-11-29 20:47:48,954 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:48,954 INFO L794 eck$LassoCheckResult]: Stem: 6767#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 6768#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6773#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6774#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6771#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6772#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6886#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6884#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6880#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6879#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6878#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6874#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6872#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6871#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6870#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6869#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6868#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6867#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6866#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6865#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6864#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6863#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6862#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6861#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6860#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6859#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6858#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6857#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6856#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6855#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6852#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6851#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6850#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6849#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6848#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6847#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6843#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6841#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6839#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6835#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6833#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6831#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6829#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6826#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6824#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6822#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6820#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6818#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6814#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6812#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6810#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6808#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6806#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6804#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6802#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6840#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6792#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6790#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6788#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6779#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6785#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6784#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6782#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6777#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 6769#L12-1 [2020-11-29 20:47:48,954 INFO L796 eck$LassoCheckResult]: Loop: 6769#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6770#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 6769#L12-1 [2020-11-29 20:47:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:48,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2002991635, now seen corresponding path program 8 times [2020-11-29 20:47:48,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:48,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489111158] [2020-11-29 20:47:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 483 proven. 357 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2020-11-29 20:47:49,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489111158] [2020-11-29 20:47:49,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227989752] [2020-11-29 20:47:49,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:49,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:47:49,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:49,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 20:47:49,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 615 proven. 315 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-29 20:47:49,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:49,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2020-11-29 20:47:49,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819078064] [2020-11-29 20:47:49,416 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 20 times [2020-11-29 20:47:49,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:49,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090624165] [2020-11-29 20:47:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:49,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:49,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:49,421 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:49,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:49,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-29 20:47:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=359, Unknown=0, NotChecked=0, Total=552 [2020-11-29 20:47:49,439 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. cyclomatic complexity: 22 Second operand 24 states. [2020-11-29 20:47:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:49,554 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2020-11-29 20:47:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-29 20:47:49,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 153 transitions. [2020-11-29 20:47:49,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:49,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 131 states and 149 transitions. [2020-11-29 20:47:49,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:49,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:49,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 149 transitions. [2020-11-29 20:47:49,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:49,557 INFO L691 BuchiCegarLoop]: Abstraction has 131 states and 149 transitions. [2020-11-29 20:47:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 149 transitions. [2020-11-29 20:47:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2020-11-29 20:47:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-29 20:47:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2020-11-29 20:47:49,559 INFO L714 BuchiCegarLoop]: Abstraction has 127 states and 145 transitions. [2020-11-29 20:47:49,560 INFO L594 BuchiCegarLoop]: Abstraction has 127 states and 145 transitions. [2020-11-29 20:47:49,560 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-11-29 20:47:49,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 145 transitions. [2020-11-29 20:47:49,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:49,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:49,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:49,562 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [31, 30, 25, 5, 1, 1] [2020-11-29 20:47:49,562 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:49,562 INFO L794 eck$LassoCheckResult]: Stem: 7308#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 7309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7314#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7315#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 7434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7312#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7433#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7430#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7427#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7426#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7425#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7424#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7423#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7422#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7421#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7420#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7419#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7418#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7417#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7416#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7415#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7414#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7413#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7412#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7411#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7410#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7409#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7408#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7407#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7406#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7405#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7404#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7403#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7402#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7401#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7400#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7399#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7398#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7396#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7395#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7394#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 7393#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7392#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7391#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7390#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7389#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7388#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7385#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7379#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7335#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7365#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7363#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7361#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 7359#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7357#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7355#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7353#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7347#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7343#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7341#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7376#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7331#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 7332#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7329#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 7327#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7326#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 7325#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 7324#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7318#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 7310#L12-1 [2020-11-29 20:47:49,562 INFO L796 eck$LassoCheckResult]: Loop: 7310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 7311#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 7310#L12-1 [2020-11-29 20:47:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1003691849, now seen corresponding path program 9 times [2020-11-29 20:47:49,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:49,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034970797] [2020-11-29 20:47:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 760 proven. 443 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2020-11-29 20:47:49,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034970797] [2020-11-29 20:47:49,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445801344] [2020-11-29 20:47:49,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:49,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-29 20:47:49,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:49,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 20:47:49,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 477 proven. 33 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2020-11-29 20:47:49,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:49,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 19 [2020-11-29 20:47:49,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484352488] [2020-11-29 20:47:49,880 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:49,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 21 times [2020-11-29 20:47:49,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:49,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601773886] [2020-11-29 20:47:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:49,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:49,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:49,885 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:49,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:49,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 20:47:49,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:47:49,903 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. cyclomatic complexity: 22 Second operand 19 states. [2020-11-29 20:47:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:51,021 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2020-11-29 20:47:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-29 20:47:51,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 336 transitions. [2020-11-29 20:47:51,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:51,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 273 states and 308 transitions. [2020-11-29 20:47:51,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 20:47:51,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 20:47:51,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 308 transitions. [2020-11-29 20:47:51,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:51,027 INFO L691 BuchiCegarLoop]: Abstraction has 273 states and 308 transitions. [2020-11-29 20:47:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 308 transitions. [2020-11-29 20:47:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 160. [2020-11-29 20:47:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-11-29 20:47:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2020-11-29 20:47:51,030 INFO L714 BuchiCegarLoop]: Abstraction has 160 states and 174 transitions. [2020-11-29 20:47:51,030 INFO L594 BuchiCegarLoop]: Abstraction has 160 states and 174 transitions. [2020-11-29 20:47:51,030 INFO L427 BuchiCegarLoop]: ======== Iteration 26============ [2020-11-29 20:47:51,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 174 transitions. [2020-11-29 20:47:51,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:51,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:51,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:51,033 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [44, 43, 35, 8, 1, 1] [2020-11-29 20:47:51,033 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:51,033 INFO L794 eck$LassoCheckResult]: Stem: 8115#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 8116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8121#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8261#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8260#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8259#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8258#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8257#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8256#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8255#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8253#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8252#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8251#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8250#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8249#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8247#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8246#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8245#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8244#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8242#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8241#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8240#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8238#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8235#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8234#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8233#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8232#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8229#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8226#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8225#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8223#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8222#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8220#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8221#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8219#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8218#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8217#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8216#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8214#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8213#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8211#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8210#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8209#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8208#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8207#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8206#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8205#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8203#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8199#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8194#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8193#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8192#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8191#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8190#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8189#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8187#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8184#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8183#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8182#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8181#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8180#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8179#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8178#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8177#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8176#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8174#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8173#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8172#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8171#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8170#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8169#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8168#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8167#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8166#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8165#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8164#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8163#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8162#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8161#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8159#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8158#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8157#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8156#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8155#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8154#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8153#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8152#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8151#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8150#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8149#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8147#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8146#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8145#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8144#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8143#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8142#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8141#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8133#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8138#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8137#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8136#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8135#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8134#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8127#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 8132#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8131#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 8130#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 8129#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8125#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 8126#L12-1 [2020-11-29 20:47:51,034 INFO L796 eck$LassoCheckResult]: Loop: 8126#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 8128#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 8126#L12-1 [2020-11-29 20:47:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash -20877514, now seen corresponding path program 10 times [2020-11-29 20:47:51,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:51,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308916332] [2020-11-29 20:47:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1426 proven. 444 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2020-11-29 20:47:51,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308916332] [2020-11-29 20:47:51,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715899705] [2020-11-29 20:47:51,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:51,262 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:47:51,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:51,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-29 20:47:51,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1765 proven. 420 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-11-29 20:47:51,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:51,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 34 [2020-11-29 20:47:51,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448667412] [2020-11-29 20:47:51,948 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 22 times [2020-11-29 20:47:51,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:51,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81326644] [2020-11-29 20:47:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:51,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:51,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:51,954 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:51,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:51,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-29 20:47:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2020-11-29 20:47:51,981 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. cyclomatic complexity: 18 Second operand 34 states. [2020-11-29 20:47:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:54,270 INFO L93 Difference]: Finished difference Result 359 states and 406 transitions. [2020-11-29 20:47:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2020-11-29 20:47:54,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 406 transitions. [2020-11-29 20:47:54,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:54,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 353 states and 400 transitions. [2020-11-29 20:47:54,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-11-29 20:47:54,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-29 20:47:54,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 400 transitions. [2020-11-29 20:47:54,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:54,276 INFO L691 BuchiCegarLoop]: Abstraction has 353 states and 400 transitions. [2020-11-29 20:47:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 400 transitions. [2020-11-29 20:47:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 222. [2020-11-29 20:47:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-11-29 20:47:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 249 transitions. [2020-11-29 20:47:54,282 INFO L714 BuchiCegarLoop]: Abstraction has 222 states and 249 transitions. [2020-11-29 20:47:54,282 INFO L594 BuchiCegarLoop]: Abstraction has 222 states and 249 transitions. [2020-11-29 20:47:54,282 INFO L427 BuchiCegarLoop]: ======== Iteration 27============ [2020-11-29 20:47:54,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 249 transitions. [2020-11-29 20:47:54,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:54,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:54,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:54,286 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [59, 58, 48, 10, 1, 1] [2020-11-29 20:47:54,287 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:54,287 INFO L794 eck$LassoCheckResult]: Stem: 9219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 9220#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9221#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9225#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9223#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9439#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9438#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9437#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9436#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9435#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9434#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9433#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9430#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9427#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9426#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9425#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9424#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9423#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9422#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9421#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9420#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9419#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9418#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9417#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9416#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9415#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9414#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9413#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9412#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9411#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9410#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9409#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9408#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9407#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9406#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9405#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9403#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9404#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9402#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9401#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9400#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9399#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9398#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9397#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9396#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9395#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9394#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9393#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9392#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9391#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9390#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9389#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9388#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9385#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9380#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9379#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9378#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9366#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9365#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9364#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9363#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9362#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9360#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9359#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9358#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9357#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9356#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9354#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9353#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9352#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9351#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9350#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9349#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9327#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9298#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9346#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9317#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9316#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9315#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9314#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9313#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9312#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9311#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9310#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9308#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9307#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9306#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9303#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9300#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9304#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9296#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9295#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9294#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9293#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9292#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9291#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9290#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9289#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9288#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9287#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9286#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9285#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9284#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9283#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9282#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9265#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9279#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9278#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9277#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9276#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9275#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9274#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9273#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9272#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9271#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9270#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9269#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9268#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9267#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9253#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9264#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9263#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9262#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9261#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9260#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9259#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9258#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9257#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9256#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9255#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9244#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9252#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9251#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9250#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9249#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9247#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9246#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9238#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9242#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9241#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9240#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9232#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9235#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9234#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9229#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 9231#L12-1 [2020-11-29 20:47:54,287 INFO L796 eck$LassoCheckResult]: Loop: 9231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9233#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 9231#L12-1 [2020-11-29 20:47:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1405044931, now seen corresponding path program 11 times [2020-11-29 20:47:54,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:54,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862452930] [2020-11-29 20:47:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 2496 proven. 513 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2020-11-29 20:47:54,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862452930] [2020-11-29 20:47:54,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580009714] [2020-11-29 20:47:54,485 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:54,539 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2020-11-29 20:47:54,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:54,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 20:47:54,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 3360 proven. 248 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2020-11-29 20:47:54,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:54,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 28 [2020-11-29 20:47:54,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043862364] [2020-11-29 20:47:54,986 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 23 times [2020-11-29 20:47:54,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:54,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913823326] [2020-11-29 20:47:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:54,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:54,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:54,992 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:55,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-29 20:47:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2020-11-29 20:47:55,016 INFO L87 Difference]: Start difference. First operand 222 states and 249 transitions. cyclomatic complexity: 31 Second operand 28 states. [2020-11-29 20:47:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:55,804 INFO L93 Difference]: Finished difference Result 270 states and 298 transitions. [2020-11-29 20:47:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-29 20:47:55,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 298 transitions. [2020-11-29 20:47:55,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:55,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 266 states and 293 transitions. [2020-11-29 20:47:55,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:55,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:55,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 293 transitions. [2020-11-29 20:47:55,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:55,815 INFO L691 BuchiCegarLoop]: Abstraction has 266 states and 293 transitions. [2020-11-29 20:47:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 293 transitions. [2020-11-29 20:47:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 246. [2020-11-29 20:47:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-11-29 20:47:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 273 transitions. [2020-11-29 20:47:55,820 INFO L714 BuchiCegarLoop]: Abstraction has 246 states and 273 transitions. [2020-11-29 20:47:55,820 INFO L594 BuchiCegarLoop]: Abstraction has 246 states and 273 transitions. [2020-11-29 20:47:55,820 INFO L427 BuchiCegarLoop]: ======== Iteration 28============ [2020-11-29 20:47:55,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 273 transitions. [2020-11-29 20:47:55,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:55,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:55,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:55,824 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [60, 59, 49, 10, 1, 1] [2020-11-29 20:47:55,824 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:55,825 INFO L794 eck$LassoCheckResult]: Stem: 10319#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 10320#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10326#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10564#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10327#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10328#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10323#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10560#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10556#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10555#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10554#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10553#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10551#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10548#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10545#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10542#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10539#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10537#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10536#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10535#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10533#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10531#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10530#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10527#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10528#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10526#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10525#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10524#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10523#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10522#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10521#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10520#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10519#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10518#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10517#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10516#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10515#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10514#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10513#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10512#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10511#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10510#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10509#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10508#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10507#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10506#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10505#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10504#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10503#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10502#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10450#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10501#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10498#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10489#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10483#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10480#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10444#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10445#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10439#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10437#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10433#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10428#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10425#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10420#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10421#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10416#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10417#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10412#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10413#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10405#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10406#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10400#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10396#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10395#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10394#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10393#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10392#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10390#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10389#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10387#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10383#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10366#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10380#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10378#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10377#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10375#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10371#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10368#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10354#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10365#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10364#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10363#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10362#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10360#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10359#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10358#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10357#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10356#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10355#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10353#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10352#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10351#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10350#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10349#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10348#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10347#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10346#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10344#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10343#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10342#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10341#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10340#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10331#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 10338#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 10336#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 10335#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10329#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 10321#L12-1 [2020-11-29 20:47:55,825 INFO L796 eck$LassoCheckResult]: Loop: 10321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 10322#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 10321#L12-1 [2020-11-29 20:47:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1282551758, now seen corresponding path program 12 times [2020-11-29 20:47:55,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:55,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071732917] [2020-11-29 20:47:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2418 proven. 1716 refuted. 0 times theorem prover too weak. 1117 trivial. 0 not checked. [2020-11-29 20:47:56,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071732917] [2020-11-29 20:47:56,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358582299] [2020-11-29 20:47:56,036 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:56,102 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2020-11-29 20:47:56,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:56,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-29 20:47:56,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2600 proven. 585 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2020-11-29 20:47:56,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:56,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2020-11-29 20:47:56,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408177748] [2020-11-29 20:47:56,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:56,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 24 times [2020-11-29 20:47:56,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:56,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035973691] [2020-11-29 20:47:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:56,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:56,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:56,300 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:56,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 20:47:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2020-11-29 20:47:56,318 INFO L87 Difference]: Start difference. First operand 246 states and 273 transitions. cyclomatic complexity: 32 Second operand 21 states. [2020-11-29 20:47:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:56,759 INFO L93 Difference]: Finished difference Result 363 states and 400 transitions. [2020-11-29 20:47:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-29 20:47:56,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 400 transitions. [2020-11-29 20:47:56,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:56,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 359 states and 395 transitions. [2020-11-29 20:47:56,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:56,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:56,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 359 states and 395 transitions. [2020-11-29 20:47:56,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:56,764 INFO L691 BuchiCegarLoop]: Abstraction has 359 states and 395 transitions. [2020-11-29 20:47:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states and 395 transitions. [2020-11-29 20:47:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 330. [2020-11-29 20:47:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-11-29 20:47:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 365 transitions. [2020-11-29 20:47:56,771 INFO L714 BuchiCegarLoop]: Abstraction has 330 states and 365 transitions. [2020-11-29 20:47:56,771 INFO L594 BuchiCegarLoop]: Abstraction has 330 states and 365 transitions. [2020-11-29 20:47:56,772 INFO L427 BuchiCegarLoop]: ======== Iteration 29============ [2020-11-29 20:47:56,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 330 states and 365 transitions. [2020-11-29 20:47:56,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:56,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:56,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:56,775 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [62, 61, 51, 10, 1, 1] [2020-11-29 20:47:56,775 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:56,776 INFO L794 eck$LassoCheckResult]: Stem: 11519#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 11520#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11526#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11527#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11757#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11756#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11755#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11754#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11752#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11751#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11750#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11748#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11747#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11746#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11745#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11744#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11743#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11742#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11741#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11740#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11739#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11738#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11737#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11736#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11735#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11734#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11733#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11732#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11731#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11730#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11729#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11728#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11727#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11726#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11725#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11724#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11723#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11722#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11721#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11720#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11718#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11716#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11717#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11715#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11714#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11713#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11712#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11711#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11710#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11709#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11708#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11707#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11706#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11705#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11704#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11703#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11702#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11701#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11700#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11699#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11698#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11697#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11696#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11695#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11694#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11693#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11692#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11690#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11689#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11688#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11686#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11687#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11685#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11684#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11683#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11682#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11681#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11680#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11678#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11676#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11674#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11672#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11668#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11666#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11664#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11662#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11660#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11656#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11654#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11652#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11650#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11648#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11646#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11644#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11645#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11641#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11640#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11639#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11637#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11635#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11633#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11631#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11629#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11627#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11621#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11617#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11615#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11613#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11610#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11581#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11765#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11598#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11597#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11596#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11595#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11594#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11593#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11592#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11591#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11590#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11589#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11588#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11586#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11585#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11584#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11583#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11566#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11579#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11578#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11577#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11575#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11572#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11571#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11568#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11554#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11567#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11563#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11560#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11556#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11545#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11553#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11551#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11548#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11546#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11542#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11531#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 11538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11537#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 11536#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 11534#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11529#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 11521#L12-1 [2020-11-29 20:47:56,776 INFO L796 eck$LassoCheckResult]: Loop: 11521#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 11522#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 11521#L12-1 [2020-11-29 20:47:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1433360102, now seen corresponding path program 13 times [2020-11-29 20:47:56,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:56,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162078700] [2020-11-29 20:47:56,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2822 proven. 1233 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2020-11-29 20:47:56,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162078700] [2020-11-29 20:47:56,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251650555] [2020-11-29 20:47:56,996 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:57,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-29 20:47:57,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2192 proven. 360 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2020-11-29 20:47:57,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:57,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2020-11-29 20:47:57,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172098325] [2020-11-29 20:47:57,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:57,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 25 times [2020-11-29 20:47:57,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:57,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047118761] [2020-11-29 20:47:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:57,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:57,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:57,444 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:57,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-29 20:47:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=485, Unknown=0, NotChecked=0, Total=756 [2020-11-29 20:47:57,458 INFO L87 Difference]: Start difference. First operand 330 states and 365 transitions. cyclomatic complexity: 41 Second operand 28 states. [2020-11-29 20:47:57,893 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-29 20:47:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:57,923 INFO L93 Difference]: Finished difference Result 321 states and 355 transitions. [2020-11-29 20:47:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-29 20:47:57,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 321 states and 355 transitions. [2020-11-29 20:47:57,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:57,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 321 states to 317 states and 351 transitions. [2020-11-29 20:47:57,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:57,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:57,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 351 transitions. [2020-11-29 20:47:57,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:57,928 INFO L691 BuchiCegarLoop]: Abstraction has 317 states and 351 transitions. [2020-11-29 20:47:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 351 transitions. [2020-11-29 20:47:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2020-11-29 20:47:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-11-29 20:47:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 349 transitions. [2020-11-29 20:47:57,935 INFO L714 BuchiCegarLoop]: Abstraction has 315 states and 349 transitions. [2020-11-29 20:47:57,935 INFO L594 BuchiCegarLoop]: Abstraction has 315 states and 349 transitions. [2020-11-29 20:47:57,935 INFO L427 BuchiCegarLoop]: ======== Iteration 30============ [2020-11-29 20:47:57,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 349 transitions. [2020-11-29 20:47:57,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:57,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:57,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:57,950 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [64, 63, 53, 10, 1, 1] [2020-11-29 20:47:57,950 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:57,951 INFO L794 eck$LassoCheckResult]: Stem: 12772#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 12773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12778#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12779#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13027#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13025#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13024#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13022#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13021#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13020#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13019#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13018#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13017#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13015#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13014#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13013#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13012#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13007#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13004#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13003#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13002#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13001#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13000#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12996#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12995#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12994#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12990#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12989#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12988#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12987#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12986#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12985#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12984#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12982#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12981#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12980#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12979#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12978#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12977#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12976#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12975#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12974#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12973#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12972#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12971#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12970#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12969#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12968#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12967#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12966#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12965#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12964#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12962#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12961#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12960#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12959#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12958#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12957#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12956#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12955#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12952#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12951#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12950#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12949#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12948#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12947#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12946#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12945#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12944#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12943#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12942#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12940#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12936#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12934#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12930#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12928#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12924#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12922#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12918#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12916#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12911#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12912#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12881#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12876#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12872#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12870#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12865#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12862#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12852#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12851#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12850#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12849#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12845#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12844#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12841#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12840#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12839#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12838#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12821#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12835#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12834#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12833#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12832#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12830#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12829#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12828#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12827#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12824#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12823#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12809#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12822#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12818#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12815#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12814#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12812#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12811#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12810#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12808#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12806#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12805#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12804#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12803#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12801#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12798#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12797#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12796#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12795#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12786#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 12793#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12792#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 12791#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 12790#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12784#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 12774#L12-1 [2020-11-29 20:47:57,951 INFO L796 eck$LassoCheckResult]: Loop: 12774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 12775#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 12774#L12-1 [2020-11-29 20:47:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2129101710, now seen corresponding path program 14 times [2020-11-29 20:47:57,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:57,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714274406] [2020-11-29 20:47:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2666 proven. 2106 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2020-11-29 20:47:58,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714274406] [2020-11-29 20:47:58,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267285234] [2020-11-29 20:47:58,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:58,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:47:58,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:58,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 20:47:58,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:47:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2380 proven. 408 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2020-11-29 20:47:58,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:47:58,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 28 [2020-11-29 20:47:58,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432330403] [2020-11-29 20:47:58,648 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:47:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:58,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 26 times [2020-11-29 20:47:58,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:58,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376407017] [2020-11-29 20:47:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:58,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:47:58,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:47:58,652 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:47:58,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:47:58,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-29 20:47:58,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=513, Unknown=0, NotChecked=0, Total=812 [2020-11-29 20:47:58,687 INFO L87 Difference]: Start difference. First operand 315 states and 349 transitions. cyclomatic complexity: 40 Second operand 29 states. [2020-11-29 20:47:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:47:59,158 INFO L93 Difference]: Finished difference Result 353 states and 388 transitions. [2020-11-29 20:47:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-29 20:47:59,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 388 transitions. [2020-11-29 20:47:59,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:59,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 349 states and 384 transitions. [2020-11-29 20:47:59,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-29 20:47:59,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-29 20:47:59,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 384 transitions. [2020-11-29 20:47:59,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:47:59,163 INFO L691 BuchiCegarLoop]: Abstraction has 349 states and 384 transitions. [2020-11-29 20:47:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 384 transitions. [2020-11-29 20:47:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 282. [2020-11-29 20:47:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-29 20:47:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 310 transitions. [2020-11-29 20:47:59,170 INFO L714 BuchiCegarLoop]: Abstraction has 282 states and 310 transitions. [2020-11-29 20:47:59,170 INFO L594 BuchiCegarLoop]: Abstraction has 282 states and 310 transitions. [2020-11-29 20:47:59,170 INFO L427 BuchiCegarLoop]: ======== Iteration 31============ [2020-11-29 20:47:59,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 310 transitions. [2020-11-29 20:47:59,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:47:59,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:47:59,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:47:59,174 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [72, 71, 60, 11, 1, 1] [2020-11-29 20:47:59,174 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:47:59,175 INFO L794 eck$LassoCheckResult]: Stem: 14073#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 14074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14080#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14082#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14077#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14353#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14350#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14348#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14344#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14342#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14338#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14337#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14332#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14330#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14328#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14327#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14325#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14321#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14315#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14311#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14312#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14309#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14308#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14307#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14306#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14305#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14304#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14303#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14302#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14301#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14299#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14296#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14295#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14294#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14293#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14290#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14287#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14286#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14285#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14284#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14283#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14281#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14278#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14193#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14255#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14254#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14253#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14252#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14251#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14250#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14249#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14248#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14247#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14246#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14245#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14244#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14243#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14242#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14241#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14240#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14239#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14238#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14237#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14236#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14235#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14234#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14199#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14231#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14201#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14190#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14191#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14187#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14183#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14178#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14174#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14170#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14171#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14167#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14159#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14150#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14143#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14141#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14136#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14133#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14132#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14131#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14129#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14127#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14126#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14125#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14124#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14123#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14122#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14121#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14119#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14118#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14117#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14113#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14112#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14111#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14109#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14105#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14103#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14102#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14101#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14100#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14098#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14097#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14096#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14095#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14094#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14085#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 14092#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 14089#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 14088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14083#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 14075#L12-1 [2020-11-29 20:47:59,175 INFO L796 eck$LassoCheckResult]: Loop: 14075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 14076#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 14075#L12-1 [2020-11-29 20:47:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:47:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2068451124, now seen corresponding path program 15 times [2020-11-29 20:47:59,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:47:59,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580601493] [2020-11-29 20:47:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:47:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:47:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 4230 proven. 2360 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2020-11-29 20:47:59,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580601493] [2020-11-29 20:47:59,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882699001] [2020-11-29 20:47:59,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:47:59,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2020-11-29 20:47:59,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:47:59,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 20:47:59,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 4111 proven. 411 refuted. 0 times theorem prover too weak. 3075 trivial. 0 not checked. [2020-11-29 20:48:00,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:00,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2020-11-29 20:48:00,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644245763] [2020-11-29 20:48:00,075 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 27 times [2020-11-29 20:48:00,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:00,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959734655] [2020-11-29 20:48:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:00,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:00,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:00,080 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:00,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-29 20:48:00,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 20:48:00,108 INFO L87 Difference]: Start difference. First operand 282 states and 310 transitions. cyclomatic complexity: 34 Second operand 35 states. [2020-11-29 20:48:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:02,819 INFO L93 Difference]: Finished difference Result 484 states and 513 transitions. [2020-11-29 20:48:02,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2020-11-29 20:48:02,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 513 transitions. [2020-11-29 20:48:02,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:02,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 452 states and 480 transitions. [2020-11-29 20:48:02,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-29 20:48:02,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-11-29 20:48:02,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 452 states and 480 transitions. [2020-11-29 20:48:02,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:02,826 INFO L691 BuchiCegarLoop]: Abstraction has 452 states and 480 transitions. [2020-11-29 20:48:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states and 480 transitions. [2020-11-29 20:48:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 222. [2020-11-29 20:48:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-11-29 20:48:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 229 transitions. [2020-11-29 20:48:02,831 INFO L714 BuchiCegarLoop]: Abstraction has 222 states and 229 transitions. [2020-11-29 20:48:02,832 INFO L594 BuchiCegarLoop]: Abstraction has 222 states and 229 transitions. [2020-11-29 20:48:02,832 INFO L427 BuchiCegarLoop]: ======== Iteration 32============ [2020-11-29 20:48:02,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 229 transitions. [2020-11-29 20:48:02,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:02,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:02,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:02,835 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [72, 72, 61, 11, 1] [2020-11-29 20:48:02,835 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:02,835 INFO L794 eck$LassoCheckResult]: Stem: 15657#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 15658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15660#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15662#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15878#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15875#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15873#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15872#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15871#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15870#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15869#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15868#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15867#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15866#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15864#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15861#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15860#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15859#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15858#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15855#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15854#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15852#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15849#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15848#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15847#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15846#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15843#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15841#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15840#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15835#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15834#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15802#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15832#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15831#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15830#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15829#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15828#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15827#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15826#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15825#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15824#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15823#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15821#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15820#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15819#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15818#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15817#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15815#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15814#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15813#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15812#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15810#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15809#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15808#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15807#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15806#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15804#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15803#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15801#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15799#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15796#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15792#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15791#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15790#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15788#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15787#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15785#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15784#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15783#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15782#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15780#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15779#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15778#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15777#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15708#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15731#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15730#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15728#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15727#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15726#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15725#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15724#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15723#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15722#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15721#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15720#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15719#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15718#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15717#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15716#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15715#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15714#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15713#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15712#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15711#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15710#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15709#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15707#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15706#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15705#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15704#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15703#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15702#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15699#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15698#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15696#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15695#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15694#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15692#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15691#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15690#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15689#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15669#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15688#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15687#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15686#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15685#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15684#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15683#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15682#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15681#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15680#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15679#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15678#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15676#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15675#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15674#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15673#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15672#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15670#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15668#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15666#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15664#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15665#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15775#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15773#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15772#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15771#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15770#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15769#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15768#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15767#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15766#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15765#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15764#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15763#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15762#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15761#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15760#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15759#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15758#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15757#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15756#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15755#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15754#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15753#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15752#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15751#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15750#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15749#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15748#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15747#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15746#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15745#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15744#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15743#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15742#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15740#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15739#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 15738#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15737#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 15734#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 15735#L12-1 [2020-11-29 20:48:02,836 INFO L796 eck$LassoCheckResult]: Loop: 15735#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 15736#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 15735#L12-1 [2020-11-29 20:48:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:02,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1117603618, now seen corresponding path program 18 times [2020-11-29 20:48:02,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:02,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332703943] [2020-11-29 20:48:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3696 proven. 726 refuted. 0 times theorem prover too weak. 3246 trivial. 0 not checked. [2020-11-29 20:48:03,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332703943] [2020-11-29 20:48:03,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549387844] [2020-11-29 20:48:03,085 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:03,158 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2020-11-29 20:48:03,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:03,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 20:48:03,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3696 proven. 726 refuted. 0 times theorem prover too weak. 3246 trivial. 0 not checked. [2020-11-29 20:48:03,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:03,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2020-11-29 20:48:03,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095111086] [2020-11-29 20:48:03,413 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:03,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 28 times [2020-11-29 20:48:03,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:03,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718412933] [2020-11-29 20:48:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:03,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:03,416 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:03,417 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:03,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-29 20:48:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2020-11-29 20:48:03,459 INFO L87 Difference]: Start difference. First operand 222 states and 229 transitions. cyclomatic complexity: 11 Second operand 24 states. [2020-11-29 20:48:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:03,792 INFO L93 Difference]: Finished difference Result 259 states and 267 transitions. [2020-11-29 20:48:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-29 20:48:03,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 267 transitions. [2020-11-29 20:48:03,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:03,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 257 states and 265 transitions. [2020-11-29 20:48:03,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:03,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:03,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 257 states and 265 transitions. [2020-11-29 20:48:03,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:03,795 INFO L691 BuchiCegarLoop]: Abstraction has 257 states and 265 transitions. [2020-11-29 20:48:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states and 265 transitions. [2020-11-29 20:48:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2020-11-29 20:48:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-11-29 20:48:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 263 transitions. [2020-11-29 20:48:03,800 INFO L714 BuchiCegarLoop]: Abstraction has 255 states and 263 transitions. [2020-11-29 20:48:03,800 INFO L594 BuchiCegarLoop]: Abstraction has 255 states and 263 transitions. [2020-11-29 20:48:03,800 INFO L427 BuchiCegarLoop]: ======== Iteration 33============ [2020-11-29 20:48:03,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 263 transitions. [2020-11-29 20:48:03,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:03,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:03,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:03,804 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [83, 83, 71, 12, 1] [2020-11-29 20:48:03,804 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:03,804 INFO L794 eck$LassoCheckResult]: Stem: 16835#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 16836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16841#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16840#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17089#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17088#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17087#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17086#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17085#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17084#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17083#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17078#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17077#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17075#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17073#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17065#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17063#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17060#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17059#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17057#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17056#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17054#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17053#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17051#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17048#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17046#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17042#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17037#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17034#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17033#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17032#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17030#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17029#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17028#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17026#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17025#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17024#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17022#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17020#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17016#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16939#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16966#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16964#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16963#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16960#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16942#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16940#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16936#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16930#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16887#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16913#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16909#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16906#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16904#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16903#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16902#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16900#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16897#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16896#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16891#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16888#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16885#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16884#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16883#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16881#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16876#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16872#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16870#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16848#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16867#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16866#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16864#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16861#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16860#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16859#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16858#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16855#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16854#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16852#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16849#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16845#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16843#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16844#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17013#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17012#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17007#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17004#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17003#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17002#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17001#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17000#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16996#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16995#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16994#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16990#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16989#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16988#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16987#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16986#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16985#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16984#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16983#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16982#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16981#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16980#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16979#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16970#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16971#L12-1 [2020-11-29 20:48:03,804 INFO L796 eck$LassoCheckResult]: Loop: 16971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16972#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 16971#L12-1 [2020-11-29 20:48:03,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash 127539371, now seen corresponding path program 19 times [2020-11-29 20:48:03,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:03,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809387031] [2020-11-29 20:48:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 4698 proven. 810 refuted. 0 times theorem prover too weak. 4701 trivial. 0 not checked. [2020-11-29 20:48:04,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809387031] [2020-11-29 20:48:04,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028772334] [2020-11-29 20:48:04,112 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:04,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 20:48:04,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 3510 proven. 459 refuted. 0 times theorem prover too weak. 6240 trivial. 0 not checked. [2020-11-29 20:48:04,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:04,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2020-11-29 20:48:04,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121414345] [2020-11-29 20:48:04,689 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:04,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 29 times [2020-11-29 20:48:04,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:04,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302467499] [2020-11-29 20:48:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:04,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:04,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:04,693 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:04,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-29 20:48:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=645, Unknown=0, NotChecked=0, Total=992 [2020-11-29 20:48:04,722 INFO L87 Difference]: Start difference. First operand 255 states and 263 transitions. cyclomatic complexity: 13 Second operand 32 states. [2020-11-29 20:48:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:04,920 INFO L93 Difference]: Finished difference Result 269 states and 277 transitions. [2020-11-29 20:48:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-29 20:48:04,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 277 transitions. [2020-11-29 20:48:04,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:04,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 265 states and 273 transitions. [2020-11-29 20:48:04,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:04,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:04,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 273 transitions. [2020-11-29 20:48:04,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:04,925 INFO L691 BuchiCegarLoop]: Abstraction has 265 states and 273 transitions. [2020-11-29 20:48:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 273 transitions. [2020-11-29 20:48:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2020-11-29 20:48:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2020-11-29 20:48:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 269 transitions. [2020-11-29 20:48:04,930 INFO L714 BuchiCegarLoop]: Abstraction has 261 states and 269 transitions. [2020-11-29 20:48:04,930 INFO L594 BuchiCegarLoop]: Abstraction has 261 states and 269 transitions. [2020-11-29 20:48:04,930 INFO L427 BuchiCegarLoop]: ======== Iteration 34============ [2020-11-29 20:48:04,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 269 transitions. [2020-11-29 20:48:04,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:04,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:04,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:04,934 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [85, 85, 73, 12, 1] [2020-11-29 20:48:04,934 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:04,935 INFO L794 eck$LassoCheckResult]: Stem: 18141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 18142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18147#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18149#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18146#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18400#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18399#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18398#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18397#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18396#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18395#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18394#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18393#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18392#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18391#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18390#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18389#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18388#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18385#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18379#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18377#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18376#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18373#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18361#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18358#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18356#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18352#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18347#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18346#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18343#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18341#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18340#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18339#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18338#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18337#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18336#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18335#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18334#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18332#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18331#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18330#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18329#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18328#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18327#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18326#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18325#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18324#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18323#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18322#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18276#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18275#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18274#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18273#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18272#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18271#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18270#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18269#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18268#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18267#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18266#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18265#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18264#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18263#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18262#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18261#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18260#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18259#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18258#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18257#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18256#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18255#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18254#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18253#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18252#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18251#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18250#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18249#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18248#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18219#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18247#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18245#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18244#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18243#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18242#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18241#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18240#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18239#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18238#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18237#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18236#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18235#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18234#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18233#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18232#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18231#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18230#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18229#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18228#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18227#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18226#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18225#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18224#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18223#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18222#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18221#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18194#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18220#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18218#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18217#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18216#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18215#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18214#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18213#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18212#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18211#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18210#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18209#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18208#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18207#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18206#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18205#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18204#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18203#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18202#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18201#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18200#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18199#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18198#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18197#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18196#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18195#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18191#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18176#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18175#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18155#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18172#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18171#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18170#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18164#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18162#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18159#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18158#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18157#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18152#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18150#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18315#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18312#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18311#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18309#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18308#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18307#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18306#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18305#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18304#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18303#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18302#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18301#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18299#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18296#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18295#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18294#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18293#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18290#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18287#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18286#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18284#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 18281#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18280#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 18277#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 18278#L12-1 [2020-11-29 20:48:04,935 INFO L796 eck$LassoCheckResult]: Loop: 18278#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 18279#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 18278#L12-1 [2020-11-29 20:48:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1795556039, now seen corresponding path program 20 times [2020-11-29 20:48:04,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:04,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111445009] [2020-11-29 20:48:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 5412 proven. 1803 refuted. 0 times theorem prover too weak. 3495 trivial. 0 not checked. [2020-11-29 20:48:05,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111445009] [2020-11-29 20:48:05,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746835173] [2020-11-29 20:48:05,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:05,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:48:05,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:05,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 20:48:05,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 3762 proven. 513 refuted. 0 times theorem prover too weak. 6435 trivial. 0 not checked. [2020-11-29 20:48:05,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:05,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 32 [2020-11-29 20:48:05,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840063089] [2020-11-29 20:48:05,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 30 times [2020-11-29 20:48:05,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:05,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341460496] [2020-11-29 20:48:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:05,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:05,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:05,812 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:05,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:05,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-11-29 20:48:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=681, Unknown=0, NotChecked=0, Total=1056 [2020-11-29 20:48:05,871 INFO L87 Difference]: Start difference. First operand 261 states and 269 transitions. cyclomatic complexity: 13 Second operand 33 states. [2020-11-29 20:48:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:06,290 INFO L93 Difference]: Finished difference Result 305 states and 314 transitions. [2020-11-29 20:48:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-29 20:48:06,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 305 states and 314 transitions. [2020-11-29 20:48:06,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:06,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 305 states to 301 states and 310 transitions. [2020-11-29 20:48:06,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:06,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:06,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 310 transitions. [2020-11-29 20:48:06,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:06,294 INFO L691 BuchiCegarLoop]: Abstraction has 301 states and 310 transitions. [2020-11-29 20:48:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 310 transitions. [2020-11-29 20:48:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2020-11-29 20:48:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-11-29 20:48:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 306 transitions. [2020-11-29 20:48:06,299 INFO L714 BuchiCegarLoop]: Abstraction has 297 states and 306 transitions. [2020-11-29 20:48:06,299 INFO L594 BuchiCegarLoop]: Abstraction has 297 states and 306 transitions. [2020-11-29 20:48:06,299 INFO L427 BuchiCegarLoop]: ======== Iteration 35============ [2020-11-29 20:48:06,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 297 states and 306 transitions. [2020-11-29 20:48:06,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:06,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:06,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:06,303 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [97, 97, 84, 13, 1] [2020-11-29 20:48:06,303 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:06,303 INFO L794 eck$LassoCheckResult]: Stem: 19528#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 19529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19530#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19534#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19824#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19535#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19536#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19533#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19823#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19821#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19820#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19819#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19818#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19817#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19815#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19814#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19813#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19812#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19810#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19809#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19808#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19807#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19806#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19804#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19803#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19802#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19801#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19796#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19792#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19791#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19790#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19788#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19787#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19785#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19784#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19783#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19782#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19780#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19779#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19778#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19777#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19773#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19772#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19771#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19770#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19769#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19768#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19767#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19766#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19765#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19764#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19763#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19762#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19761#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19760#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19759#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19758#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19757#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19756#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19755#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19754#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19753#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19752#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19751#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19750#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19749#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19748#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19747#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19746#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19745#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19744#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19743#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19742#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19740#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19738#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19737#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19736#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19735#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19734#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19733#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19731#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19730#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19728#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19727#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19726#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19725#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19724#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19723#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19722#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19721#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19720#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19719#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19718#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19717#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19716#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19715#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19714#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19713#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19712#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19711#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19710#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19709#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19708#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19633#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19662#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19661#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19660#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19659#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19656#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19655#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19654#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19653#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19652#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19651#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19650#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19649#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19648#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19647#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19646#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19645#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19644#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19643#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19642#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19641#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19639#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19638#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19637#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19636#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19635#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19634#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19632#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19631#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19630#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19629#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19628#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19627#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19626#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19624#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19623#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19622#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19621#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19620#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19617#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19616#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19614#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19613#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19612#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19610#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19609#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19608#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19581#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19607#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19603#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19579#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19578#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19577#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19575#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19572#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19571#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19568#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19566#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19542#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19561#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19558#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19546#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19545#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19544#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19543#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19537#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19707#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19706#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19705#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19704#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19703#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19702#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19701#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19700#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19699#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19698#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19697#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19696#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19695#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19694#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19693#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19692#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19690#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19689#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19688#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19687#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19686#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19685#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19684#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19683#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19682#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19681#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19680#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19679#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19678#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19677#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19676#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19675#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19674#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 19668#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 19664#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 19665#L12-1 [2020-11-29 20:48:06,303 INFO L796 eck$LassoCheckResult]: Loop: 19665#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 19666#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 19665#L12-1 [2020-11-29 20:48:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash 342566413, now seen corresponding path program 21 times [2020-11-29 20:48:06,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:06,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016822164] [2020-11-29 20:48:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13968 backedges. 6240 proven. 975 refuted. 0 times theorem prover too weak. 6753 trivial. 0 not checked. [2020-11-29 20:48:06,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016822164] [2020-11-29 20:48:06,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997266003] [2020-11-29 20:48:06,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:06,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2020-11-29 20:48:06,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:06,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-29 20:48:06,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13968 backedges. 4620 proven. 570 refuted. 0 times theorem prover too weak. 8778 trivial. 0 not checked. [2020-11-29 20:48:07,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:07,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2020-11-29 20:48:07,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651250186] [2020-11-29 20:48:07,229 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:07,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 31 times [2020-11-29 20:48:07,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:07,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020566264] [2020-11-29 20:48:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:07,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:07,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:07,234 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:07,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:07,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-29 20:48:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=776, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 20:48:07,264 INFO L87 Difference]: Start difference. First operand 297 states and 306 transitions. cyclomatic complexity: 15 Second operand 35 states. [2020-11-29 20:48:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:07,409 INFO L93 Difference]: Finished difference Result 311 states and 320 transitions. [2020-11-29 20:48:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-29 20:48:07,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 320 transitions. [2020-11-29 20:48:07,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:07,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 307 states and 316 transitions. [2020-11-29 20:48:07,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:07,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:07,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 316 transitions. [2020-11-29 20:48:07,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:07,414 INFO L691 BuchiCegarLoop]: Abstraction has 307 states and 316 transitions. [2020-11-29 20:48:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 316 transitions. [2020-11-29 20:48:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2020-11-29 20:48:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-11-29 20:48:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 312 transitions. [2020-11-29 20:48:07,420 INFO L714 BuchiCegarLoop]: Abstraction has 303 states and 312 transitions. [2020-11-29 20:48:07,420 INFO L594 BuchiCegarLoop]: Abstraction has 303 states and 312 transitions. [2020-11-29 20:48:07,420 INFO L427 BuchiCegarLoop]: ======== Iteration 36============ [2020-11-29 20:48:07,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 312 transitions. [2020-11-29 20:48:07,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:07,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:07,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:07,424 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [99, 99, 86, 13, 1] [2020-11-29 20:48:07,424 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:07,425 INFO L794 eck$LassoCheckResult]: Stem: 21047#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 21048#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21053#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21054#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21051#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21348#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21347#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21346#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21345#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21344#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21343#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21342#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21341#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21340#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21339#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21338#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21336#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21335#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21334#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21333#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21332#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21331#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21330#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21329#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21328#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21327#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21326#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21324#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21323#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21322#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21321#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21320#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21318#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21317#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21315#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21314#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21312#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21311#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21310#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21309#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21308#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21305#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21304#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21303#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21300#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21299#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21298#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21296#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21295#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21294#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21293#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21292#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21291#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21290#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21288#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21285#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21281#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21280#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21279#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21278#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21277#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21276#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21275#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21274#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21273#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21272#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21271#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21270#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21269#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21268#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21267#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21266#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21265#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21264#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21263#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21262#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21261#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21260#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21216#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21212#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21211#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21210#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21207#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21206#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21200#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21195#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21183#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21182#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21181#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21180#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21179#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21178#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21177#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21172#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21170#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21164#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21162#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21159#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21158#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21157#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21155#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21154#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21150#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21143#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21141#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21136#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21135#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21133#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21132#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21131#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21129#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21127#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21125#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21124#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21123#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21122#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21121#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21119#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21118#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21117#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21113#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21112#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21111#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21108#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21105#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21103#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21102#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21098#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21089#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21084#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21062#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21078#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21077#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21075#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21073#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21065#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21063#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21057#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21259#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21258#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21257#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21256#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21255#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21253#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21252#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21251#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21250#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21249#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21247#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21246#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21245#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21244#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21242#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21241#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21240#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21238#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21235#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21234#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21233#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21232#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21229#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21226#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21225#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21223#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21222#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21221#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21220#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21049#L12-1 [2020-11-29 20:48:07,425 INFO L796 eck$LassoCheckResult]: Loop: 21049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21050#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 21049#L12-1 [2020-11-29 20:48:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -299906519, now seen corresponding path program 22 times [2020-11-29 20:48:07,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:07,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730422853] [2020-11-29 20:48:07,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 7290 proven. 2166 refuted. 0 times theorem prover too weak. 5097 trivial. 0 not checked. [2020-11-29 20:48:07,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730422853] [2020-11-29 20:48:07,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013998829] [2020-11-29 20:48:07,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:07,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:48:07,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:07,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-29 20:48:07,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 7242 proven. 1071 refuted. 0 times theorem prover too weak. 6240 trivial. 0 not checked. [2020-11-29 20:48:08,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:08,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 36] total 49 [2020-11-29 20:48:08,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593423832] [2020-11-29 20:48:08,970 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 32 times [2020-11-29 20:48:08,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:08,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388911504] [2020-11-29 20:48:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:08,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:08,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:08,975 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:08,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-11-29 20:48:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=1840, Unknown=0, NotChecked=0, Total=2352 [2020-11-29 20:48:08,996 INFO L87 Difference]: Start difference. First operand 303 states and 312 transitions. cyclomatic complexity: 15 Second operand 49 states. [2020-11-29 20:48:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:12,891 INFO L93 Difference]: Finished difference Result 764 states and 812 transitions. [2020-11-29 20:48:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2020-11-29 20:48:12,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 764 states and 812 transitions. [2020-11-29 20:48:12,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:12,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 764 states to 748 states and 796 transitions. [2020-11-29 20:48:12,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2020-11-29 20:48:12,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2020-11-29 20:48:12,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 748 states and 796 transitions. [2020-11-29 20:48:12,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:12,917 INFO L691 BuchiCegarLoop]: Abstraction has 748 states and 796 transitions. [2020-11-29 20:48:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states and 796 transitions. [2020-11-29 20:48:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 375. [2020-11-29 20:48:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-11-29 20:48:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 396 transitions. [2020-11-29 20:48:12,925 INFO L714 BuchiCegarLoop]: Abstraction has 375 states and 396 transitions. [2020-11-29 20:48:12,925 INFO L594 BuchiCegarLoop]: Abstraction has 375 states and 396 transitions. [2020-11-29 20:48:12,925 INFO L427 BuchiCegarLoop]: ======== Iteration 37============ [2020-11-29 20:48:12,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 396 transitions. [2020-11-29 20:48:12,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:12,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:12,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:12,929 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [101, 101, 88, 13, 1] [2020-11-29 20:48:12,929 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:12,930 INFO L794 eck$LassoCheckResult]: Stem: 23428#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 23429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23433#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23800#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23798#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23797#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23796#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23795#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23794#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23793#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23792#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23791#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23790#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23788#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23787#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23786#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23785#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23784#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23783#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23782#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23781#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23780#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23779#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23778#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23775#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23774#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23772#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23770#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23769#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23768#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23767#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23764#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23763#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23762#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23761#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23760#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23759#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23758#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23757#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23756#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23755#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23754#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23752#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23751#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23750#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23748#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23690#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23746#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23744#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23743#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23742#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23741#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23740#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23738#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23736#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23735#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23734#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23732#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23731#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23730#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23729#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23728#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23726#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23723#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23722#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23720#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23719#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23707#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23706#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23704#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23703#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23702#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23699#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23698#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23696#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23695#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23693#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23691#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23692#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23688#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23687#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23686#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23685#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23684#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23683#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23682#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23681#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23680#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23679#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23678#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23677#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23676#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23675#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23674#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23673#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23672#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23671#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23668#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23666#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23665#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23664#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23662#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23661#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23660#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23630#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23626#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23627#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23607#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23622#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23600#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23579#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23504#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23532#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23530#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23529#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23528#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23527#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23526#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23525#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23524#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23523#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23522#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23521#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23520#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23519#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23518#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23517#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23516#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23515#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23514#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23513#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23512#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23511#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23510#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23509#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23508#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23507#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23506#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23479#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23505#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23503#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23502#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23501#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23489#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23483#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23480#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23478#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23477#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23476#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23475#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23474#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23473#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23472#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23471#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23470#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23469#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23468#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23467#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23466#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23465#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23464#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23463#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23462#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23461#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23460#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23459#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23458#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23457#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23456#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23455#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23454#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23453#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23452#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23451#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23450#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23449#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23448#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23447#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23446#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23445#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23444#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23442#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23441#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23439#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23437#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23435#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23436#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23438#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23572#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23571#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23570#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23569#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23567#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23566#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23565#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23564#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23563#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23562#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23561#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23560#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23559#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23558#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23557#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23556#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23555#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23554#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23553#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23552#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23551#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23550#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23549#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23548#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23547#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23546#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23545#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23544#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23543#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23542#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23541#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23540#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23538#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 23537#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23536#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 23533#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 23534#L12-1 [2020-11-29 20:48:12,930 INFO L796 eck$LassoCheckResult]: Loop: 23534#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 23535#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 23534#L12-1 [2020-11-29 20:48:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash -770433595, now seen corresponding path program 23 times [2020-11-29 20:48:12,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:12,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793500526] [2020-11-29 20:48:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7524 proven. 3747 refuted. 0 times theorem prover too weak. 3879 trivial. 0 not checked. [2020-11-29 20:48:13,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793500526] [2020-11-29 20:48:13,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125476910] [2020-11-29 20:48:13,281 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:13,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2020-11-29 20:48:13,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:13,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-29 20:48:13,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 10010 proven. 517 refuted. 0 times theorem prover too weak. 4623 trivial. 0 not checked. [2020-11-29 20:48:13,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:13,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2020-11-29 20:48:13,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939898391] [2020-11-29 20:48:13,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 33 times [2020-11-29 20:48:13,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:13,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090618808] [2020-11-29 20:48:13,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:13,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:13,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:13,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:13,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-11-29 20:48:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1231, Unknown=0, NotChecked=0, Total=1482 [2020-11-29 20:48:13,952 INFO L87 Difference]: Start difference. First operand 375 states and 396 transitions. cyclomatic complexity: 25 Second operand 39 states. [2020-11-29 20:48:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:16,593 INFO L93 Difference]: Finished difference Result 779 states and 834 transitions. [2020-11-29 20:48:16,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2020-11-29 20:48:16,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 779 states and 834 transitions. [2020-11-29 20:48:16,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:16,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 779 states to 775 states and 830 transitions. [2020-11-29 20:48:16,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2020-11-29 20:48:16,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-11-29 20:48:16,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 775 states and 830 transitions. [2020-11-29 20:48:16,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:16,604 INFO L691 BuchiCegarLoop]: Abstraction has 775 states and 830 transitions. [2020-11-29 20:48:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states and 830 transitions. [2020-11-29 20:48:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 522. [2020-11-29 20:48:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-11-29 20:48:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 558 transitions. [2020-11-29 20:48:16,616 INFO L714 BuchiCegarLoop]: Abstraction has 522 states and 558 transitions. [2020-11-29 20:48:16,616 INFO L594 BuchiCegarLoop]: Abstraction has 522 states and 558 transitions. [2020-11-29 20:48:16,616 INFO L427 BuchiCegarLoop]: ======== Iteration 38============ [2020-11-29 20:48:16,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 558 transitions. [2020-11-29 20:48:16,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:16,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:16,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:16,623 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [123, 123, 108, 15, 1] [2020-11-29 20:48:16,624 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:16,625 INFO L794 eck$LassoCheckResult]: Stem: 25691#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 25692#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25694#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25698#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26157#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26155#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26152#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26149#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26147#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26143#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26102#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26098#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26089#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26084#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26080#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26075#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26074#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26065#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26063#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26057#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26053#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26051#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26048#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26045#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26041#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26027#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26026#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26017#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26003#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25997#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25994#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25995#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25990#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25981#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25979#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25973#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25971#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25967#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25963#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25961#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25955#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25949#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25947#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25943#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25941#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25937#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25935#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25931#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25929#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25900#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25899#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25898#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25894#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25893#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25892#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25890#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25888#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25887#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25885#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25883#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25881#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25876#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25872#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25828#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25824#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25823#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25822#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25821#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25818#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25815#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25814#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25812#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25811#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25810#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25809#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25808#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25806#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25805#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25804#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25803#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25800#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25770#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25796#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25795#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25794#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25793#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25792#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25791#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25790#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25788#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25787#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25786#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25785#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25784#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25783#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25782#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25781#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25780#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25779#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25778#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25775#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25774#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25772#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25771#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25769#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25768#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25767#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25764#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25763#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25762#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25761#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25760#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25759#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25758#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25757#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25756#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25755#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25754#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25752#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25751#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25750#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25748#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25747#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25746#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25744#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25743#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25742#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25740#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25739#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25738#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25737#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25736#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25735#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25734#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25733#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25731#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25730#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25728#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25727#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25726#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25706#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25725#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25724#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25723#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25722#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25721#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25720#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25718#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25717#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25716#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25715#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25714#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25713#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25712#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25711#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25710#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25709#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25708#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25707#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25705#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25703#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25700#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25704#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25870#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25869#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25868#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25867#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25866#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25864#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25861#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25860#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25859#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25858#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25855#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25854#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25852#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25849#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25848#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25847#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25846#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25843#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25841#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25840#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25837#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25835#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25834#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 25833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25832#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 25829#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 25830#L12-1 [2020-11-29 20:48:16,625 INFO L796 eck$LassoCheckResult]: Loop: 25830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 25831#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 25830#L12-1 [2020-11-29 20:48:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1624880549, now seen corresponding path program 24 times [2020-11-29 20:48:16,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:16,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573706633] [2020-11-29 20:48:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 22509 backedges. 10716 proven. 2400 refuted. 0 times theorem prover too weak. 9393 trivial. 0 not checked. [2020-11-29 20:48:17,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573706633] [2020-11-29 20:48:17,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872237762] [2020-11-29 20:48:17,122 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:17,286 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2020-11-29 20:48:17,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:17,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-29 20:48:17,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 22509 backedges. 15156 proven. 948 refuted. 0 times theorem prover too weak. 6405 trivial. 0 not checked. [2020-11-29 20:48:17,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:17,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 41 [2020-11-29 20:48:17,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621872670] [2020-11-29 20:48:17,948 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 34 times [2020-11-29 20:48:17,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:17,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51743468] [2020-11-29 20:48:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:17,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:17,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:17,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:17,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-29 20:48:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1357, Unknown=0, NotChecked=0, Total=1640 [2020-11-29 20:48:17,999 INFO L87 Difference]: Start difference. First operand 522 states and 558 transitions. cyclomatic complexity: 41 Second operand 41 states. [2020-11-29 20:48:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:20,388 INFO L93 Difference]: Finished difference Result 725 states and 768 transitions. [2020-11-29 20:48:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2020-11-29 20:48:20,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 725 states and 768 transitions. [2020-11-29 20:48:20,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:20,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 725 states to 598 states and 632 transitions. [2020-11-29 20:48:20,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:20,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:20,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 598 states and 632 transitions. [2020-11-29 20:48:20,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:20,394 INFO L691 BuchiCegarLoop]: Abstraction has 598 states and 632 transitions. [2020-11-29 20:48:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states and 632 transitions. [2020-11-29 20:48:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 507. [2020-11-29 20:48:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-11-29 20:48:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 535 transitions. [2020-11-29 20:48:20,404 INFO L714 BuchiCegarLoop]: Abstraction has 507 states and 535 transitions. [2020-11-29 20:48:20,404 INFO L594 BuchiCegarLoop]: Abstraction has 507 states and 535 transitions. [2020-11-29 20:48:20,404 INFO L427 BuchiCegarLoop]: ======== Iteration 39============ [2020-11-29 20:48:20,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 507 states and 535 transitions. [2020-11-29 20:48:20,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:20,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:20,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:20,409 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [125, 125, 110, 15, 1] [2020-11-29 20:48:20,410 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:20,410 INFO L794 eck$LassoCheckResult]: Stem: 28224#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 28225#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28231#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28730#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28232#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28229#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28729#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28728#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28726#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28723#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28722#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28720#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28719#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28717#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28716#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28714#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28713#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28712#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28711#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28710#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28708#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28707#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28706#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28705#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28704#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28703#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28702#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28699#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28698#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28696#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28695#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28694#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28692#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28691#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28690#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28689#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28688#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28687#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28686#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28685#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28684#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28683#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28682#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28681#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28680#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28678#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28679#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28677#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28676#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28675#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28674#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28673#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28672#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28671#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28668#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28666#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28665#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28664#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28662#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28661#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28660#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28659#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28656#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28655#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28654#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28653#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28652#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28651#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28650#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28649#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28648#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28647#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28646#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28645#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28644#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28643#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28642#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28641#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28639#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28638#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28637#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28635#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28579#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28574#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28573#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28570#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28569#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28568#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28567#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28564#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28563#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28562#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28561#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28558#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28531#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28545#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28524#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28525#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28521#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28520#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28519#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28518#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28517#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28516#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28515#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28514#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28513#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28512#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28511#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28510#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28509#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28508#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28507#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28506#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28505#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28504#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28503#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28502#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28501#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28500#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28499#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28498#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28497#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28496#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28495#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28494#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28493#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28492#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28491#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28490#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28453#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28451#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28449#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28450#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28445#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28444#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28442#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28441#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28439#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28438#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28437#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28435#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28433#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28431#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28426#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28427#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28422#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28423#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28418#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28419#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28415#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28468#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28466#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28408#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28407#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28405#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28406#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28400#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28356#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28355#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28354#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28353#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28350#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28348#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28344#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28342#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28338#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28337#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28332#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28303#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28330#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28329#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28328#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28327#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28326#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28324#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28323#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28322#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28321#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28320#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28318#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28317#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28315#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28314#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28312#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28311#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28310#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28309#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28308#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28305#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28278#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28304#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28300#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28299#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28298#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28297#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28296#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28295#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28294#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28293#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28292#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28291#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28290#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28288#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28285#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28281#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28280#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28279#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28275#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28258#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28257#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28256#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28255#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28254#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28253#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28252#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28251#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28250#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28249#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28248#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28247#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28246#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28245#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28244#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28243#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28242#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28241#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28240#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28234#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28237#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28398#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28395#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28394#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28393#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28392#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28390#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28389#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28387#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28383#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28382#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28381#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28380#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28377#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28375#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28371#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28368#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28367#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28366#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28365#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28364#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28363#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 28362#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 28360#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 28226#L12-1 [2020-11-29 20:48:20,411 INFO L796 eck$LassoCheckResult]: Loop: 28226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 28227#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 28226#L12-1 [2020-11-29 20:48:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:20,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1730656823, now seen corresponding path program 25 times [2020-11-29 20:48:20,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:20,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026329943] [2020-11-29 20:48:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 23250 backedges. 9450 proven. 1215 refuted. 0 times theorem prover too weak. 12585 trivial. 0 not checked. [2020-11-29 20:48:20,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026329943] [2020-11-29 20:48:20,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121910774] [2020-11-29 20:48:20,817 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:20,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-29 20:48:20,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 23250 backedges. 9450 proven. 1215 refuted. 0 times theorem prover too weak. 12585 trivial. 0 not checked. [2020-11-29 20:48:21,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:21,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2020-11-29 20:48:21,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120526239] [2020-11-29 20:48:21,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 35 times [2020-11-29 20:48:21,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:21,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25731524] [2020-11-29 20:48:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:21,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:21,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:21,481 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:21,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:21,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-29 20:48:21,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=643, Unknown=0, NotChecked=0, Total=992 [2020-11-29 20:48:21,501 INFO L87 Difference]: Start difference. First operand 507 states and 535 transitions. cyclomatic complexity: 34 Second operand 32 states. [2020-11-29 20:48:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:21,985 INFO L93 Difference]: Finished difference Result 509 states and 536 transitions. [2020-11-29 20:48:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-29 20:48:21,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 536 transitions. [2020-11-29 20:48:21,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:21,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 507 states and 534 transitions. [2020-11-29 20:48:21,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:21,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:21,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 507 states and 534 transitions. [2020-11-29 20:48:21,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:21,989 INFO L691 BuchiCegarLoop]: Abstraction has 507 states and 534 transitions. [2020-11-29 20:48:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states and 534 transitions. [2020-11-29 20:48:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2020-11-29 20:48:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-11-29 20:48:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 534 transitions. [2020-11-29 20:48:21,997 INFO L714 BuchiCegarLoop]: Abstraction has 507 states and 534 transitions. [2020-11-29 20:48:21,997 INFO L594 BuchiCegarLoop]: Abstraction has 507 states and 534 transitions. [2020-11-29 20:48:21,997 INFO L427 BuchiCegarLoop]: ======== Iteration 40============ [2020-11-29 20:48:21,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 507 states and 534 transitions. [2020-11-29 20:48:21,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:21,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:21,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:22,002 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [126, 126, 111, 15, 1] [2020-11-29 20:48:22,002 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:22,003 INFO L794 eck$LassoCheckResult]: Stem: 30430#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 30431#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30437#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30435#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30438#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30936#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30935#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30934#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30932#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30931#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30929#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30928#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30927#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30926#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30925#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30924#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30923#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30922#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30921#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30920#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30919#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30918#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30917#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30916#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30915#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30914#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30913#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30912#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30911#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30910#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30909#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30908#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30907#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30906#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30905#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30904#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30903#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30902#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30901#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30899#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30898#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30897#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30896#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30895#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30893#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30892#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30891#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30890#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30889#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30888#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30887#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30886#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30883#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30880#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30879#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30878#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30874#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30872#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30871#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30870#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30869#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30868#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30867#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30866#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30865#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30864#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30863#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30862#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30861#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30860#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30859#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30858#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30857#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30856#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30855#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30854#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30853#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30852#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30851#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30850#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30849#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30848#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30847#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30846#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30845#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30844#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30843#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30842#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30841#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30840#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30839#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30821#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30817#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30815#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30809#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30803#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30795#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30791#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30787#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30785#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30783#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30779#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30775#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30769#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30767#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30763#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30759#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30757#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30751#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30750#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30749#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30748#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30708#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30706#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30705#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30703#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30699#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30697#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30695#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30694#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30688#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30687#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30686#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30685#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30683#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30681#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30679#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30677#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30675#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30673#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30671#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30669#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30665#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30663#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30661#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30659#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30657#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30655#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30653#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30649#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30646#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30647#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30651#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30728#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30727#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30726#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30725#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30724#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30723#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30722#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30721#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30720#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30718#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30717#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30716#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30715#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30714#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30713#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30623#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30624#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30707#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30617#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30616#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30613#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30614#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30692#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30690#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30689#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30607#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30563#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30562#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30561#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30558#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30546#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30545#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30544#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30543#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30542#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30541#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30540#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30539#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30538#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30537#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30536#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30508#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30535#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30534#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30533#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30532#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30531#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30530#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30529#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30528#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30527#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30526#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30525#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30524#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30523#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30522#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30521#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30520#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30519#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30518#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30517#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30516#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30515#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30514#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30513#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30512#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30511#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30510#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30483#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30509#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30507#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30506#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30505#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30504#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30503#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30502#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30501#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30500#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30499#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30498#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30497#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30496#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30495#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30494#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30493#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30492#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30491#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30490#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30489#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30488#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30487#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30486#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30485#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30484#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30480#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30479#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30478#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30477#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30476#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30474#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30473#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30472#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30471#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30470#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30468#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30467#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30466#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30444#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30463#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30462#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30461#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30460#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30459#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30458#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30457#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30456#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30455#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30454#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30453#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30452#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30451#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30450#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30449#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30447#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30446#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30441#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30439#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30442#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30606#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30603#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30594#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30582#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30579#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30574#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30573#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30570#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 30569#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30568#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 30567#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 30432#L12-1 [2020-11-29 20:48:22,003 INFO L796 eck$LassoCheckResult]: Loop: 30432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 30433#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 30432#L12-1 [2020-11-29 20:48:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 632988290, now seen corresponding path program 26 times [2020-11-29 20:48:22,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:22,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742550569] [2020-11-29 20:48:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 23625 backedges. 11319 proven. 2643 refuted. 0 times theorem prover too weak. 9663 trivial. 0 not checked. [2020-11-29 20:48:22,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742550569] [2020-11-29 20:48:22,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590088120] [2020-11-29 20:48:22,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:22,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:48:22,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:22,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 20:48:22,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 23625 backedges. 9720 proven. 1320 refuted. 0 times theorem prover too weak. 12585 trivial. 0 not checked. [2020-11-29 20:48:23,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:23,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2020-11-29 20:48:23,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826128000] [2020-11-29 20:48:23,023 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 36 times [2020-11-29 20:48:23,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:23,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519581466] [2020-11-29 20:48:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:23,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:23,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:23,026 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:23,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-11-29 20:48:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=688, Unknown=0, NotChecked=0, Total=1056 [2020-11-29 20:48:23,043 INFO L87 Difference]: Start difference. First operand 507 states and 534 transitions. cyclomatic complexity: 33 Second operand 33 states. [2020-11-29 20:48:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:23,571 INFO L93 Difference]: Finished difference Result 555 states and 581 transitions. [2020-11-29 20:48:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-29 20:48:23,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 555 states and 581 transitions. [2020-11-29 20:48:23,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:23,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 555 states to 551 states and 577 transitions. [2020-11-29 20:48:23,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:23,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:23,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 551 states and 577 transitions. [2020-11-29 20:48:23,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:23,577 INFO L691 BuchiCegarLoop]: Abstraction has 551 states and 577 transitions. [2020-11-29 20:48:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states and 577 transitions. [2020-11-29 20:48:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 456. [2020-11-29 20:48:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-11-29 20:48:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 477 transitions. [2020-11-29 20:48:23,586 INFO L714 BuchiCegarLoop]: Abstraction has 456 states and 477 transitions. [2020-11-29 20:48:23,586 INFO L594 BuchiCegarLoop]: Abstraction has 456 states and 477 transitions. [2020-11-29 20:48:23,586 INFO L427 BuchiCegarLoop]: ======== Iteration 41============ [2020-11-29 20:48:23,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 456 states and 477 transitions. [2020-11-29 20:48:23,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:23,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:23,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:23,593 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [128, 128, 113, 15, 1] [2020-11-29 20:48:23,593 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:23,594 INFO L794 eck$LassoCheckResult]: Stem: 32692#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 32693#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32698#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32699#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 33147#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32701#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32696#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33143#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33098#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33096#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33092#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 33091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33089#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33084#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33080#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33075#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33074#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33072#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33071#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33070#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33069#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33068#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33063#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33059#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33048#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33046#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33045#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 33044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33042#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33037#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33034#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33033#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33032#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33030#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33029#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33028#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33026#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33025#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33024#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33022#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33020#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33016#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33013#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33012#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 33011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 33010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 33009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32996#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32995#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32989#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32988#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32987#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32982#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32981#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32980#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32979#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32978#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32976#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32974#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32973#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32972#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32971#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32970#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32969#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32968#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32967#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32963#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32962#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32961#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32958#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32915#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32913#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32908#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32907#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32906#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32901#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32900#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32899#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32898#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32891#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32890#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32883#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32876#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32870#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32824#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32823#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32822#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32821#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32818#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32815#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32814#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32812#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32811#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32810#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32809#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32808#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32806#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32805#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32804#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32803#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32800#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32796#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32795#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32794#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32793#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32792#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32791#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32789#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32788#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32787#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32786#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32785#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32784#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32783#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32782#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32781#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32780#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32779#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32778#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32777#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32776#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32774#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32746#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32772#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32770#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32769#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32768#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32767#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32766#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32765#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32764#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32763#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32762#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32760#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32759#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32758#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32756#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32754#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32753#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32752#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32750#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32749#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32748#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32745#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32744#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32743#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32742#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32741#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32740#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32739#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32738#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32737#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32736#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32735#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32734#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32733#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32732#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32731#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32730#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32729#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32728#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32727#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32707#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32726#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32723#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32722#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32720#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32719#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32717#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32716#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32714#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32713#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32712#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32711#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32710#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32708#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32706#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32704#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32702#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32703#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32705#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32865#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32864#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32863#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32862#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32860#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32859#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32858#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32857#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32856#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32853#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32852#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32851#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32850#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32849#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32845#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32844#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32841#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32840#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32839#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32838#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32837#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32836#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32835#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32834#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32833#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 32832#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 32830#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 32694#L12-1 [2020-11-29 20:48:23,594 INFO L796 eck$LassoCheckResult]: Loop: 32694#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 32695#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 32694#L12-1 [2020-11-29 20:48:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1020239206, now seen corresponding path program 27 times [2020-11-29 20:48:23,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:23,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491678897] [2020-11-29 20:48:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 24384 backedges. 12285 proven. 4656 refuted. 0 times theorem prover too weak. 7443 trivial. 0 not checked. [2020-11-29 20:48:24,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491678897] [2020-11-29 20:48:24,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796341227] [2020-11-29 20:48:24,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:24,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2020-11-29 20:48:24,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:24,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 20:48:24,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24384 backedges. 10101 proven. 1428 refuted. 0 times theorem prover too weak. 12855 trivial. 0 not checked. [2020-11-29 20:48:24,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:24,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2020-11-29 20:48:24,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418093963] [2020-11-29 20:48:24,878 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:24,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 37 times [2020-11-29 20:48:24,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:24,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833302673] [2020-11-29 20:48:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:24,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:24,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:24,881 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:24,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-29 20:48:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=731, Unknown=0, NotChecked=0, Total=1122 [2020-11-29 20:48:24,936 INFO L87 Difference]: Start difference. First operand 456 states and 477 transitions. cyclomatic complexity: 27 Second operand 34 states. [2020-11-29 20:48:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:25,656 INFO L93 Difference]: Finished difference Result 604 states and 633 transitions. [2020-11-29 20:48:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-11-29 20:48:25,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 633 transitions. [2020-11-29 20:48:25,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:25,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 600 states and 629 transitions. [2020-11-29 20:48:25,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:25,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:25,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 629 transitions. [2020-11-29 20:48:25,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:25,662 INFO L691 BuchiCegarLoop]: Abstraction has 600 states and 629 transitions. [2020-11-29 20:48:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 629 transitions. [2020-11-29 20:48:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 555. [2020-11-29 20:48:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-11-29 20:48:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 583 transitions. [2020-11-29 20:48:25,671 INFO L714 BuchiCegarLoop]: Abstraction has 555 states and 583 transitions. [2020-11-29 20:48:25,671 INFO L594 BuchiCegarLoop]: Abstraction has 555 states and 583 transitions. [2020-11-29 20:48:25,671 INFO L427 BuchiCegarLoop]: ======== Iteration 42============ [2020-11-29 20:48:25,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 555 states and 583 transitions. [2020-11-29 20:48:25,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:25,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:25,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:25,677 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [130, 130, 115, 15, 1] [2020-11-29 20:48:25,677 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:25,678 INFO L794 eck$LassoCheckResult]: Stem: 34997#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 34998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35004#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35005#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35489#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35483#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35480#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35479#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35478#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35477#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35476#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35474#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35473#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35472#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35471#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35470#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35468#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35467#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35466#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35462#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35461#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35460#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35459#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35458#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35457#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35456#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35455#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35454#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35453#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35452#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35451#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35450#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35449#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35448#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35447#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35446#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35444#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35442#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35441#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35439#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35438#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35437#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35435#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35433#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35432#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35431#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35430#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35429#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35428#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35427#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35426#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35425#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35423#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35422#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35421#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35420#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35419#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35418#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35417#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35416#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35415#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35412#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35411#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35410#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35409#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35408#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35407#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35406#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35405#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35404#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35403#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35400#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35398#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35395#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35393#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35394#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35392#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35390#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35389#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35387#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35383#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35382#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35381#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35380#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35377#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35375#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35371#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35368#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35367#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35366#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35364#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35360#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35358#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35354#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35348#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35342#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35333#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35331#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35329#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35327#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35315#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35311#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35305#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35303#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35299#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35297#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35295#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35293#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35291#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35287#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35285#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35279#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35277#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35273#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35271#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35267#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35265#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35264#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35236#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35235#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35228#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35229#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35224#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35225#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35220#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35221#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35217#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35212#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35208#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35209#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35205#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35204#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35203#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35199#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35197#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35193#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35194#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35190#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35184#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35182#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35176#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35177#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35129#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35127#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35126#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35125#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35124#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35123#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35122#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35121#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35119#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35118#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35117#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35113#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35112#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35111#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35108#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35105#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35103#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35100#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35097#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35096#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35092#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35091#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35090#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35088#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35087#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35085#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35084#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35083#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35082#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35081#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35079#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35078#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35073#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35072#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35070#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35069#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35067#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35065#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35064#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35063#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35062#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35061#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35060#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35058#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35057#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35056#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35055#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35054#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35053#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35052#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35048#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35046#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35045#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35042#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35037#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35034#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35033#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35032#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35031#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35030#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35029#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35028#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35027#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35025#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35024#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35022#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35021#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35020#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35019#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35018#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35017#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35015#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35014#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35013#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35009#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35007#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35172#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35170#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35164#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35162#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35159#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35158#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35157#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35155#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35154#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35150#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35143#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35141#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 35140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 35137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35136#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 35135#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 34999#L12-1 [2020-11-29 20:48:25,678 INFO L796 eck$LassoCheckResult]: Loop: 34999#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 35000#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 34999#L12-1 [2020-11-29 20:48:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1239724674, now seen corresponding path program 28 times [2020-11-29 20:48:25,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:25,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134243217] [2020-11-29 20:48:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 25155 backedges. 12312 proven. 7065 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2020-11-29 20:48:26,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134243217] [2020-11-29 20:48:26,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195903702] [2020-11-29 20:48:26,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:26,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:48:26,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:26,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-29 20:48:26,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25155 backedges. 11112 proven. 1485 refuted. 0 times theorem prover too weak. 12558 trivial. 0 not checked. [2020-11-29 20:48:27,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:27,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 40] total 55 [2020-11-29 20:48:27,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384060062] [2020-11-29 20:48:27,410 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 38 times [2020-11-29 20:48:27,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:27,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865138241] [2020-11-29 20:48:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:27,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:27,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:27,415 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:27,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:27,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2020-11-29 20:48:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=2319, Unknown=0, NotChecked=0, Total=2970 [2020-11-29 20:48:27,465 INFO L87 Difference]: Start difference. First operand 555 states and 583 transitions. cyclomatic complexity: 35 Second operand 55 states. [2020-11-29 20:48:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:33,179 INFO L93 Difference]: Finished difference Result 1068 states and 1128 transitions. [2020-11-29 20:48:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2020-11-29 20:48:33,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1068 states and 1128 transitions. [2020-11-29 20:48:33,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:33,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1068 states to 980 states and 1038 transitions. [2020-11-29 20:48:33,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2020-11-29 20:48:33,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2020-11-29 20:48:33,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 980 states and 1038 transitions. [2020-11-29 20:48:33,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:33,189 INFO L691 BuchiCegarLoop]: Abstraction has 980 states and 1038 transitions. [2020-11-29 20:48:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states and 1038 transitions. [2020-11-29 20:48:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 606. [2020-11-29 20:48:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2020-11-29 20:48:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 634 transitions. [2020-11-29 20:48:33,200 INFO L714 BuchiCegarLoop]: Abstraction has 606 states and 634 transitions. [2020-11-29 20:48:33,200 INFO L594 BuchiCegarLoop]: Abstraction has 606 states and 634 transitions. [2020-11-29 20:48:33,200 INFO L427 BuchiCegarLoop]: ======== Iteration 43============ [2020-11-29 20:48:33,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 606 states and 634 transitions. [2020-11-29 20:48:33,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:33,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:33,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:33,206 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [143, 143, 127, 16, 1] [2020-11-29 20:48:33,206 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:33,207 INFO L794 eck$LassoCheckResult]: Stem: 38328#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 38329#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38330#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38333#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38846#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38845#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38844#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38843#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38842#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38841#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38840#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38839#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38838#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38837#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38836#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38835#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38834#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38833#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38832#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38831#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38830#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38829#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38828#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38827#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38826#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38825#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38824#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38823#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38821#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38820#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38819#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38818#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38817#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38815#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38814#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38813#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38812#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38810#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38809#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38808#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38807#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38806#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38804#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38803#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38802#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38801#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38796#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38792#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38791#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38788#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38787#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38785#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38784#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38783#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38782#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38780#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38779#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38778#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38777#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38776#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38775#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38773#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38772#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38771#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38770#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38769#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38768#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38767#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38766#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38765#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38764#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38763#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38762#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38761#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38760#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38759#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38758#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38757#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38756#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38755#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38754#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38753#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38752#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38751#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38750#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38749#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38748#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38747#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38746#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38745#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38744#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38743#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38742#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38740#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38739#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38738#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38731#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38726#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38723#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38722#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38720#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38719#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38717#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38716#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38714#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38713#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38712#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38711#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38710#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38708#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38707#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38706#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38705#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38704#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38703#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38702#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38699#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38698#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38696#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38695#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38694#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38692#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38691#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38690#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38672#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38688#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38666#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38665#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38663#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38662#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38660#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38659#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38657#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38656#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38654#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38653#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38652#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38651#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38650#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38649#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38647#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38646#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38645#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38644#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38643#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38642#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38641#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38640#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38639#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38638#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38637#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38636#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38635#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38626#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38621#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38620#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38615#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38613#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38609#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38607#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38603#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38601#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38597#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38595#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38591#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38589#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38584#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38581#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38562#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38553#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38552#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38547#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38545#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38540#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38614#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38612#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38610#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38608#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38606#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38602#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38600#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38596#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38594#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38590#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38588#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38583#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38575#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38567#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38561#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38502#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38459#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38458#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38457#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38456#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38455#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38454#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38453#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38452#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38451#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38450#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38449#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38447#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38446#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38444#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38443#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38441#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38439#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38438#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38437#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38436#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38435#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38434#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38433#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38404#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38431#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38430#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38429#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38428#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38427#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38426#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38425#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38424#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38423#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38422#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38421#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38420#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38419#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38418#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38417#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38416#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38415#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38414#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38413#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38412#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38411#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38410#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38409#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38408#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38407#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38406#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38405#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38403#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38402#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38401#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38400#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38399#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38398#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38397#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38396#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38395#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38394#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38393#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38392#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38391#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38390#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38389#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38388#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38387#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38386#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38385#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38384#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38383#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38382#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38381#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38380#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38377#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38376#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38373#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38361#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38340#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38359#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38358#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38357#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38356#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38355#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38354#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38353#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38350#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38348#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38344#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38342#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38339#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38335#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38336#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38338#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38501#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38489#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38483#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38480#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38479#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38478#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38477#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38476#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38474#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38473#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38472#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38471#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38470#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38468#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38467#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38466#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 38464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 38460#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 38461#L12-1 [2020-11-29 20:48:33,207 INFO L796 eck$LassoCheckResult]: Loop: 38461#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 38462#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 38461#L12-1 [2020-11-29 20:48:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2062858279, now seen corresponding path program 29 times [2020-11-29 20:48:33,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:33,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805542597] [2020-11-29 20:48:33,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30459 backedges. 14310 proven. 3105 refuted. 0 times theorem prover too weak. 13044 trivial. 0 not checked. [2020-11-29 20:48:33,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805542597] [2020-11-29 20:48:33,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422868347] [2020-11-29 20:48:33,708 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:33,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2020-11-29 20:48:33,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:33,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-29 20:48:33,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30459 backedges. 16731 proven. 931 refuted. 0 times theorem prover too weak. 12797 trivial. 0 not checked. [2020-11-29 20:48:34,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:34,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 32] total 49 [2020-11-29 20:48:34,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117551060] [2020-11-29 20:48:34,794 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 39 times [2020-11-29 20:48:34,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:34,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233107804] [2020-11-29 20:48:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:34,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:34,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:34,797 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:34,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:34,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-11-29 20:48:34,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1886, Unknown=0, NotChecked=0, Total=2352 [2020-11-29 20:48:34,814 INFO L87 Difference]: Start difference. First operand 606 states and 634 transitions. cyclomatic complexity: 34 Second operand 49 states. [2020-11-29 20:48:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:40,071 INFO L93 Difference]: Finished difference Result 993 states and 1034 transitions. [2020-11-29 20:48:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2020-11-29 20:48:40,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 993 states and 1034 transitions. [2020-11-29 20:48:40,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:40,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 993 states to 975 states and 1016 transitions. [2020-11-29 20:48:40,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-11-29 20:48:40,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2020-11-29 20:48:40,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 975 states and 1016 transitions. [2020-11-29 20:48:40,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:40,079 INFO L691 BuchiCegarLoop]: Abstraction has 975 states and 1016 transitions. [2020-11-29 20:48:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states and 1016 transitions. [2020-11-29 20:48:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 588. [2020-11-29 20:48:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-11-29 20:48:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 610 transitions. [2020-11-29 20:48:40,090 INFO L714 BuchiCegarLoop]: Abstraction has 588 states and 610 transitions. [2020-11-29 20:48:40,090 INFO L594 BuchiCegarLoop]: Abstraction has 588 states and 610 transitions. [2020-11-29 20:48:40,090 INFO L427 BuchiCegarLoop]: ======== Iteration 44============ [2020-11-29 20:48:40,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 588 states and 610 transitions. [2020-11-29 20:48:40,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:40,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:40,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:40,096 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [144, 144, 128, 16, 1] [2020-11-29 20:48:40,096 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:40,097 INFO L794 eck$LassoCheckResult]: Stem: 41530#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 41531#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41532#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41535#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 42117#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42116#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42115#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42114#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42113#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42112#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42111#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42110#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42109#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42108#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42107#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42106#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42105#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42104#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42103#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42100#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42097#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42096#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42092#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42091#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42090#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42088#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42087#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42085#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42084#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42083#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42082#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42081#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42079#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42078#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42076#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42073#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42072#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42070#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42069#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42067#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42065#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42064#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42063#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42059#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 42058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42027#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42026#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42024#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42023#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42014#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 42008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 42011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 42009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41996#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41993#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41992#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41990#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41989#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41987#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41985#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41984#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41981#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41972#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41964#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41963#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41960#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41884#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41883#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41882#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41880#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41879#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41878#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41875#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41873#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41872#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41871#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41870#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41869#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41868#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41867#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41866#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41864#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41861#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41860#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41859#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41858#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41855#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41854#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41852#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41849#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41848#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41847#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41845#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41846#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41835#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41912#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41909#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41906#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41904#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41903#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41902#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41900#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41897#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41896#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41891#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41888#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41796#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41782#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41781#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41780#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41778#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41776#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41775#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41774#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41772#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41770#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41769#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41768#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41767#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41764#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41763#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41762#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41761#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41760#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41759#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41758#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41757#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41756#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41755#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41754#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41752#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41751#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41750#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41748#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41747#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41746#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41660#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41659#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41657#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41656#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41654#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41653#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41652#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41651#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41650#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41649#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41647#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41646#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41645#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41644#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41643#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41642#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41641#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41640#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41639#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41638#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41637#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41636#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41635#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41634#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41633#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41632#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41631#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41630#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41629#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41628#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41627#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41626#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41624#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41623#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41622#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41621#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41620#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41617#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41616#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41614#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41613#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41612#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41610#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41609#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41608#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41581#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41607#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41603#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41579#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41578#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41577#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41575#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41572#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41571#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41568#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41566#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41542#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41561#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41558#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41546#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41545#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41544#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41543#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41537#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41703#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41702#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41701#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41700#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41699#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41698#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41697#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41696#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41695#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41694#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41693#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41692#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41691#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41690#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41689#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41688#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41687#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41686#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41685#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41684#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41683#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41682#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41681#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41680#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41679#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41678#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41676#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41675#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41674#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41673#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41672#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41670#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41669#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41667#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 41666#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41665#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 41662#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 41663#L12-1 [2020-11-29 20:48:40,097 INFO L796 eck$LassoCheckResult]: Loop: 41663#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 41664#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 41663#L12-1 [2020-11-29 20:48:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash -233067676, now seen corresponding path program 30 times [2020-11-29 20:48:40,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:40,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112796210] [2020-11-29 20:48:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30888 backedges. 15477 proven. 5289 refuted. 0 times theorem prover too weak. 10122 trivial. 0 not checked. [2020-11-29 20:48:40,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112796210] [2020-11-29 20:48:40,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81186667] [2020-11-29 20:48:40,681 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:40,817 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2020-11-29 20:48:40,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:40,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-29 20:48:40,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30888 backedges. 19014 proven. 834 refuted. 0 times theorem prover too weak. 11040 trivial. 0 not checked. [2020-11-29 20:48:41,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:41,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 31] total 48 [2020-11-29 20:48:41,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845247553] [2020-11-29 20:48:41,747 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 40 times [2020-11-29 20:48:41,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:41,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658479951] [2020-11-29 20:48:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:41,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:41,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:41,751 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:41,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:41,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-11-29 20:48:41,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2020-11-29 20:48:41,766 INFO L87 Difference]: Start difference. First operand 588 states and 610 transitions. cyclomatic complexity: 27 Second operand 48 states. [2020-11-29 20:48:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:47,093 INFO L93 Difference]: Finished difference Result 1126 states and 1174 transitions. [2020-11-29 20:48:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2020-11-29 20:48:47,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1126 states and 1174 transitions. [2020-11-29 20:48:47,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:47,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1126 states to 1116 states and 1164 transitions. [2020-11-29 20:48:47,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2020-11-29 20:48:47,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2020-11-29 20:48:47,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1116 states and 1164 transitions. [2020-11-29 20:48:47,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:47,102 INFO L691 BuchiCegarLoop]: Abstraction has 1116 states and 1164 transitions. [2020-11-29 20:48:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states and 1164 transitions. [2020-11-29 20:48:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 723. [2020-11-29 20:48:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-11-29 20:48:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 746 transitions. [2020-11-29 20:48:47,114 INFO L714 BuchiCegarLoop]: Abstraction has 723 states and 746 transitions. [2020-11-29 20:48:47,114 INFO L594 BuchiCegarLoop]: Abstraction has 723 states and 746 transitions. [2020-11-29 20:48:47,114 INFO L427 BuchiCegarLoop]: ======== Iteration 45============ [2020-11-29 20:48:47,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 723 states and 746 transitions. [2020-11-29 20:48:47,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:47,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:47,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:47,120 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [147, 147, 131, 16, 1] [2020-11-29 20:48:47,120 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:47,121 INFO L794 eck$LassoCheckResult]: Stem: 44863#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 44864#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44868#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45503#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45502#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45501#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45489#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45483#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45480#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45479#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45478#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45477#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45476#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45474#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45473#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45472#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45471#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45470#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45468#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45467#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45466#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45462#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45461#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45460#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45459#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45458#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45457#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45456#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45455#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45454#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45453#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45452#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45451#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45450#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45449#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45447#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45446#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45445#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45444#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45442#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45441#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45439#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45438#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45437#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45435#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45433#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45432#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45431#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45430#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45429#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45428#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45427#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45426#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45425#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45423#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45422#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45421#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45420#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45419#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45418#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45417#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45416#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45415#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45412#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45411#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45410#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45409#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45408#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45407#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45406#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45405#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45404#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45403#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45400#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45398#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45394#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45395#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45390#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45391#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45387#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45382#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45376#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45370#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45366#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45364#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45360#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45358#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45354#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45348#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45342#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45338#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45336#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45332#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45330#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45328#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45326#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45324#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45320#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45318#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45314#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45312#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45308#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45303#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45304#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45383#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45377#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45371#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45367#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45365#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45359#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45353#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45349#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45343#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45339#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45331#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45327#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45315#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45311#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45305#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45270#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45266#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45264#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45260#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45258#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45252#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45246#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45242#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45240#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45234#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45232#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45228#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45222#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45219#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45218#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45217#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45216#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45214#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45212#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45122#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45116#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45072#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45070#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45069#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45067#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45065#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45064#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45063#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45062#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45061#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45060#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45058#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45057#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45056#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45055#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45054#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45053#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45052#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45051#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45050#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45049#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45048#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45047#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45046#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45045#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45044#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45042#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45038#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45078#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44992#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 44991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44990#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44989#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44988#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44987#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44986#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44985#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44984#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44983#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44982#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44981#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44980#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44979#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44978#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44977#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44976#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44975#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44974#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44973#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44972#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44971#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44970#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44969#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44968#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44967#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44939#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44964#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44963#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 44962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44960#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44942#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44914#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44940#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44936#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 44935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44930#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44913#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44911#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 44910#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44908#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44907#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44906#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44901#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44900#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44899#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44898#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44891#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 44890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44888#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44885#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44884#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44883#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44882#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44880#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44879#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44878#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44872#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44870#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 44871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45034#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45033#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45032#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45030#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45029#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45028#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45026#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45025#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45024#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45022#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45020#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45016#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45013#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45012#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45007#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45006#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 45005#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45004#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45003#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 45002#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 45001#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 45000#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 44999#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44998#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 44995#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 44996#L12-1 [2020-11-29 20:48:47,121 INFO L796 eck$LassoCheckResult]: Loop: 44996#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 44997#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 44996#L12-1 [2020-11-29 20:48:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:47,122 INFO L82 PathProgramCache]: Analyzing trace with hash -817446101, now seen corresponding path program 31 times [2020-11-29 20:48:47,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:47,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960612742] [2020-11-29 20:48:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 32193 backedges. 15066 proven. 10944 refuted. 0 times theorem prover too weak. 6183 trivial. 0 not checked. [2020-11-29 20:48:47,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960612742] [2020-11-29 20:48:47,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359984982] [2020-11-29 20:48:47,613 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:47,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-29 20:48:47,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 32193 backedges. 12636 proven. 1653 refuted. 0 times theorem prover too weak. 17904 trivial. 0 not checked. [2020-11-29 20:48:48,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:48,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 36 [2020-11-29 20:48:48,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623226141] [2020-11-29 20:48:48,295 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:48,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 41 times [2020-11-29 20:48:48,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:48,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764151104] [2020-11-29 20:48:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:48,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:48,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:48,298 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:48,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-11-29 20:48:48,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=856, Unknown=0, NotChecked=0, Total=1332 [2020-11-29 20:48:48,321 INFO L87 Difference]: Start difference. First operand 723 states and 746 transitions. cyclomatic complexity: 29 Second operand 37 states. [2020-11-29 20:48:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:49,835 INFO L93 Difference]: Finished difference Result 1444 states and 1491 transitions. [2020-11-29 20:48:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2020-11-29 20:48:49,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1444 states and 1491 transitions. [2020-11-29 20:48:49,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:49,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1444 states to 1440 states and 1487 transitions. [2020-11-29 20:48:49,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:49,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:49,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1440 states and 1487 transitions. [2020-11-29 20:48:49,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:49,847 INFO L691 BuchiCegarLoop]: Abstraction has 1440 states and 1487 transitions. [2020-11-29 20:48:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states and 1487 transitions. [2020-11-29 20:48:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 729. [2020-11-29 20:48:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2020-11-29 20:48:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 753 transitions. [2020-11-29 20:48:49,860 INFO L714 BuchiCegarLoop]: Abstraction has 729 states and 753 transitions. [2020-11-29 20:48:49,860 INFO L594 BuchiCegarLoop]: Abstraction has 729 states and 753 transitions. [2020-11-29 20:48:49,860 INFO L427 BuchiCegarLoop]: ======== Iteration 46============ [2020-11-29 20:48:49,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 729 states and 753 transitions. [2020-11-29 20:48:49,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:49,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:49,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:49,867 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [160, 160, 143, 17, 1] [2020-11-29 20:48:49,867 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:49,868 INFO L794 eck$LassoCheckResult]: Stem: 48495#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 48496#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48497#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48502#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 49115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49098#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49089#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49084#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49080#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49075#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49074#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49072#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49071#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49070#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49069#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49068#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49063#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49060#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49056#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 49055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49027#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49026#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49024#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49023#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49014#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49010#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49009#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49005#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49004#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49003#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 49002#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 49001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 49000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48999#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48996#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48993#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48992#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48990#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48989#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48987#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48985#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48984#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48981#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48972#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48964#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48963#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48960#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48955#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48954#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48953#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48952#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48951#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48950#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48949#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48948#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48947#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48946#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48945#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48944#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48943#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48942#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48941#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48940#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48939#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48938#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48937#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48936#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48935#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48934#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48933#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48932#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48931#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48930#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48929#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48928#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48927#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48926#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48925#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48924#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48923#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48922#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48921#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48920#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48919#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48918#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48917#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48916#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48915#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48914#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48913#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48908#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48907#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48906#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48905#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48904#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48903#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48902#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48901#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48899#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48898#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48897#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48896#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48895#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48893#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48892#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48891#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48890#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48889#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48888#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48887#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48886#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48884#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48880#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48879#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48878#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48844#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48840#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48838#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48834#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48832#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48824#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48823#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48822#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48821#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48819#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48818#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48817#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48816#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48815#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48814#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48813#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48812#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48811#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48810#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48809#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48808#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48807#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48806#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48805#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48804#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48803#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48802#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48801#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48800#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48799#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48796#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48795#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48794#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48793#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48792#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48717#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48712#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48713#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48714#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48753#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48752#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48750#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48749#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48748#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48746#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48744#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48743#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48742#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48741#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48740#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48738#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48736#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48735#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48734#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48732#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48731#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48730#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48729#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48728#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48678#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48676#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48673#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48628#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48627#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48626#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48624#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48622#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48621#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48620#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48618#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48617#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48616#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48615#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48614#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48613#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48612#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48611#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48610#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48609#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48608#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48607#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48605#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48604#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48603#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48602#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48601#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48597#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48579#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48548#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48570#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48569#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48568#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48567#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48564#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48563#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48562#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48561#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48558#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48545#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48542#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48539#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48537#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48536#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48535#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48533#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48531#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48530#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48508#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48528#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48527#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48526#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48525#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48524#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48523#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48522#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48521#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48520#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48519#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48518#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48517#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48516#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48515#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48514#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48513#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48512#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48511#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48510#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48507#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48506#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48504#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48505#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48509#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48672#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48671#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48668#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48666#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48665#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48664#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48662#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48661#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48660#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48659#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48656#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48655#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48654#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48653#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48652#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48651#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48650#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48649#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48648#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48647#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48646#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48645#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48644#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48643#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48642#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48641#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48639#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48638#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48636#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48634#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 48633#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48632#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 48629#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 48630#L12-1 [2020-11-29 20:48:49,869 INFO L796 eck$LassoCheckResult]: Loop: 48630#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 48631#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 48630#L12-1 [2020-11-29 20:48:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1439192410, now seen corresponding path program 32 times [2020-11-29 20:48:49,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:49,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979755670] [2020-11-29 20:48:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 38160 backedges. 17325 proven. 3372 refuted. 0 times theorem prover too weak. 17463 trivial. 0 not checked. [2020-11-29 20:48:50,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979755670] [2020-11-29 20:48:50,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208926355] [2020-11-29 20:48:50,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:50,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:48:50,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:50,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 20:48:50,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 38160 backedges. 17325 proven. 3372 refuted. 0 times theorem prover too weak. 17463 trivial. 0 not checked. [2020-11-29 20:48:51,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:51,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2020-11-29 20:48:51,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706152175] [2020-11-29 20:48:51,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 42 times [2020-11-29 20:48:51,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:51,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048444319] [2020-11-29 20:48:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:51,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:51,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:51,154 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:51,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-29 20:48:51,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 20:48:51,172 INFO L87 Difference]: Start difference. First operand 729 states and 753 transitions. cyclomatic complexity: 30 Second operand 35 states. [2020-11-29 20:48:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:48:52,320 INFO L93 Difference]: Finished difference Result 739 states and 762 transitions. [2020-11-29 20:48:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-11-29 20:48:52,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 739 states and 762 transitions. [2020-11-29 20:48:52,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:52,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 739 states to 737 states and 760 transitions. [2020-11-29 20:48:52,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:48:52,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-11-29 20:48:52,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 737 states and 760 transitions. [2020-11-29 20:48:52,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:48:52,326 INFO L691 BuchiCegarLoop]: Abstraction has 737 states and 760 transitions. [2020-11-29 20:48:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states and 760 transitions. [2020-11-29 20:48:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 687. [2020-11-29 20:48:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-11-29 20:48:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 709 transitions. [2020-11-29 20:48:52,334 INFO L714 BuchiCegarLoop]: Abstraction has 687 states and 709 transitions. [2020-11-29 20:48:52,334 INFO L594 BuchiCegarLoop]: Abstraction has 687 states and 709 transitions. [2020-11-29 20:48:52,334 INFO L427 BuchiCegarLoop]: ======== Iteration 47============ [2020-11-29 20:48:52,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 709 transitions. [2020-11-29 20:48:52,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:48:52,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:48:52,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:48:52,340 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [162, 162, 145, 17, 1] [2020-11-29 20:48:52,340 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:48:52,341 INFO L794 eck$LassoCheckResult]: Stem: 51507#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 51508#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51514#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51515#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 52148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52147#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52143#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52098#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52092#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52093#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52089#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 52088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52084#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52080#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52075#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52074#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52072#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52071#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52070#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52069#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52068#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52063#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52059#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52032#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 52031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52027#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52026#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52024#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52023#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52014#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52010#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52009#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52005#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52004#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52003#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 52002#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 52001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 52000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51999#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51996#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51990#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51974#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51964#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51963#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51962#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51961#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51958#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51957#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51956#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51955#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51954#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51952#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51951#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51950#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51949#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51948#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51947#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51946#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51945#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51944#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51943#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51942#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51941#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51940#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51939#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51938#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51937#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51936#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51935#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51934#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51932#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51931#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51927#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51925#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51921#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51919#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51915#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51913#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51907#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51901#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51895#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51889#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51885#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51875#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51871#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51869#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51865#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51859#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51853#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51849#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51847#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51840#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51837#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51835#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51829#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51827#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51823#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51821#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51817#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51815#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51809#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51803#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51795#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51791#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51787#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51785#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51783#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51779#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51775#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51769#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51767#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51763#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51722#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51723#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51717#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51716#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51714#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51713#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51712#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51711#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51710#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51708#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51707#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51706#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51705#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51704#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51703#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51702#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51699#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51698#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51696#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51695#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51694#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51692#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51691#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51690#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51688#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51689#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51685#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51641#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51639#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51638#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51637#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51636#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51635#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51634#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51633#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51632#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51631#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51630#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51629#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51628#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51627#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51626#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51625#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51624#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51623#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51622#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51621#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51620#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51617#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51616#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51614#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51613#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51612#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51611#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51610#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51609#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51608#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51607#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51606#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51605#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51604#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51603#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51602#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51601#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51600#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51599#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51598#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51597#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51596#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51595#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51594#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51593#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51592#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51591#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51590#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51589#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51588#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51585#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51584#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51583#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51582#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51581#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51580#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51579#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51578#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51577#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51576#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51575#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51572#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51571#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51570#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51569#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51567#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51566#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51565#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51564#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51563#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51562#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51558#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51546#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51545#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51544#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51543#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51542#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51522#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51541#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51540#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51538#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51537#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51536#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51535#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51534#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51533#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51532#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51531#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51530#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51529#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51528#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51527#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51526#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51525#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51524#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51523#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51521#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51519#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51517#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51518#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51520#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51684#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51683#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51682#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51681#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51680#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51679#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51678#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51677#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51676#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51675#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51674#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51673#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51672#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51671#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51668#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51666#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51665#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51664#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51662#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51661#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51660#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51659#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51656#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51655#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51654#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51653#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51652#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51651#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51650#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51649#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51648#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 51647#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51646#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 51645#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 51509#L12-1 [2020-11-29 20:48:52,341 INFO L796 eck$LassoCheckResult]: Loop: 51509#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 51510#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 51509#L12-1 [2020-11-29 20:48:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2107192578, now seen corresponding path program 33 times [2020-11-29 20:48:52,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:52,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409065098] [2020-11-29 20:48:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:48:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 39123 backedges. 18915 proven. 11937 refuted. 0 times theorem prover too weak. 8271 trivial. 0 not checked. [2020-11-29 20:48:52,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409065098] [2020-11-29 20:48:52,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998923639] [2020-11-29 20:48:52,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:48:53,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2020-11-29 20:48:53,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:48:53,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-29 20:48:53,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:48:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 39123 backedges. 20194 proven. 10554 refuted. 0 times theorem prover too weak. 8375 trivial. 0 not checked. [2020-11-29 20:48:54,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:48:54,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 46 [2020-11-29 20:48:54,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178164635] [2020-11-29 20:48:54,019 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:48:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:48:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 43 times [2020-11-29 20:48:54,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:48:54,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954947513] [2020-11-29 20:48:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:48:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:54,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:48:54,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:48:54,021 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:48:54,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:48:54,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-11-29 20:48:54,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1715, Unknown=0, NotChecked=0, Total=2070 [2020-11-29 20:48:54,039 INFO L87 Difference]: Start difference. First operand 687 states and 709 transitions. cyclomatic complexity: 28 Second operand 46 states. [2020-11-29 20:49:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:01,558 INFO L93 Difference]: Finished difference Result 1756 states and 1818 transitions. [2020-11-29 20:49:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2020-11-29 20:49:01,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1756 states and 1818 transitions. [2020-11-29 20:49:01,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:01,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1756 states to 1678 states and 1740 transitions. [2020-11-29 20:49:01,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-11-29 20:49:01,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-11-29 20:49:01,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1678 states and 1740 transitions. [2020-11-29 20:49:01,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:01,569 INFO L691 BuchiCegarLoop]: Abstraction has 1678 states and 1740 transitions. [2020-11-29 20:49:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states and 1740 transitions. [2020-11-29 20:49:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1143. [2020-11-29 20:49:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2020-11-29 20:49:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1176 transitions. [2020-11-29 20:49:01,585 INFO L714 BuchiCegarLoop]: Abstraction has 1143 states and 1176 transitions. [2020-11-29 20:49:01,585 INFO L594 BuchiCegarLoop]: Abstraction has 1143 states and 1176 transitions. [2020-11-29 20:49:01,585 INFO L427 BuchiCegarLoop]: ======== Iteration 48============ [2020-11-29 20:49:01,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1143 states and 1176 transitions. [2020-11-29 20:49:01,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:01,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:01,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:01,592 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [170, 170, 152, 18, 1] [2020-11-29 20:49:01,592 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:01,593 INFO L794 eck$LassoCheckResult]: Stem: 55841#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 55842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55846#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56919#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56918#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56917#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56916#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56915#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56914#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56913#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56911#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56910#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56908#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56907#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56906#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56901#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56900#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56899#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56898#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56894#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56893#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56892#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56890#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56888#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56887#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56885#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56883#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56881#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56876#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56872#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56870#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56865#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56863#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56864#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56862#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56860#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56859#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56858#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56857#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56856#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56853#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56852#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56851#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56850#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56849#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56845#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56844#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56841#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56840#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56839#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56838#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56837#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56836#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56835#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56834#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56833#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56832#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56830#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56829#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56828#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56827#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56824#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56823#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56822#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56821#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56818#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56815#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56814#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56812#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56810#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56808#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56806#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56804#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56793#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56791#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56787#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56785#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56783#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56781#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56779#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56777#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56771#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56769#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56767#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56765#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56763#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56761#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56759#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56755#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56753#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56747#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56743#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56737#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56735#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56731#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56725#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56723#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56717#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56713#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56711#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56708#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56699#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56698#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56700#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56612#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56611#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56610#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56609#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56608#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56607#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56605#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56604#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56603#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56602#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56601#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56600#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56599#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56598#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56597#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56596#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56595#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56594#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56593#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56592#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56591#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56590#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56589#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56588#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56586#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56585#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56584#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56583#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56582#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56581#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56579#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56578#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56577#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56576#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56575#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56572#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56571#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56568#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56566#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56560#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56556#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56555#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56554#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56553#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56551#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56548#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56545#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56542#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56539#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56537#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56536#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56535#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56533#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56531#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56530#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56528#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56527#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56526#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56525#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56524#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56523#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56522#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56521#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56520#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56519#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56518#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56517#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56516#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56515#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56514#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56513#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56512#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56511#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56510#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56509#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56508#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56507#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56506#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56505#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56504#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56503#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56502#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56501#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56500#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56499#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56498#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56497#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56496#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56495#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56494#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56493#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56492#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56491#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56490#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56361#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56357#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56355#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56351#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56347#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56345#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56341#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56339#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56337#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56335#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56333#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56329#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56327#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56325#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56323#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56321#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56317#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56315#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56311#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56309#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56307#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56303#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56230#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56202#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56200#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56196#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56192#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56190#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56184#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56180#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56175#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56171#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56169#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56165#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56163#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56159#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56157#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56155#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56151#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56144#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56140#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56138#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56136#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56132#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56126#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56124#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56120#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56118#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56114#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56112#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56108#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56100#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56098#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56096#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56093#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56087#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 56085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56083#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56075#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56060#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56054#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 56050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 56048#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 56046#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55967#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55954#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55942#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55937#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55938#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55971#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55932#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55931#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55929#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55928#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55927#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55926#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55925#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55924#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55923#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55922#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55921#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55920#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55919#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55918#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55917#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55916#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55915#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55914#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55870#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55869#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55865#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55864#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55863#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55862#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55860#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55859#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55858#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55857#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55856#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55852#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55848#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55849#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55851#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55913#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55912#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55911#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55910#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55909#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55908#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55907#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55906#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55905#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55904#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55903#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55902#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55901#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55899#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55898#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55897#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55896#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55895#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55893#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55892#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55891#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55890#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55889#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55888#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55887#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55886#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55884#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55881#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55880#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55879#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55878#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 55876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 55872#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 55873#L12-1 [2020-11-29 20:49:01,594 INFO L796 eck$LassoCheckResult]: Loop: 55873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 55874#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 55873#L12-1 [2020-11-29 20:49:01,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:01,594 INFO L82 PathProgramCache]: Analyzing trace with hash -50297856, now seen corresponding path program 34 times [2020-11-29 20:49:01,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:01,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003716166] [2020-11-29 20:49:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 43095 backedges. 19947 proven. 15393 refuted. 0 times theorem prover too weak. 7755 trivial. 0 not checked. [2020-11-29 20:49:02,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003716166] [2020-11-29 20:49:02,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494738993] [2020-11-29 20:49:02,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:49:02,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:49:02,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:49:02,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-29 20:49:02,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:49:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 43095 backedges. 19830 proven. 3429 refuted. 0 times theorem prover too weak. 19836 trivial. 0 not checked. [2020-11-29 20:49:03,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:49:03,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 40] total 56 [2020-11-29 20:49:03,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723050009] [2020-11-29 20:49:03,640 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:49:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 44 times [2020-11-29 20:49:03,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:03,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579602615] [2020-11-29 20:49:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:03,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:03,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:03,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:03,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:49:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2020-11-29 20:49:03,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=2406, Unknown=0, NotChecked=0, Total=3080 [2020-11-29 20:49:03,657 INFO L87 Difference]: Start difference. First operand 1143 states and 1176 transitions. cyclomatic complexity: 40 Second operand 56 states. [2020-11-29 20:49:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:11,030 INFO L93 Difference]: Finished difference Result 1605 states and 1668 transitions. [2020-11-29 20:49:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2020-11-29 20:49:11,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1605 states and 1668 transitions. [2020-11-29 20:49:11,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:11,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1605 states to 1558 states and 1620 transitions. [2020-11-29 20:49:11,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2020-11-29 20:49:11,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2020-11-29 20:49:11,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1558 states and 1620 transitions. [2020-11-29 20:49:11,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:11,039 INFO L691 BuchiCegarLoop]: Abstraction has 1558 states and 1620 transitions. [2020-11-29 20:49:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states and 1620 transitions. [2020-11-29 20:49:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1119. [2020-11-29 20:49:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-11-29 20:49:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1149 transitions. [2020-11-29 20:49:11,055 INFO L714 BuchiCegarLoop]: Abstraction has 1119 states and 1149 transitions. [2020-11-29 20:49:11,055 INFO L594 BuchiCegarLoop]: Abstraction has 1119 states and 1149 transitions. [2020-11-29 20:49:11,055 INFO L427 BuchiCegarLoop]: ======== Iteration 49============ [2020-11-29 20:49:11,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1119 states and 1149 transitions. [2020-11-29 20:49:11,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:11,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:11,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:11,062 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [176, 176, 158, 18, 1] [2020-11-29 20:49:11,062 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:11,063 INFO L794 eck$LassoCheckResult]: Stem: 60755#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 60756#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60760#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61821#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61819#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61818#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61817#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61816#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61815#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61814#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61813#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61812#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61811#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61810#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61809#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61808#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61807#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61806#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61805#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61804#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61803#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61802#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61801#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61800#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61799#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61796#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61795#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61794#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61793#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61792#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61791#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61789#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61788#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61787#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61786#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61785#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61784#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61783#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61782#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61781#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61780#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61779#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61778#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61777#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61776#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61774#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61772#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61771#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61770#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61769#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61768#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61767#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61766#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61764#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61763#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61762#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61760#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61759#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61758#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61756#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61754#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61753#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61752#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61750#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61749#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61748#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61746#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61744#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61743#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61742#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61741#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61740#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61738#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61736#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61735#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61734#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61732#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61731#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61730#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61729#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61728#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61726#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61723#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61722#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61720#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61719#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61717#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61716#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61714#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61713#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61712#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61711#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61706#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61650#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61705#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61703#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61702#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61701#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61700#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61699#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61698#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61697#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61696#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61695#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61694#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61693#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61692#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61690#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61689#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61688#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61687#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61686#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61685#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61684#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61683#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61682#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61681#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61680#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61679#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61678#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61677#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61676#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61675#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61674#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61672#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61671#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61670#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61669#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61668#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61667#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61666#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61665#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61663#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61662#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61660#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61659#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61657#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61655#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61652#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61653#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61656#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61654#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61644#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61643#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61642#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61641#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61640#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61639#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61638#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61637#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61636#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61635#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61634#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61633#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61632#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61631#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61630#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61629#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61628#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61627#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61626#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61624#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61622#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61621#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61620#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61618#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61617#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61616#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61615#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61614#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61613#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61612#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61611#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61610#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61609#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61608#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61607#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61605#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61604#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61603#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61602#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61600#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61599#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61598#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61597#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61596#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61595#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61594#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61593#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61592#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61591#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61590#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61589#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61588#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61587#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61586#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61585#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61584#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61583#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61582#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61581#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61580#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61579#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61578#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61577#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61576#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61575#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61572#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61571#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61570#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61569#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61567#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61566#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61565#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61564#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61563#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61562#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61561#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61556#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61515#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61514#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61513#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61512#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61511#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61510#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61509#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61508#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61507#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61506#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61505#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61504#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61503#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61502#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61501#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61489#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61482#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61437#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61358#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61356#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61317#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61313#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61308#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61305#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61299#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61296#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61293#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61290#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61287#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61281#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61278#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61275#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61272#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61266#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61263#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61257#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61248#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61245#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61239#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61230#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61224#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61221#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61218#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61217#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61207#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61203#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61200#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61195#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61175#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61171#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61166#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61164#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61162#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61160#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61158#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61152#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61150#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61146#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61140#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61134#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61132#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61128#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61126#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61122#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61116#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61109#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61102#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 61100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61096#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61092#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61090#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61084#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61078#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61070#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 61068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 61066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 61064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60899#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60900#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60884#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60880#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60879#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60878#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60891#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60888#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60860#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60861#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60857#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60852#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60849#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60845#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60844#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60841#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60840#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60839#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60838#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60837#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60836#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60835#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60834#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60791#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60790#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60788#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60787#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60767#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60786#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60785#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60784#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60783#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60782#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60781#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60780#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60779#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60778#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60777#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60776#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60774#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60772#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60771#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60770#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60769#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60768#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60764#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60762#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60763#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60833#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60832#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60830#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60829#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60828#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60827#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60824#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60823#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60822#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60821#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60818#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60815#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60814#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60812#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60811#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60810#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60809#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60808#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60806#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60805#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60804#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60803#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60800#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60798#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60797#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 60796#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60795#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 60792#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 60793#L12-1 [2020-11-29 20:49:11,064 INFO L796 eck$LassoCheckResult]: Loop: 60793#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 60794#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 60793#L12-1 [2020-11-29 20:49:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash -419178784, now seen corresponding path program 35 times [2020-11-29 20:49:11,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:11,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206123426] [2020-11-29 20:49:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 46200 backedges. 22464 proven. 6177 refuted. 0 times theorem prover too weak. 17559 trivial. 0 not checked. [2020-11-29 20:49:11,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206123426] [2020-11-29 20:49:11,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823110606] [2020-11-29 20:49:11,764 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:49:11,871 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2020-11-29 20:49:11,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:49:11,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-29 20:49:11,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:49:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 46200 backedges. 26687 proven. 1065 refuted. 0 times theorem prover too weak. 18448 trivial. 0 not checked. [2020-11-29 20:49:12,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:49:12,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 34] total 53 [2020-11-29 20:49:12,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081379088] [2020-11-29 20:49:12,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:49:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 45 times [2020-11-29 20:49:12,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:12,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710270750] [2020-11-29 20:49:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:12,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:12,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:12,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:12,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:49:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2020-11-29 20:49:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=2196, Unknown=0, NotChecked=0, Total=2756 [2020-11-29 20:49:12,899 INFO L87 Difference]: Start difference. First operand 1119 states and 1149 transitions. cyclomatic complexity: 36 Second operand 53 states. [2020-11-29 20:49:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:21,693 INFO L93 Difference]: Finished difference Result 1315 states and 1361 transitions. [2020-11-29 20:49:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2020-11-29 20:49:21,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 1361 transitions. [2020-11-29 20:49:21,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:21,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 1307 states and 1353 transitions. [2020-11-29 20:49:21,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-11-29 20:49:21,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-11-29 20:49:21,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1307 states and 1353 transitions. [2020-11-29 20:49:21,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:21,701 INFO L691 BuchiCegarLoop]: Abstraction has 1307 states and 1353 transitions. [2020-11-29 20:49:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states and 1353 transitions. [2020-11-29 20:49:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 777. [2020-11-29 20:49:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-11-29 20:49:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 797 transitions. [2020-11-29 20:49:21,709 INFO L714 BuchiCegarLoop]: Abstraction has 777 states and 797 transitions. [2020-11-29 20:49:21,709 INFO L594 BuchiCegarLoop]: Abstraction has 777 states and 797 transitions. [2020-11-29 20:49:21,710 INFO L427 BuchiCegarLoop]: ======== Iteration 50============ [2020-11-29 20:49:21,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 777 states and 797 transitions. [2020-11-29 20:49:21,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:21,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:21,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:21,716 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [186, 186, 167, 19, 1] [2020-11-29 20:49:21,716 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:21,717 INFO L794 eck$LassoCheckResult]: Stem: 65213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 65214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65218#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65936#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65930#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65912#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65909#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65906#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65904#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65903#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65902#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65900#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65897#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65896#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65891#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65888#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65885#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65884#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65883#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65880#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65879#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65878#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65875#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65873#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65872#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65871#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65870#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65869#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65868#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65867#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65866#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65864#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65861#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65860#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65859#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65858#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65855#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65854#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65852#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65849#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65848#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65847#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65846#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65843#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65841#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65840#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65835#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65834#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65832#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65831#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65829#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65828#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65766#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65821#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65819#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65818#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65817#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65815#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65814#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65813#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65812#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65811#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65810#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65809#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65808#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65807#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65806#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65805#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65804#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65803#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65802#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65801#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65800#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65796#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65793#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65792#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65791#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65790#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65789#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65788#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65787#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65785#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65784#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65783#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65782#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65781#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65780#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65779#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65778#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65777#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65776#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65775#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65773#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65772#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65770#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65767#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65768#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65764#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65763#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65762#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65761#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65760#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65759#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65758#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65757#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65756#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65755#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65754#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65753#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65752#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65751#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65750#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65749#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65748#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65747#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65746#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65745#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65744#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65743#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65742#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65740#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65739#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65738#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65737#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65736#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65735#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65734#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65733#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65731#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65730#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65728#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65727#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65726#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65725#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65724#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65723#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65722#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65721#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65720#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65673#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65717#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65716#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65715#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65714#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65713#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65712#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65711#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65710#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65709#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65708#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65707#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65706#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65705#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65704#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65703#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65702#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65701#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65700#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65699#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65698#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65697#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65696#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65695#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65694#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65693#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65692#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65691#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65690#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65689#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65688#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65687#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65686#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65685#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65684#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65683#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65682#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65681#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65680#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65679#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65678#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65677#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65676#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65675#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65631#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65674#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65672#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65671#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65670#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65669#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65667#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65666#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65665#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65664#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65663#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65662#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65661#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65660#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65659#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65658#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65657#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65656#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65655#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65654#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65653#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65652#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65651#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65650#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65649#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65648#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65647#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65646#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65645#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65644#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65643#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65642#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65641#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65640#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65639#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65638#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65637#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65636#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65635#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65634#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65633#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65593#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65632#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65630#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65629#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65628#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65627#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65626#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65625#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65624#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65623#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65622#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65621#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65620#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65619#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65618#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65617#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65616#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65615#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65614#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65613#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65612#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65611#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65610#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65609#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65608#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65607#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65606#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65605#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65604#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65603#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65602#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65601#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65600#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65599#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65598#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65597#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65596#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65591#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65587#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65585#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65581#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65579#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65575#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65567#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65561#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65555#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65551#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65549#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65545#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65543#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65541#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65539#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65537#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65535#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65533#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65531#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65529#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65527#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65489#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65485#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65483#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65479#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65477#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65473#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65471#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65467#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65465#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65461#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65459#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65457#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65455#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65453#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65451#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65449#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65447#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65445#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65443#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65441#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65439#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65437#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65435#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65433#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65432#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65430#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65426#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65424#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65422#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65420#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65418#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65416#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65412#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65410#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65408#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65406#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65404#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65400#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65398#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65394#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65392#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65390#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65388#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65382#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65381#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65380#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65379#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65378#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65377#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65376#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65375#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65374#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65373#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65372#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65371#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65370#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65369#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65368#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65367#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65366#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65365#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65364#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65363#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65362#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65359#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65358#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65356#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65353#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65341#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65338#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65334#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65330#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65322#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65318#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65310#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65305#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65304#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65303#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65300#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65299#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65298#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65297#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65296#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65295#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65294#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65293#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65292#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65291#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65290#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65246#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65245#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65225#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65244#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65242#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65241#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65240#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65238#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65235#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65234#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65233#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65232#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65229#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65226#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65224#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65222#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65220#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65221#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65223#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65288#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65285#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65281#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65280#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65279#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65278#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65277#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65276#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65275#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65274#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65273#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65272#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65271#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65270#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65269#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65268#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65267#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65266#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65265#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65264#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65263#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65262#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65261#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65260#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65259#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65258#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65257#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65256#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65255#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65254#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65253#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65252#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 65251#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65250#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 65247#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 65248#L12-1 [2020-11-29 20:49:21,718 INFO L796 eck$LassoCheckResult]: Loop: 65248#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 65249#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 65248#L12-1 [2020-11-29 20:49:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -875576194, now seen corresponding path program 36 times [2020-11-29 20:49:21,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:21,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987174295] [2020-11-29 20:49:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 51615 backedges. 24624 proven. 16884 refuted. 0 times theorem prover too weak. 10107 trivial. 0 not checked. [2020-11-29 20:49:22,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987174295] [2020-11-29 20:49:22,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098433251] [2020-11-29 20:49:22,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:49:22,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2020-11-29 20:49:22,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:49:22,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 20:49:22,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:49:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 51615 backedges. 16440 proven. 588 refuted. 0 times theorem prover too weak. 34587 trivial. 0 not checked. [2020-11-29 20:49:23,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:49:23,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2020-11-29 20:49:23,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808832153] [2020-11-29 20:49:23,092 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:49:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 46 times [2020-11-29 20:49:23,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:23,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260586908] [2020-11-29 20:49:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:23,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:23,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:23,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:23,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:49:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-29 20:49:23,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2020-11-29 20:49:23,131 INFO L87 Difference]: Start difference. First operand 777 states and 797 transitions. cyclomatic complexity: 26 Second operand 36 states. [2020-11-29 20:49:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:27,461 INFO L93 Difference]: Finished difference Result 1907 states and 1954 transitions. [2020-11-29 20:49:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2020-11-29 20:49:27,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1907 states and 1954 transitions. [2020-11-29 20:49:27,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:27,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1907 states to 1722 states and 1768 transitions. [2020-11-29 20:49:27,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-29 20:49:27,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2020-11-29 20:49:27,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1722 states and 1768 transitions. [2020-11-29 20:49:27,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:27,477 INFO L691 BuchiCegarLoop]: Abstraction has 1722 states and 1768 transitions. [2020-11-29 20:49:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states and 1768 transitions. [2020-11-29 20:49:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 960. [2020-11-29 20:49:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2020-11-29 20:49:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 984 transitions. [2020-11-29 20:49:27,492 INFO L714 BuchiCegarLoop]: Abstraction has 960 states and 984 transitions. [2020-11-29 20:49:27,492 INFO L594 BuchiCegarLoop]: Abstraction has 960 states and 984 transitions. [2020-11-29 20:49:27,492 INFO L427 BuchiCegarLoop]: ======== Iteration 51============ [2020-11-29 20:49:27,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 960 states and 984 transitions. [2020-11-29 20:49:27,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:27,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:27,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:27,499 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [189, 189, 170, 19, 1] [2020-11-29 20:49:27,499 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:27,500 INFO L794 eck$LassoCheckResult]: Stem: 69861#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 69862#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69864#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69868#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70588#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70587#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70586#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70585#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70584#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70583#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70582#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70581#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70580#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70579#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70578#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70577#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70576#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70575#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70574#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70573#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70572#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70571#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70570#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70569#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70567#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70566#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70565#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70564#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70563#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70562#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70561#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70560#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70559#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70558#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70557#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70556#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70555#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70554#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70553#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70552#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70551#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70550#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70549#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70548#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70547#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70546#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70545#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70544#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70543#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70542#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70541#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70540#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70538#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70537#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70536#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70535#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70534#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70532#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70533#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70531#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70530#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70529#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70528#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70527#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70526#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70525#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70524#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70523#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70522#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70521#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70520#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70519#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70518#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70517#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70516#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70515#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70514#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70513#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70512#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70511#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70510#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70509#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70508#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70507#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70506#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70505#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70504#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70503#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70502#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70501#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70500#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70499#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70498#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70497#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70496#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70495#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70494#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70493#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70492#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70491#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70490#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70489#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70488#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70487#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70486#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70485#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70484#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70483#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70482#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70481#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70480#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70479#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70478#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70477#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70476#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70475#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70474#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70473#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70472#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70471#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70470#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70469#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70468#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70467#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70466#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70465#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70464#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70463#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70462#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70461#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70460#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70459#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70458#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70457#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70456#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70455#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70454#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70453#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70452#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70451#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70450#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70449#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70447#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70446#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70444#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70443#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70441#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70439#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70438#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70437#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70436#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70435#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70434#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70433#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70430#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70426#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70423#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70427#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70425#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70415#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70414#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70412#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70411#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70410#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70409#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70408#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70407#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70406#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70405#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70404#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70403#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70400#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70398#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70395#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70394#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70393#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70392#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70390#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70389#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70387#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70383#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70382#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70381#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70380#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70377#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70375#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70371#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70367#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70366#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70365#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70364#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70363#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70362#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70361#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70360#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70359#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70358#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70357#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70356#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70355#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70354#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70353#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70350#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70348#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70344#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70342#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70338#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70337#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70332#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70330#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70328#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70327#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70325#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70320#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70319#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70318#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70317#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70316#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70315#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70314#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70313#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70312#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70311#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70310#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70308#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70307#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70306#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70304#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70303#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70302#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70301#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70300#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70299#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70298#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70297#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70296#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70295#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70294#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70293#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70292#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70291#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70290#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70289#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70288#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70287#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70286#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70285#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70284#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70283#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70282#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70281#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70280#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70279#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70278#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70277#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70276#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70275#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70274#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70273#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70272#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70271#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70270#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70269#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70268#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70267#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70266#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70265#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70264#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70263#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70262#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70261#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70260#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70259#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70258#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70257#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70256#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70255#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70253#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70252#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70251#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70250#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70249#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70247#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70246#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70245#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70244#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70202#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70197#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70195#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70191#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70189#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70183#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70179#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70177#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70175#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70173#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70169#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70167#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70163#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70161#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70159#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70157#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70155#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70149#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70143#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70141#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70137#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70135#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70121#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70119#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70117#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70111#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70105#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70103#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70097#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70091#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70089#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70087#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70085#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70081#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70073#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70071#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70069#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70063#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70059#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70057#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70051#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70045#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70039#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70037#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70033#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70027#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70025#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70023#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70021#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70007#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 70006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70004#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70003#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 70002#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 70001#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 70000#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69996#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69995#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69994#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69990#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69989#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69988#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69987#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69986#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69902#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69901#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69897#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69896#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69891#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69890#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69888#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69887#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69885#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69884#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69883#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69882#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69881#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69880#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69879#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69878#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69877#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69872#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69870#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69982#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69981#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69980#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69979#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69978#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69976#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69974#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69973#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69972#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69971#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69970#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69969#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69968#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69967#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69963#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69962#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69961#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69958#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69957#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69956#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69955#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69954#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69952#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69951#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69950#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69949#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69948#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69947#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69946#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69945#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69944#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69943#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69942#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69941#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69940#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69939#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69938#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69937#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69936#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69935#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69934#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69932#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69931#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69929#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69928#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69927#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69926#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69925#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69924#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69923#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69922#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69921#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69920#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69919#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69918#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69917#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69916#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69915#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69914#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69913#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69912#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69908#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 69907#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69906#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 69903#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 69904#L12-1 [2020-11-29 20:49:27,500 INFO L796 eck$LassoCheckResult]: Loop: 69904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 69905#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 69904#L12-1 [2020-11-29 20:49:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1617752563, now seen corresponding path program 37 times [2020-11-29 20:49:27,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:27,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931966873] [2020-11-29 20:49:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 53298 backedges. 23814 proven. 20952 refuted. 0 times theorem prover too weak. 8532 trivial. 0 not checked. [2020-11-29 20:49:28,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931966873] [2020-11-29 20:49:28,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915511546] [2020-11-29 20:49:28,152 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:49:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:28,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-29 20:49:28,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:49:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 53298 backedges. 22572 proven. 3705 refuted. 0 times theorem prover too weak. 27021 trivial. 0 not checked. [2020-11-29 20:49:28,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:49:28,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2020-11-29 20:49:28,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182806507] [2020-11-29 20:49:28,848 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:49:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 47 times [2020-11-29 20:49:28,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:28,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018480502] [2020-11-29 20:49:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:28,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:28,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:28,850 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:28,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:49:28,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-29 20:49:28,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2020-11-29 20:49:28,866 INFO L87 Difference]: Start difference. First operand 960 states and 984 transitions. cyclomatic complexity: 29 Second operand 38 states. [2020-11-29 20:49:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:31,288 INFO L93 Difference]: Finished difference Result 2007 states and 2061 transitions. [2020-11-29 20:49:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2020-11-29 20:49:31,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2007 states and 2061 transitions. [2020-11-29 20:49:31,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:31,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2007 states to 2003 states and 2057 transitions. [2020-11-29 20:49:31,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2020-11-29 20:49:31,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2020-11-29 20:49:31,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2003 states and 2057 transitions. [2020-11-29 20:49:31,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:31,306 INFO L691 BuchiCegarLoop]: Abstraction has 2003 states and 2057 transitions. [2020-11-29 20:49:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states and 2057 transitions. [2020-11-29 20:49:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 996. [2020-11-29 20:49:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2020-11-29 20:49:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1020 transitions. [2020-11-29 20:49:31,322 INFO L714 BuchiCegarLoop]: Abstraction has 996 states and 1020 transitions. [2020-11-29 20:49:31,322 INFO L594 BuchiCegarLoop]: Abstraction has 996 states and 1020 transitions. [2020-11-29 20:49:31,322 INFO L427 BuchiCegarLoop]: ======== Iteration 52============ [2020-11-29 20:49:31,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 1020 transitions. [2020-11-29 20:49:31,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:31,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:31,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:31,330 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [193, 193, 174, 19, 1] [2020-11-29 20:49:31,330 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:31,331 INFO L794 eck$LassoCheckResult]: Stem: 74728#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 74729#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74731#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74735#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75449#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75448#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75447#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75446#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75445#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75444#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75442#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75441#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75439#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75438#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75437#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75435#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75433#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75432#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75431#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75430#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75429#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75428#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75427#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75426#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75425#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75423#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75422#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75421#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75420#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75419#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75418#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75417#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75416#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75415#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75412#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75411#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75410#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75409#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75408#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75407#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75406#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75405#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75404#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75403#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75400#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75398#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75395#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75393#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75394#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75392#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75390#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75389#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75387#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75383#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75382#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75381#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75380#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75377#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75375#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75371#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75368#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75367#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75366#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75365#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75364#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75363#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75362#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75361#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75360#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75359#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75358#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75357#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75356#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75354#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75353#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75352#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75351#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75350#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75349#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75348#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75347#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75346#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75345#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75344#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75343#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75342#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75341#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75340#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75339#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75338#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75336#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75335#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75334#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75333#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75332#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75331#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75330#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75329#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75328#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75327#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75326#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75324#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75323#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75322#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75321#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75320#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75318#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75317#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75315#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75314#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75312#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75311#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75310#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75309#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75308#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75305#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75304#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75303#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75300#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75299#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75298#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75297#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75296#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75295#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75294#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75293#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75292#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75291#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75290#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75288#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75285#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75278#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75255#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75253#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75249#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75248#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75240#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75239#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75237#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75236#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75229#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75226#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75225#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75223#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75222#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75221#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75220#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75219#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75218#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75217#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75216#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75214#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75213#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75211#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75210#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75209#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75208#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75207#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75206#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75205#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75204#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75203#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75202#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75201#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75200#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75199#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75198#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75197#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75196#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75195#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75194#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75193#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75192#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75191#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75190#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75189#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75187#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75185#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75184#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75183#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75182#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75181#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75180#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75179#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75178#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75177#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75172#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75170#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75164#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75162#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75159#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75158#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75157#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75155#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75154#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75150#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75140#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75102#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75098#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75092#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 75089#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75074#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75053#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75050#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75041#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75032#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75026#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75014#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 75004#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 75002#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 75000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74996#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74995#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74994#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74993#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74992#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74991#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74990#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74986#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74980#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74978#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74974#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74972#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74968#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74964#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74962#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74956#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74954#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74950#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74948#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74944#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74942#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74938#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74936#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74932#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74926#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74924#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74920#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74918#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74914#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74912#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74908#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74906#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74904#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74900#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74894#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74890#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74888#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74886#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74882#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74767#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74881#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74793#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74792#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74791#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74790#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74788#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74787#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74786#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74785#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74784#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74783#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74782#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74781#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74780#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74779#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74778#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74775#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74774#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74772#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74770#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74769#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74742#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74768#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74764#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74763#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74762#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74761#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74760#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74759#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74758#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74757#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74756#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74755#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74754#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74752#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74751#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74750#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74748#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74747#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74746#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74745#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74744#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74743#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74741#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74737#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74738#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74740#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74875#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74873#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74872#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74871#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74870#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74869#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74868#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74867#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74866#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74865#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74864#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74863#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74861#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74860#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74859#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74858#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74857#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74855#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74854#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74853#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74852#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74851#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74849#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74848#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74847#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74846#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74843#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74841#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74840#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74835#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74834#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74832#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74831#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74829#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74828#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74827#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74826#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74825#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74824#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74823#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74822#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74821#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74819#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74818#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74817#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74816#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74815#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74814#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74813#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74812#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74811#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74810#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74809#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74808#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74807#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74806#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74805#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74804#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74803#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74799#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 74798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74797#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 74794#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 74795#L12-1 [2020-11-29 20:49:31,331 INFO L796 eck$LassoCheckResult]: Loop: 74795#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 74796#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 74795#L12-1 [2020-11-29 20:49:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:31,332 INFO L82 PathProgramCache]: Analyzing trace with hash 109818189, now seen corresponding path program 38 times [2020-11-29 20:49:31,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:31,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674378840] [2020-11-29 20:49:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 55584 backedges. 26418 proven. 6561 refuted. 0 times theorem prover too weak. 22605 trivial. 0 not checked. [2020-11-29 20:49:32,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674378840] [2020-11-29 20:49:32,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409995568] [2020-11-29 20:49:32,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:49:32,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:49:32,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:49:32,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-29 20:49:32,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:49:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 55584 backedges. 26418 proven. 6561 refuted. 0 times theorem prover too weak. 22605 trivial. 0 not checked. [2020-11-29 20:49:32,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:49:32,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2020-11-29 20:49:32,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657129414] [2020-11-29 20:49:32,904 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:49:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 48 times [2020-11-29 20:49:32,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:32,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787607333] [2020-11-29 20:49:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:32,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:32,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:32,906 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:32,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:49:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-29 20:49:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=951, Unknown=0, NotChecked=0, Total=1406 [2020-11-29 20:49:32,922 INFO L87 Difference]: Start difference. First operand 996 states and 1020 transitions. cyclomatic complexity: 29 Second operand 38 states. [2020-11-29 20:49:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:34,835 INFO L93 Difference]: Finished difference Result 1004 states and 1028 transitions. [2020-11-29 20:49:34,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2020-11-29 20:49:34,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1004 states and 1028 transitions. [2020-11-29 20:49:34,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:34,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1004 states to 1002 states and 1026 transitions. [2020-11-29 20:49:34,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2020-11-29 20:49:34,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2020-11-29 20:49:34,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1002 states and 1026 transitions. [2020-11-29 20:49:34,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:34,842 INFO L691 BuchiCegarLoop]: Abstraction has 1002 states and 1026 transitions. [2020-11-29 20:49:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states and 1026 transitions. [2020-11-29 20:49:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 732. [2020-11-29 20:49:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-11-29 20:49:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 750 transitions. [2020-11-29 20:49:34,852 INFO L714 BuchiCegarLoop]: Abstraction has 732 states and 750 transitions. [2020-11-29 20:49:34,852 INFO L594 BuchiCegarLoop]: Abstraction has 732 states and 750 transitions. [2020-11-29 20:49:34,852 INFO L427 BuchiCegarLoop]: ======== Iteration 53============ [2020-11-29 20:49:34,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 732 states and 750 transitions. [2020-11-29 20:49:34,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:34,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:34,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:34,859 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [206, 206, 186, 20, 1] [2020-11-29 20:49:34,859 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:34,860 INFO L794 eck$LassoCheckResult]: Stem: 78614#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 78615#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78620#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78621#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 79345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78622#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78618#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78619#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79344#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79342#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79338#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79337#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79332#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79330#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79328#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79327#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79325#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79321#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79315#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79312#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79311#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79309#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79308#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79307#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79306#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79305#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79304#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79303#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79302#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79301#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79299#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79296#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79295#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79293#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79294#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79290#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 79289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79287#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79286#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79285#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79284#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79283#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79282#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79278#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79255#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79253#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79249#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79248#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79240#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79239#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79237#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79236#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79235#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79234#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 79233#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79232#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79231#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79230#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79229#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79228#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79227#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79226#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79225#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79224#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79223#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79222#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79221#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79220#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79219#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79218#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79217#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79216#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79215#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79214#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79213#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79212#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79211#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79210#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79209#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79208#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79207#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79206#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79205#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79204#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79203#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79202#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79201#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79200#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79199#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79198#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79197#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79196#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79195#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79194#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79193#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79192#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79191#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79190#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79189#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79188#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79187#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79186#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79181#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79182#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79178#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79177#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 79176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79172#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79170#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79164#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79162#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79159#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79158#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79157#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79155#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79154#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79150#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79143#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79141#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79136#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79135#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79133#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79132#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79129#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79127#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79124#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79123#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 79122#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79121#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79119#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79118#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79117#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79113#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79112#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79111#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79108#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79105#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79103#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79102#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79101#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79100#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79099#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79098#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79097#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79096#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79095#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79094#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79093#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79092#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79091#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79090#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79089#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79088#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79087#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79086#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79085#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79084#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79083#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79079#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79077#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79075#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 79074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79073#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79065#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79063#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79060#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79059#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79057#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79056#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79054#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79053#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79051#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79048#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79046#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79045#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79042#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79037#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79034#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79032#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79030#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 79029#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79028#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79026#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79025#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79024#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79022#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79020#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79016#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79013#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79012#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79007#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79006#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79005#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79004#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79003#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 79002#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 79001#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 79000#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78999#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78998#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78997#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78996#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78995#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78994#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78993#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78990#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78989#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78988#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78987#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78982#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78981#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78980#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78979#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78978#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78976#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78974#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78973#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78972#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78971#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78970#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78969#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78968#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78967#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78963#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78962#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78961#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78958#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78957#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78956#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78951#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78947#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78945#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78941#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78939#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78935#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78929#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78927#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78923#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78921#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78917#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78915#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78911#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78909#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78903#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78899#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78897#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78893#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78891#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78889#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78887#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78872#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78870#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78868#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78864#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78862#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78860#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78858#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78856#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78852#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78850#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78846#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78840#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78836#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78834#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78832#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78830#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78828#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78826#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78824#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78822#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78818#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78816#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78814#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78812#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78810#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78808#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78806#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78804#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78802#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78800#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78798#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78796#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78794#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78792#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78788#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78786#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78784#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78782#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78780#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78778#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78774#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78772#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78770#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78763#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78764#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78679#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78678#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78677#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78676#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78675#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78674#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78673#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78672#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78671#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78670#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78668#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78667#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78666#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78665#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78664#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78663#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78662#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78661#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78660#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78659#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78658#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78656#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78628#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78655#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78653#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78652#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78651#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78650#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78649#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78648#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78647#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78646#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78645#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78644#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78643#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78642#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78641#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78639#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78638#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78637#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78636#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78635#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78634#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78633#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78632#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78631#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78630#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78627#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78626#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78624#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78629#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78762#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78760#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78759#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78758#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78756#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78754#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78753#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78752#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78750#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78749#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78748#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78746#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78744#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78743#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78742#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78741#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78740#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78738#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78736#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78735#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78734#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78732#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78731#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78730#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78729#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78728#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78726#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78723#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78722#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78720#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78719#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78717#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78716#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78714#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78713#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78712#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78711#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78710#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78709#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78708#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78707#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78706#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78705#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78704#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78703#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78702#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78701#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78700#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78699#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78698#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78697#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78696#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78695#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78694#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78693#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78692#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78691#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78690#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78689#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78688#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78687#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 78686#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78685#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 78684#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 78616#L12-1 [2020-11-29 20:49:34,860 INFO L796 eck$LassoCheckResult]: Loop: 78616#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 78617#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 78616#L12-1 [2020-11-29 20:49:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash -109127424, now seen corresponding path program 39 times [2020-11-29 20:49:34,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:34,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329180475] [2020-11-29 20:49:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 63345 backedges. 29304 proven. 23040 refuted. 0 times theorem prover too weak. 11001 trivial. 0 not checked. [2020-11-29 20:49:35,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329180475] [2020-11-29 20:49:35,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140556644] [2020-11-29 20:49:35,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:49:35,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2020-11-29 20:49:35,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:49:35,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 20:49:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:49:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 63345 backedges. 26868 proven. 1242 refuted. 0 times theorem prover too weak. 35235 trivial. 0 not checked. [2020-11-29 20:49:36,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:49:36,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2020-11-29 20:49:36,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589209531] [2020-11-29 20:49:36,630 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:49:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:36,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 49 times [2020-11-29 20:49:36,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:36,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28873500] [2020-11-29 20:49:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:36,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:36,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:36,633 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:36,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:49:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-29 20:49:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2020-11-29 20:49:36,651 INFO L87 Difference]: Start difference. First operand 732 states and 750 transitions. cyclomatic complexity: 23 Second operand 41 states. [2020-11-29 20:49:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:43,230 INFO L93 Difference]: Finished difference Result 2304 states and 2356 transitions. [2020-11-29 20:49:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2020-11-29 20:49:43,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2304 states and 2356 transitions. [2020-11-29 20:49:43,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:43,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2304 states to 1759 states and 1805 transitions. [2020-11-29 20:49:43,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2020-11-29 20:49:43,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2020-11-29 20:49:43,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1759 states and 1805 transitions. [2020-11-29 20:49:43,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:43,242 INFO L691 BuchiCegarLoop]: Abstraction has 1759 states and 1805 transitions. [2020-11-29 20:49:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states and 1805 transitions. [2020-11-29 20:49:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 962. [2020-11-29 20:49:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2020-11-29 20:49:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 986 transitions. [2020-11-29 20:49:43,254 INFO L714 BuchiCegarLoop]: Abstraction has 962 states and 986 transitions. [2020-11-29 20:49:43,254 INFO L594 BuchiCegarLoop]: Abstraction has 962 states and 986 transitions. [2020-11-29 20:49:43,254 INFO L427 BuchiCegarLoop]: ======== Iteration 54============ [2020-11-29 20:49:43,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 962 states and 986 transitions. [2020-11-29 20:49:43,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:43,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:43,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:43,262 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [208, 208, 188, 20, 1] [2020-11-29 20:49:43,262 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:43,263 INFO L794 eck$LassoCheckResult]: Stem: 83875#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 83876#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83883#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84610#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84609#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84608#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84607#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84606#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84603#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84579#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84574#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84573#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84570#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84569#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84568#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84567#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84564#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84563#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84562#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84561#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84558#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84554#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84552#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84551#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84550#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84549#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84548#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84547#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84546#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84545#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84544#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84543#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84542#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84541#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84540#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84539#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84538#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84537#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84536#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84535#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84534#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84533#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84532#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84531#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84530#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84529#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84528#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84527#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84526#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84525#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84524#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84523#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84522#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84521#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84520#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84519#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84518#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84517#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84516#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84515#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84514#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84513#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84512#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84511#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84510#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84509#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84508#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84507#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84506#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84505#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84504#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84503#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84502#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84501#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84500#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84499#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84498#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84494#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84493#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84492#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84491#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84490#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84489#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84488#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84487#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84486#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84485#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84484#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84483#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84482#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84481#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84480#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84479#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84478#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84477#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84476#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84475#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84474#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84473#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84472#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84471#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84470#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84469#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84468#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84467#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84466#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84465#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84464#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84463#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84462#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84461#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84460#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84459#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84458#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84457#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84456#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84455#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84454#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84453#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84452#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84451#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84450#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84449#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84448#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84447#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84446#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84445#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84444#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84439#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84443#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84441#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84432#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84431#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84430#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84429#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84428#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84427#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84426#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84425#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84424#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84423#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84422#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84421#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84420#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84419#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84418#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84417#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84416#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84415#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84414#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84413#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84412#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84411#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84410#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84409#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84408#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84407#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84406#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84405#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84404#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84403#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84402#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84401#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84400#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84399#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84398#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84397#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84396#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84395#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84394#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84393#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84392#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84391#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84390#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84389#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84388#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84387#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84386#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84381#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84379#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84373#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84361#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84358#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84355#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84352#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84347#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84346#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84343#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84341#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84340#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84339#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84338#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84337#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84336#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84335#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84334#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84332#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84331#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84330#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84329#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84328#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84326#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84324#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84323#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84322#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84321#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84320#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84318#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84317#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84315#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84314#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84312#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84311#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84310#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84309#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84308#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84305#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84304#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84303#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84300#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84299#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84298#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84297#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84296#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84295#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84294#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84293#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84292#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84291#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84290#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84288#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84285#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84282#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84278#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84255#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84253#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84249#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84248#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84240#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84239#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84237#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84236#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84232#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84231#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84230#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84229#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84228#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84225#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84224#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84223#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84222#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84221#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84220#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84219#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84218#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84217#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84215#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84212#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84211#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84210#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84207#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84206#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84161#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84158#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84154#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84148#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84142#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84136#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84130#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84124#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84122#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84118#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84112#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84106#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84100#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84098#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84092#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84080#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84075#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84074#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84072#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84071#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84070#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84069#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84068#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84063#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84059#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84050#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83924#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83922#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83919#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83890#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83915#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83912#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83909#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83906#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83905#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83904#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83903#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83902#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83901#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83900#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83899#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83898#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83897#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83896#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83895#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83894#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83893#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83892#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83891#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83887#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83885#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83888#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84026#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84025#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84024#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84022#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84020#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84016#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84013#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84012#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84007#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84006#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84005#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84004#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84003#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 84002#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 84001#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 84000#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83999#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83998#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83997#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83996#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83995#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83994#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83993#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83992#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83991#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83990#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83989#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83988#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83987#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83985#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83982#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83981#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83980#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83979#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83978#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83977#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83976#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83974#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83973#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83972#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83971#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83970#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83969#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83968#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83967#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83966#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83965#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83963#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83962#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83961#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83960#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83959#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83958#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83957#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83956#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83955#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83954#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83953#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83952#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83951#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83950#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83949#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83948#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83947#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83946#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83945#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83944#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83943#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83942#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83941#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83940#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83939#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83938#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83937#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83936#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83935#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83934#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83933#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83932#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83931#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83930#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83929#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83928#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 83927#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83926#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 83925#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 83877#L12-1 [2020-11-29 20:49:43,263 INFO L796 eck$LassoCheckResult]: Loop: 83877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 83878#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 83877#L12-1 [2020-11-29 20:49:43,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2050240932, now seen corresponding path program 40 times [2020-11-29 20:49:43,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:43,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244796183] [2020-11-29 20:49:43,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:49:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 64584 backedges. 27648 proven. 27756 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2020-11-29 20:49:44,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244796183] [2020-11-29 20:49:44,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196866658] [2020-11-29 20:49:44,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:49:44,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 20:49:44,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:49:44,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-29 20:49:44,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:49:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 64584 backedges. 28590 proven. 27384 refuted. 0 times theorem prover too weak. 8610 trivial. 0 not checked. [2020-11-29 20:49:45,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:49:45,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 41] total 53 [2020-11-29 20:49:45,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848875073] [2020-11-29 20:49:45,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 20:49:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:45,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 50 times [2020-11-29 20:49:45,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:45,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773090771] [2020-11-29 20:49:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:45,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:45,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:45,547 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:45,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:49:45,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2020-11-29 20:49:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2244, Unknown=0, NotChecked=0, Total=2756 [2020-11-29 20:49:45,566 INFO L87 Difference]: Start difference. First operand 962 states and 986 transitions. cyclomatic complexity: 30 Second operand 53 states. [2020-11-29 20:49:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:49:57,049 INFO L93 Difference]: Finished difference Result 1275 states and 1324 transitions. [2020-11-29 20:49:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2020-11-29 20:49:57,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1275 states and 1324 transitions. [2020-11-29 20:49:57,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:57,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1275 states to 1259 states and 1308 transitions. [2020-11-29 20:49:57,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2020-11-29 20:49:57,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2020-11-29 20:49:57,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1259 states and 1308 transitions. [2020-11-29 20:49:57,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 20:49:57,057 INFO L691 BuchiCegarLoop]: Abstraction has 1259 states and 1308 transitions. [2020-11-29 20:49:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states and 1308 transitions. [2020-11-29 20:49:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 636. [2020-11-29 20:49:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-11-29 20:49:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 648 transitions. [2020-11-29 20:49:57,064 INFO L714 BuchiCegarLoop]: Abstraction has 636 states and 648 transitions. [2020-11-29 20:49:57,064 INFO L594 BuchiCegarLoop]: Abstraction has 636 states and 648 transitions. [2020-11-29 20:49:57,064 INFO L427 BuchiCegarLoop]: ======== Iteration 55============ [2020-11-29 20:49:57,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 636 states and 648 transitions. [2020-11-29 20:49:57,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-29 20:49:57,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 20:49:57,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 20:49:57,071 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [210, 210, 190, 20, 1] [2020-11-29 20:49:57,071 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 20:49:57,072 INFO L794 eck$LassoCheckResult]: Stem: 88701#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 88702#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88704#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88706#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 89336#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89335#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89334#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89333#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89332#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89331#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89330#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89329#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89328#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89327#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89326#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89325#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89324#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89323#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89322#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89320#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89319#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89318#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89317#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89316#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89315#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89314#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89313#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89312#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89311#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89310#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89309#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89308#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89307#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89306#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89304#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89303#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89302#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89301#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89300#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89299#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89298#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89297#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89296#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89295#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89294#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89293#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89292#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89291#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89290#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89289#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89288#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89287#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89286#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89285#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89284#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89283#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89282#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89278#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 89277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89255#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89253#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89249#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89248#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89240#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89239#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89237#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89236#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89232#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89231#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89230#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89229#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89228#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89170#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89225#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89223#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89222#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89221#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 89220#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89219#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89218#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89217#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89215#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89212#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89211#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89210#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89207#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89206#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89200#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89195#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89176#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89175#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89174#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89173#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89172#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89119#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89169#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89168#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89167#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 89166#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89165#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89164#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89163#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89162#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89161#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89160#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89159#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89158#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89157#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89155#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89152#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89149#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89147#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89143#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89134#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89133#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89132#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89129#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89120#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89116#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 89115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89098#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89089#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89084#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89080#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89075#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89074#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89070#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89069#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89068#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 89067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89063#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89059#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88984#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89024#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89023#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 89022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89018#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89017#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89014#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89010#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89009#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89005#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89004#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89003#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 89002#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 89001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 89000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88999#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88996#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88993#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88992#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88990#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88989#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88987#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88945#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88981#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88972#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88964#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88963#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88960#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88908#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88946#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88942#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88936#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88930#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88913#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88912#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88909#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88907#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88906#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88905#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88901#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88900#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88899#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88898#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88894#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88893#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88892#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88890#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88888#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88887#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88885#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88883#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88881#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88876#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88875#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88872#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88870#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88865#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88864#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88863#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88862#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88860#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88859#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88858#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88857#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88856#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88853#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88852#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88851#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88850#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88849#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88713#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88741#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88740#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88739#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88738#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88737#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88736#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88735#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88734#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88732#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88731#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88730#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88729#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88728#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88727#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88726#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88725#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88724#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88723#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88722#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88721#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88720#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88719#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88717#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88716#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88715#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88714#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88712#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88710#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88708#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88709#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88711#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88846#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88845#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88844#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88843#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88842#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88841#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88840#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88839#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88838#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88837#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88836#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88835#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88834#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88833#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88832#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88831#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88830#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88829#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88828#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88827#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88826#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88825#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88824#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88823#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88822#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88821#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88820#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88819#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88818#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88817#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88816#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88815#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88814#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88813#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88812#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88811#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88810#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88809#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88808#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88807#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88806#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88805#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88804#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88803#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88802#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88801#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88800#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88799#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88798#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88797#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88796#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88795#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88794#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88793#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88792#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88791#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88790#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88789#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88788#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88787#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88786#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88785#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88784#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88783#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88782#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88781#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88780#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88779#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88778#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88777#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88776#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88775#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88774#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88773#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88772#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88771#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88770#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88769#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88768#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88767#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88766#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88765#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88764#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88763#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88762#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88761#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88760#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88759#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88758#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88757#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88756#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88755#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88754#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88753#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88752#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88751#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88750#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88749#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88748#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88747#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 88746#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88745#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 88742#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 88743#L12-1 [2020-11-29 20:49:57,072 INFO L796 eck$LassoCheckResult]: Loop: 88743#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88744#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 88743#L12-1 [2020-11-29 20:49:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash -397192768, now seen corresponding path program 41 times [2020-11-29 20:49:57,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:57,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883401977] [2020-11-29 20:49:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:57,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:57,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:57,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 51 times [2020-11-29 20:49:57,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:57,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274710631] [2020-11-29 20:49:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:57,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:57,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:57,339 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:49:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:49:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 549839627, now seen corresponding path program 16 times [2020-11-29 20:49:57,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:49:57,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986689103] [2020-11-29 20:49:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:49:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:57,449 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:49:57,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:49:57,595 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:50:56,111 WARN L193 SmtUtils]: Spent 58.34 s on a formula simplification. DAG size of input: 2131 DAG size of output: 667 [2020-11-29 20:50:56,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 08:50:56 BoogieIcfgContainer [2020-11-29 20:50:56,282 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 20:50:56,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:50:56,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:50:56,283 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:50:56,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:47:32" (3/4) ... [2020-11-29 20:50:56,286 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-29 20:50:56,442 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2c51978c-4722-425c-a950-5d2ec435a188/bin/uautomizer/witness.graphml [2020-11-29 20:50:56,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:50:56,443 INFO L168 Benchmark]: Toolchain (without parser) took 204744.35 ms. Allocated memory was 111.1 MB in the beginning and 1.0 GB in the end (delta: 912.3 MB). Free memory was 80.1 MB in the beginning and 734.1 MB in the end (delta: -653.9 MB). Peak memory consumption was 258.9 MB. Max. memory is 16.1 GB. [2020-11-29 20:50:56,443 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 79.7 MB. Free memory was 37.1 MB in the beginning and 37.0 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:50:56,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.75 ms. Allocated memory is still 111.1 MB. Free memory was 79.8 MB in the beginning and 87.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:50:56,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 111.1 MB. Free memory was 87.8 MB in the beginning and 86.9 MB in the end (delta: 920.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:50:56,444 INFO L168 Benchmark]: Boogie Preprocessor took 25.21 ms. Allocated memory is still 111.1 MB. Free memory was 86.9 MB in the beginning and 85.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:50:56,445 INFO L168 Benchmark]: RCFGBuilder took 212.48 ms. Allocated memory is still 111.1 MB. Free memory was 85.7 MB in the beginning and 77.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:50:56,445 INFO L168 Benchmark]: BuchiAutomizer took 204024.62 ms. Allocated memory was 111.1 MB in the beginning and 1.0 GB in the end (delta: 912.3 MB). Free memory was 77.3 MB in the beginning and 751.2 MB in the end (delta: -673.9 MB). Peak memory consumption was 665.9 MB. Max. memory is 16.1 GB. [2020-11-29 20:50:56,446 INFO L168 Benchmark]: Witness Printer took 159.95 ms. Allocated memory is still 1.0 GB. Free memory was 751.2 MB in the beginning and 734.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 20:50:56,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 79.7 MB. Free memory was 37.1 MB in the beginning and 37.0 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 283.75 ms. Allocated memory is still 111.1 MB. Free memory was 79.8 MB in the beginning and 87.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 111.1 MB. Free memory was 87.8 MB in the beginning and 86.9 MB in the end (delta: 920.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.21 ms. Allocated memory is still 111.1 MB. Free memory was 86.9 MB in the beginning and 85.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 212.48 ms. Allocated memory is still 111.1 MB. Free memory was 85.7 MB in the beginning and 77.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 204024.62 ms. Allocated memory was 111.1 MB in the beginning and 1.0 GB in the end (delta: 912.3 MB). Free memory was 77.3 MB in the beginning and 751.2 MB in the end (delta: -673.9 MB). Peak memory consumption was 665.9 MB. Max. memory is 16.1 GB. * Witness Printer took 159.95 ms. Allocated memory is still 1.0 GB. Free memory was 751.2 MB in the beginning and 734.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 55 terminating modules (51 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function range + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * i + range and consists of 3 locations. One deterministic module has affine ranking function range and consists of 4 locations. One nondeterministic module has affine ranking function range + -1 * i and consists of 3 locations. 51 modules have a trivial ranking function, the largest among these consists of 56 locations. The remainder module has 636 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 203.8s and 55 iterations. TraceHistogramMax:210. Analysis of lassos took 107.1s. Construction of modules took 18.5s. Büchi inclusion checks took 77.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 54. Automata minimization 0.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 8847 StatesRemovedByMinimization, 51 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1143 states and ocurred in iteration 47. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 112 SDtfs, 400 SDslu, 3 SDs, 0 SdLazy, 31405 SolverSat, 2532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc3 concLT1 SILN47 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax169 hnf98 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf94 smp79 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {range=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a022173=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] i = __VERIFIER_nondet_int() [L9] range = 20 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND FALSE !(i == range) [L17] i = i+1 [L11] COND TRUE 0 <= i && i <= range [L12] COND TRUE !(0 == i && i == range) [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 Loop: [L11] COND TRUE 0 <= i && i <= range [L12] COND FALSE !(!(0 == i && i == range)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...