./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/string_concat-noarr_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/string_concat-noarr_true-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/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 32bit --witnessprinter.graph.data.programhash 9f3cf63c7adaf3e2c576343bf7deb0d4236e103c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.23-aa41828 [2018-11-23 02:59:07,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:59:07,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:59:07,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:59:07,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:59:07,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:59:07,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:59:07,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:59:07,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:59:07,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:59:07,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:59:07,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:59:07,772 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:59:07,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:59:07,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:59:07,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:59:07,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:59:07,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:59:07,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:59:07,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:59:07,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:59:07,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:59:07,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:59:07,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:59:07,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:59:07,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:59:07,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:59:07,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:59:07,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:59:07,783 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:59:07,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:59:07,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:59:07,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:59:07,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:59:07,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:59:07,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:59:07,785 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 02:59:07,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:59:07,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:59:07,793 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:59:07,793 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:59:07,793 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:59:07,793 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:59:07,793 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:59:07,793 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:59:07,794 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:59:07,794 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:59:07,794 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:59:07,794 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:59:07,794 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:59:07,794 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:59:07,794 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:59:07,795 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:59:07,796 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:59:07,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:59:07,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:59:07,796 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:59:07,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:59:07,796 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:59:07,796 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:59:07,797 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:59:07,797 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f3cf63c7adaf3e2c576343bf7deb0d4236e103c [2018-11-23 02:59:07,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:59:07,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:59:07,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:59:07,828 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:59:07,828 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:59:07,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/string_concat-noarr_true-unreach-call_false-termination.i [2018-11-23 02:59:07,869 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/data/f772674c8/101824f4b8714557b23ed47307537617/FLAG8d512e3e5 [2018-11-23 02:59:08,255 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:59:08,256 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/sv-benchmarks/c/loop-invgen/string_concat-noarr_true-unreach-call_false-termination.i [2018-11-23 02:59:08,259 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/data/f772674c8/101824f4b8714557b23ed47307537617/FLAG8d512e3e5 [2018-11-23 02:59:08,268 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/data/f772674c8/101824f4b8714557b23ed47307537617 [2018-11-23 02:59:08,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:59:08,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:59:08,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:59:08,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:59:08,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:59:08,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d07e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08, skipping insertion in model container [2018-11-23 02:59:08,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:59:08,293 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:59:08,393 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:59:08,395 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:59:08,404 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:59:08,412 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:59:08,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08 WrapperNode [2018-11-23 02:59:08,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:59:08,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:59:08,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:59:08,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:59:08,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:59:08,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:59:08,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:59:08,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:59:08,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... [2018-11-23 02:59:08,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:59:08,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:59:08,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:59:08,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:59:08,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/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 [2018-11-23 02:59:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:59:08,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:59:08,630 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:59:08,630 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 02:59:08,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:59:08 BoogieIcfgContainer [2018-11-23 02:59:08,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:59:08,631 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:59:08,631 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:59:08,634 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:59:08,635 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:59:08,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:59:08" (1/3) ... [2018-11-23 02:59:08,636 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d6bf06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:59:08, skipping insertion in model container [2018-11-23 02:59:08,636 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:59:08,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:59:08" (2/3) ... [2018-11-23 02:59:08,636 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d6bf06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:59:08, skipping insertion in model container [2018-11-23 02:59:08,636 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:59:08,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:59:08" (3/3) ... [2018-11-23 02:59:08,638 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_false-termination.i [2018-11-23 02:59:08,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:59:08,685 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:59:08,685 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:59:08,685 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:59:08,685 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:59:08,685 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:59:08,686 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:59:08,686 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:59:08,686 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:59:08,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 02:59:08,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:08,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:08,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:08,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:59:08,718 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:08,718 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:59:08,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 02:59:08,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:08,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:08,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:08,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:59:08,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:08,724 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 8#L12true main_~i~0 := 0; 13#L15-1true [2018-11-23 02:59:08,724 INFO L796 eck$LassoCheckResult]: Loop: 13#L15-1true assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13#L15-1true [2018-11-23 02:59:08,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash 995, now seen corresponding path program 1 times [2018-11-23 02:59:08,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:08,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:08,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 1 times [2018-11-23 02:59:08,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:08,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:08,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:08,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 30857, now seen corresponding path program 1 times [2018-11-23 02:59:08,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:08,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:08,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:08,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:08,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:08,841 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:59:08,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:59:08,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:59:08,842 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:59:08,842 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:59:08,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:59:08,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:59:08,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:59:08,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_concat-noarr_true-unreach-call_false-termination.i_Iteration1_Loop [2018-11-23 02:59:08,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:59:08,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:59:08,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:59:08,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:59:08,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:59:08,945 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:59:08,946 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:59:08,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:59:08,949 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/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 [2018-11-23 02:59:08,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:59:08,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:59:08,982 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:59:08,983 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:59:08,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:59:08,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:59:08,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:59:08,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:59:08,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:59:08,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:59:08,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:59:08,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_concat-noarr_true-unreach-call_false-termination.i_Iteration1_Loop [2018-11-23 02:59:08,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:59:08,984 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:59:08,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:59:08,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:59:08,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:59:09,039 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:59:09,043 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:59:09,044 INFO L122 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 [2018-11-23 02:59:09,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:59:09,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:59:09,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:59:09,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:59:09,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:59:09,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:59:09,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:59:09,054 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:59:09,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:59:09,059 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:59:09,060 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:59:09,061 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:59:09,061 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:59:09,062 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1999999 Supporting invariants [] [2018-11-23 02:59:09,063 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:59:09,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,132 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 02:59:09,132 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 2 states. [2018-11-23 02:59:09,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 2 states. Result 36 states and 55 transitions. Complement of second has 5 states. [2018-11-23 02:59:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 02:59:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 02:59:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-23 02:59:09,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 1 letters. [2018-11-23 02:59:09,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:59:09,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 1 letters. [2018-11-23 02:59:09,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:59:09,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 02:59:09,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:59:09,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 55 transitions. [2018-11-23 02:59:09,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 12 states and 18 transitions. [2018-11-23 02:59:09,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:09,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 02:59:09,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-11-23 02:59:09,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,177 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 02:59:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-11-23 02:59:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 02:59:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 02:59:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-11-23 02:59:09,193 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2018-11-23 02:59:09,193 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2018-11-23 02:59:09,193 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:59:09,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2018-11-23 02:59:09,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 02:59:09,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,194 INFO L794 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 82#L12 main_~i~0 := 0; 83#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 84#L15-2 assume main_~i~0 >= 100; 85#L25 [2018-11-23 02:59:09,194 INFO L796 eck$LassoCheckResult]: Loop: 85#L25 assume true; 85#L25 [2018-11-23 02:59:09,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash 956523, now seen corresponding path program 1 times [2018-11-23 02:59:09,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:59:09,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:59:09,224 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2018-11-23 02:59:09,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:59:09,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:59:09,230 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 02:59:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,242 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-11-23 02:59:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:59:09,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-11-23 02:59:09,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-23 02:59:09,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2018-11-23 02:59:09,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 02:59:09,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 02:59:09,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-23 02:59:09,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,244 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 02:59:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-23 02:59:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-11-23 02:59:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 02:59:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-11-23 02:59:09,245 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 02:59:09,245 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 02:59:09,245 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:59:09,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2018-11-23 02:59:09,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,246 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:59:09,246 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,246 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 116#L12 main_~i~0 := 0; 117#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 124#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 125#L15-2 assume main_~i~0 >= 100; 123#L25 [2018-11-23 02:59:09,246 INFO L796 eck$LassoCheckResult]: Loop: 123#L25 assume true; 123#L25 [2018-11-23 02:59:09,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,247 INFO L82 PathProgramCache]: Analyzing trace with hash 29653905, now seen corresponding path program 1 times [2018-11-23 02:59:09,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-23 02:59:09,294 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 2 times [2018-11-23 02:59:09,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:59:09,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:59:09,303 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 02:59:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,320 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-11-23 02:59:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:59:09,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-11-23 02:59:09,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:09,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2018-11-23 02:59:09,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 02:59:09,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 02:59:09,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-23 02:59:09,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,322 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-23 02:59:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-23 02:59:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 13. [2018-11-23 02:59:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:59:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-11-23 02:59:09,323 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2018-11-23 02:59:09,323 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2018-11-23 02:59:09,324 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:59:09,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2018-11-23 02:59:09,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:59:09,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,325 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 172#L12 main_~i~0 := 0; 173#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 174#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 175#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 178#L21-2 assume main_~j~0 >= 100; 179#L25 [2018-11-23 02:59:09,325 INFO L796 eck$LassoCheckResult]: Loop: 179#L25 assume true; 179#L25 [2018-11-23 02:59:09,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash 919222390, now seen corresponding path program 1 times [2018-11-23 02:59:09,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:59:09,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:59:09,334 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 3 times [2018-11-23 02:59:09,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:59:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:59:09,337 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 02:59:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,341 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2018-11-23 02:59:09,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:59:09,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2018-11-23 02:59:09,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 11 states and 16 transitions. [2018-11-23 02:59:09,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:09,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:09,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-23 02:59:09,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,342 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 02:59:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-23 02:59:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 02:59:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 02:59:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-23 02:59:09,344 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 02:59:09,344 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 02:59:09,344 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:59:09,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-23 02:59:09,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,344 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-23 02:59:09,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,345 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 205#L12 main_~i~0 := 0; 206#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 212#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 213#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 207#L15-2 assume main_~i~0 >= 100; 208#L25 [2018-11-23 02:59:09,345 INFO L796 eck$LassoCheckResult]: Loop: 208#L25 assume true; 208#L25 [2018-11-23 02:59:09,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 919272747, now seen corresponding path program 2 times [2018-11-23 02:59:09,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:09,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:09,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:09,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 02:59:09,428 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,428 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 4 times [2018-11-23 02:59:09,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:59:09,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:59:09,431 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 02:59:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,456 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-11-23 02:59:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:59:09,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2018-11-23 02:59:09,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:09,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 32 transitions. [2018-11-23 02:59:09,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:09,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:09,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-11-23 02:59:09,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,458 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 02:59:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-11-23 02:59:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 12. [2018-11-23 02:59:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 02:59:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-11-23 02:59:09,459 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 02:59:09,459 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 02:59:09,459 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:59:09,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2018-11-23 02:59:09,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:09,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,461 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 264#L12 main_~i~0 := 0; 265#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 268#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 269#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 273#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 270#L21-2 assume main_~j~0 >= 100; 267#L25 [2018-11-23 02:59:09,461 INFO L796 eck$LassoCheckResult]: Loop: 267#L25 assume true; 267#L25 [2018-11-23 02:59:09,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1568875272, now seen corresponding path program 1 times [2018-11-23 02:59:09,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-23 02:59:09,496 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,497 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 5 times [2018-11-23 02:59:09,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:59:09,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:59:09,501 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 02:59:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,506 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-11-23 02:59:09,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:59:09,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2018-11-23 02:59:09,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 19 transitions. [2018-11-23 02:59:09,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:09,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:09,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-23 02:59:09,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,507 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-23 02:59:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-23 02:59:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 02:59:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:59:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-11-23 02:59:09,509 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-23 02:59:09,509 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-23 02:59:09,509 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:59:09,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2018-11-23 02:59:09,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2018-11-23 02:59:09,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,510 INFO L794 eck$LassoCheckResult]: Stem: 314#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 315#L12 main_~i~0 := 0; 316#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 322#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 323#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 326#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 317#L15-2 assume main_~i~0 >= 100; 318#L25 [2018-11-23 02:59:09,510 INFO L796 eck$LassoCheckResult]: Loop: 318#L25 assume true; 318#L25 [2018-11-23 02:59:09,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1567314223, now seen corresponding path program 3 times [2018-11-23 02:59:09,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:09,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:59:09,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:09,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 02:59:09,557 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 6 times [2018-11-23 02:59:09,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:59:09,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:59:09,561 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-23 02:59:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,597 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-23 02:59:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:59:09,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2018-11-23 02:59:09,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:09,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 40 transitions. [2018-11-23 02:59:09,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:09,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:09,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-23 02:59:09,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,599 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-23 02:59:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-23 02:59:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 14. [2018-11-23 02:59:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 02:59:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-11-23 02:59:09,603 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2018-11-23 02:59:09,603 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2018-11-23 02:59:09,603 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 02:59:09,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2018-11-23 02:59:09,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:09,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,605 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 387#L12 main_~i~0 := 0; 388#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 391#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 392#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 396#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 399#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 393#L21-2 assume main_~j~0 >= 100; 390#L25 [2018-11-23 02:59:09,605 INFO L796 eck$LassoCheckResult]: Loop: 390#L25 assume true; 390#L25 [2018-11-23 02:59:09,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1390491466, now seen corresponding path program 2 times [2018-11-23 02:59:09,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:09,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:09,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:09,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 02:59:09,678 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 7 times [2018-11-23 02:59:09,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:59:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:59:09,686 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 02:59:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,692 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2018-11-23 02:59:09,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:59:09,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2018-11-23 02:59:09,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 22 transitions. [2018-11-23 02:59:09,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:09,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:09,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2018-11-23 02:59:09,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,694 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-23 02:59:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2018-11-23 02:59:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 02:59:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 02:59:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-11-23 02:59:09,696 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-23 02:59:09,696 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-23 02:59:09,696 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 02:59:09,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2018-11-23 02:59:09,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2018-11-23 02:59:09,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,697 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 446#L12 main_~i~0 := 0; 447#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 453#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 454#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 459#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 457#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 448#L15-2 assume main_~i~0 >= 100; 449#L25 [2018-11-23 02:59:09,697 INFO L796 eck$LassoCheckResult]: Loop: 449#L25 assume true; 449#L25 [2018-11-23 02:59:09,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1342098965, now seen corresponding path program 4 times [2018-11-23 02:59:09,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:09,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:09,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:09,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 02:59:09,768 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,769 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 8 times [2018-11-23 02:59:09,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:59:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:59:09,772 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-23 02:59:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,801 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-11-23 02:59:09,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:59:09,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2018-11-23 02:59:09,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:09,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 49 transitions. [2018-11-23 02:59:09,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:09,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:09,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2018-11-23 02:59:09,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,803 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 02:59:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2018-11-23 02:59:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 16. [2018-11-23 02:59:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 02:59:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-11-23 02:59:09,805 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-23 02:59:09,805 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-23 02:59:09,805 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 02:59:09,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-11-23 02:59:09,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:09,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,806 INFO L794 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 532#L12 main_~i~0 := 0; 533#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 536#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 537#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 541#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 546#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 545#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 538#L21-2 assume main_~j~0 >= 100; 535#L25 [2018-11-23 02:59:09,806 INFO L796 eck$LassoCheckResult]: Loop: 535#L25 assume true; 535#L25 [2018-11-23 02:59:09,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,807 INFO L82 PathProgramCache]: Analyzing trace with hash -155560776, now seen corresponding path program 3 times [2018-11-23 02:59:09,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:09,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:59:09,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:09,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 02:59:09,872 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 9 times [2018-11-23 02:59:09,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:59:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:59:09,876 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-23 02:59:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:09,884 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2018-11-23 02:59:09,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:59:09,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2018-11-23 02:59:09,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 25 transitions. [2018-11-23 02:59:09,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:09,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:09,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2018-11-23 02:59:09,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:09,886 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 02:59:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2018-11-23 02:59:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 02:59:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 02:59:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-11-23 02:59:09,889 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 02:59:09,889 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 02:59:09,889 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 02:59:09,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2018-11-23 02:59:09,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:09,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:09,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:09,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1] [2018-11-23 02:59:09,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:09,890 INFO L794 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 599#L12 main_~i~0 := 0; 600#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 606#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 607#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 614#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 612#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 610#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 601#L15-2 assume main_~i~0 >= 100; 602#L25 [2018-11-23 02:59:09,890 INFO L796 eck$LassoCheckResult]: Loop: 602#L25 assume true; 602#L25 [2018-11-23 02:59:09,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1344606737, now seen corresponding path program 5 times [2018-11-23 02:59:09,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:09,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:09,943 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 02:59:09,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:09,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:09,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:09,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 02:59:09,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:09,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 10 times [2018-11-23 02:59:09,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:09,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:59:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:59:09,965 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-23 02:59:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,002 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 02:59:10,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:59:10,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2018-11-23 02:59:10,003 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:10,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 59 transitions. [2018-11-23 02:59:10,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:10,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:10,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 59 transitions. [2018-11-23 02:59:10,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,004 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 02:59:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 59 transitions. [2018-11-23 02:59:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 18. [2018-11-23 02:59:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 02:59:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2018-11-23 02:59:10,006 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-23 02:59:10,006 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-23 02:59:10,006 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 02:59:10,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2018-11-23 02:59:10,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:10,006 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,007 INFO L794 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 700#L12 main_~i~0 := 0; 701#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 704#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 705#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 709#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 716#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 715#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 714#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 706#L21-2 assume main_~j~0 >= 100; 703#L25 [2018-11-23 02:59:10,007 INFO L796 eck$LassoCheckResult]: Loop: 703#L25 assume true; 703#L25 [2018-11-23 02:59:10,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash -527415050, now seen corresponding path program 4 times [2018-11-23 02:59:10,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:10,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:10,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:10,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 02:59:10,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 11 times [2018-11-23 02:59:10,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:59:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:59:10,068 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 02:59:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,084 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2018-11-23 02:59:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:59:10,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2018-11-23 02:59:10,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 28 transitions. [2018-11-23 02:59:10,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:10,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:10,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-11-23 02:59:10,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,085 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-23 02:59:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-11-23 02:59:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 02:59:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 02:59:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-11-23 02:59:10,086 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-23 02:59:10,086 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-23 02:59:10,086 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 02:59:10,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-11-23 02:59:10,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,086 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1] [2018-11-23 02:59:10,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,087 INFO L794 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 775#L12 main_~i~0 := 0; 776#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 782#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 783#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 792#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 790#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 788#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 786#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 777#L15-2 assume main_~i~0 >= 100; 778#L25 [2018-11-23 02:59:10,087 INFO L796 eck$LassoCheckResult]: Loop: 778#L25 assume true; 778#L25 [2018-11-23 02:59:10,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1266862421, now seen corresponding path program 6 times [2018-11-23 02:59:10,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,146 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:10,153 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 02:59:10,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:10,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 02:59:10,180 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,180 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 12 times [2018-11-23 02:59:10,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:59:10,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:59:10,188 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-23 02:59:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,244 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 02:59:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:59:10,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2018-11-23 02:59:10,245 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:10,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 58 states and 70 transitions. [2018-11-23 02:59:10,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:10,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:10,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 70 transitions. [2018-11-23 02:59:10,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,246 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-11-23 02:59:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 70 transitions. [2018-11-23 02:59:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 20. [2018-11-23 02:59:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:59:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-11-23 02:59:10,248 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-23 02:59:10,248 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-23 02:59:10,248 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 02:59:10,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2018-11-23 02:59:10,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:10,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,253 INFO L794 eck$LassoCheckResult]: Stem: 891#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 892#L12 main_~i~0 := 0; 893#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 896#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 897#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 901#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 910#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 909#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 908#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 907#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 898#L21-2 assume main_~j~0 >= 100; 895#L25 [2018-11-23 02:59:10,253 INFO L796 eck$LassoCheckResult]: Loop: 895#L25 assume true; 895#L25 [2018-11-23 02:59:10,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 830004344, now seen corresponding path program 5 times [2018-11-23 02:59:10,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,292 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:10,303 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 02:59:10,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:10,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 02:59:10,324 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,324 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 13 times [2018-11-23 02:59:10,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:59:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:59:10,330 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-23 02:59:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,346 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2018-11-23 02:59:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:59:10,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 32 transitions. [2018-11-23 02:59:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 31 transitions. [2018-11-23 02:59:10,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:10,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:10,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2018-11-23 02:59:10,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,348 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-23 02:59:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2018-11-23 02:59:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 02:59:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 02:59:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-23 02:59:10,350 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-23 02:59:10,350 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-23 02:59:10,350 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 02:59:10,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2018-11-23 02:59:10,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1] [2018-11-23 02:59:10,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,351 INFO L794 eck$LassoCheckResult]: Stem: 974#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 975#L12 main_~i~0 := 0; 976#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 982#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 983#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 994#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 992#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 990#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 988#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 986#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 977#L15-2 assume main_~i~0 >= 100; 978#L25 [2018-11-23 02:59:10,353 INFO L796 eck$LassoCheckResult]: Loop: 978#L25 assume true; 978#L25 [2018-11-23 02:59:10,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash -618027695, now seen corresponding path program 7 times [2018-11-23 02:59:10,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:10,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 02:59:10,455 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,455 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 14 times [2018-11-23 02:59:10,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:59:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:59:10,461 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 13 Second operand 10 states. [2018-11-23 02:59:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,499 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-23 02:59:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:59:10,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 83 transitions. [2018-11-23 02:59:10,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:10,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 82 transitions. [2018-11-23 02:59:10,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:10,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:10,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2018-11-23 02:59:10,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,501 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-11-23 02:59:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2018-11-23 02:59:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 22. [2018-11-23 02:59:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 02:59:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2018-11-23 02:59:10,504 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2018-11-23 02:59:10,504 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2018-11-23 02:59:10,504 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 02:59:10,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. [2018-11-23 02:59:10,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:10,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,505 INFO L794 eck$LassoCheckResult]: Stem: 1108#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 1109#L12 main_~i~0 := 0; 1110#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 1113#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 1114#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1118#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1129#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1128#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1127#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1126#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1125#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 1115#L21-2 assume main_~j~0 >= 100; 1112#L25 [2018-11-23 02:59:10,505 INFO L796 eck$LassoCheckResult]: Loop: 1112#L25 assume true; 1112#L25 [2018-11-23 02:59:10,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash -39667402, now seen corresponding path program 6 times [2018-11-23 02:59:10,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,572 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:10,579 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 02:59:10,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:10,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 02:59:10,608 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 15 times [2018-11-23 02:59:10,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:59:10,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:59:10,612 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-23 02:59:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,654 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2018-11-23 02:59:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:59:10,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2018-11-23 02:59:10,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 34 transitions. [2018-11-23 02:59:10,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:10,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:10,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. [2018-11-23 02:59:10,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,656 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2018-11-23 02:59:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. [2018-11-23 02:59:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 02:59:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 02:59:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2018-11-23 02:59:10,657 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2018-11-23 02:59:10,658 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2018-11-23 02:59:10,658 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 02:59:10,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 34 transitions. [2018-11-23 02:59:10,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1] [2018-11-23 02:59:10,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,659 INFO L794 eck$LassoCheckResult]: Stem: 1199#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 1200#L12 main_~i~0 := 0; 1201#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1208#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1221#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1219#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1217#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1215#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1213#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1211#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 1202#L15-2 assume main_~i~0 >= 100; 1203#L25 [2018-11-23 02:59:10,659 INFO L796 eck$LassoCheckResult]: Loop: 1203#L25 assume true; 1203#L25 [2018-11-23 02:59:10,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987669, now seen corresponding path program 8 times [2018-11-23 02:59:10,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:10,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:10,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:10,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 02:59:10,740 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,740 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 16 times [2018-11-23 02:59:10,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:59:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:59:10,743 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. cyclomatic complexity: 14 Second operand 11 states. [2018-11-23 02:59:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,784 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-23 02:59:10,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:59:10,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2018-11-23 02:59:10,785 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:10,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 81 states and 95 transitions. [2018-11-23 02:59:10,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:10,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:10,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 95 transitions. [2018-11-23 02:59:10,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,786 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 95 transitions. [2018-11-23 02:59:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 95 transitions. [2018-11-23 02:59:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 24. [2018-11-23 02:59:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 02:59:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-23 02:59:10,787 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2018-11-23 02:59:10,787 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2018-11-23 02:59:10,787 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 02:59:10,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2018-11-23 02:59:10,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,787 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:10,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,787 INFO L794 eck$LassoCheckResult]: Stem: 1351#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 1352#L12 main_~i~0 := 0; 1353#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 1356#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 1357#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1361#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1374#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1373#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1372#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1371#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1370#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1369#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 1358#L21-2 assume main_~j~0 >= 100; 1355#L25 [2018-11-23 02:59:10,787 INFO L796 eck$LassoCheckResult]: Loop: 1355#L25 assume true; 1355#L25 [2018-11-23 02:59:10,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1229687752, now seen corresponding path program 7 times [2018-11-23 02:59:10,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 02:59:10,853 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 17 times [2018-11-23 02:59:10,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:59:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:59:10,856 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 10 states. [2018-11-23 02:59:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:10,866 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2018-11-23 02:59:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:59:10,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. [2018-11-23 02:59:10,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 37 transitions. [2018-11-23 02:59:10,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:10,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:10,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 37 transitions. [2018-11-23 02:59:10,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:10,867 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 37 transitions. [2018-11-23 02:59:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 37 transitions. [2018-11-23 02:59:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 02:59:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 02:59:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-23 02:59:10,868 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 37 transitions. [2018-11-23 02:59:10,868 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 37 transitions. [2018-11-23 02:59:10,868 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 02:59:10,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 37 transitions. [2018-11-23 02:59:10,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:10,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:10,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:10,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 1, 1, 1, 1] [2018-11-23 02:59:10,868 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:10,868 INFO L794 eck$LassoCheckResult]: Stem: 1450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 1451#L12 main_~i~0 := 0; 1452#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1458#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1459#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1474#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1472#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1470#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1468#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1466#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1464#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1462#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 1453#L15-2 assume main_~i~0 >= 100; 1454#L25 [2018-11-23 02:59:10,869 INFO L796 eck$LassoCheckResult]: Loop: 1454#L25 assume true; 1454#L25 [2018-11-23 02:59:10,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1219073903, now seen corresponding path program 9 times [2018-11-23 02:59:10,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:10,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:10,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:10,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 02:59:10,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:10,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 02:59:10,958 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:10,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 18 times [2018-11-23 02:59:10,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:10,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:10,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:59:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:59:10,962 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. cyclomatic complexity: 15 Second operand 12 states. [2018-11-23 02:59:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:11,008 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-11-23 02:59:11,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:59:11,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 110 transitions. [2018-11-23 02:59:11,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:11,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 94 states and 109 transitions. [2018-11-23 02:59:11,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:11,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:11,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2018-11-23 02:59:11,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:11,010 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2018-11-23 02:59:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2018-11-23 02:59:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 26. [2018-11-23 02:59:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 02:59:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2018-11-23 02:59:11,012 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2018-11-23 02:59:11,012 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2018-11-23 02:59:11,012 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 02:59:11,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 39 transitions. [2018-11-23 02:59:11,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:11,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:11,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:11,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:11,013 INFO L794 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 1622#L12 main_~i~0 := 0; 1623#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 1626#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 1627#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1631#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1646#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1645#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1644#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1643#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1642#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1641#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1640#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 1628#L21-2 assume main_~j~0 >= 100; 1625#L25 [2018-11-23 02:59:11,013 INFO L796 eck$LassoCheckResult]: Loop: 1625#L25 assume true; 1625#L25 [2018-11-23 02:59:11,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 534387062, now seen corresponding path program 8 times [2018-11-23 02:59:11,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:11,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:11,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:11,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:11,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:11,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:11,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 02:59:11,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:11,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 19 times [2018-11-23 02:59:11,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:59:11,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:59:11,106 INFO L87 Difference]: Start difference. First operand 26 states and 39 transitions. cyclomatic complexity: 16 Second operand 11 states. [2018-11-23 02:59:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:11,123 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2018-11-23 02:59:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:59:11,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2018-11-23 02:59:11,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 40 transitions. [2018-11-23 02:59:11,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:11,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:11,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 40 transitions. [2018-11-23 02:59:11,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:11,124 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2018-11-23 02:59:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 40 transitions. [2018-11-23 02:59:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 02:59:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 02:59:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2018-11-23 02:59:11,125 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2018-11-23 02:59:11,126 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2018-11-23 02:59:11,126 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 02:59:11,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2018-11-23 02:59:11,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:11,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:11,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1] [2018-11-23 02:59:11,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:11,127 INFO L794 eck$LassoCheckResult]: Stem: 1728#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 1729#L12 main_~i~0 := 0; 1730#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1736#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1737#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1754#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1752#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1750#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1748#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1746#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1744#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1742#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1740#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 1731#L15-2 assume main_~i~0 >= 100; 1732#L25 [2018-11-23 02:59:11,127 INFO L796 eck$LassoCheckResult]: Loop: 1732#L25 assume true; 1732#L25 [2018-11-23 02:59:11,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 863416363, now seen corresponding path program 10 times [2018-11-23 02:59:11,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:11,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:11,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:11,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:11,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:11,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 02:59:11,217 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:11,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 20 times [2018-11-23 02:59:11,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:59:11,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:59:11,221 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 16 Second operand 13 states. [2018-11-23 02:59:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:11,273 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-11-23 02:59:11,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:59:11,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 125 transitions. [2018-11-23 02:59:11,274 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:11,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 108 states and 124 transitions. [2018-11-23 02:59:11,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:11,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:11,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 124 transitions. [2018-11-23 02:59:11,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:11,278 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-11-23 02:59:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 124 transitions. [2018-11-23 02:59:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 28. [2018-11-23 02:59:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 02:59:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2018-11-23 02:59:11,279 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-23 02:59:11,280 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-23 02:59:11,280 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 02:59:11,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2018-11-23 02:59:11,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:11,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:11,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:11,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:11,281 INFO L794 eck$LassoCheckResult]: Stem: 1919#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 1920#L12 main_~i~0 := 0; 1921#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 1924#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 1925#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1929#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1946#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1945#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1944#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1943#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1942#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1941#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1940#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1939#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 1926#L21-2 assume main_~j~0 >= 100; 1923#L25 [2018-11-23 02:59:11,281 INFO L796 eck$LassoCheckResult]: Loop: 1923#L25 assume true; 1923#L25 [2018-11-23 02:59:11,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash -613868552, now seen corresponding path program 9 times [2018-11-23 02:59:11,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:11,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:11,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:11,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 02:59:11,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:11,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:11,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 02:59:11,409 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:11,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 21 times [2018-11-23 02:59:11,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:59:11,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:59:11,413 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-23 02:59:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:11,425 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2018-11-23 02:59:11,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:59:11,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2018-11-23 02:59:11,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 43 transitions. [2018-11-23 02:59:11,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:11,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:11,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2018-11-23 02:59:11,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:11,426 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-23 02:59:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2018-11-23 02:59:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 02:59:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 02:59:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-11-23 02:59:11,427 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-23 02:59:11,427 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-23 02:59:11,427 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 02:59:11,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2018-11-23 02:59:11,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:11,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:11,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 1, 1, 1, 1] [2018-11-23 02:59:11,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:11,427 INFO L794 eck$LassoCheckResult]: Stem: 2034#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 2035#L12 main_~i~0 := 0; 2036#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2042#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2043#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2062#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2060#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2058#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2056#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2054#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2052#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2050#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2048#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2046#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 2037#L15-2 assume main_~i~0 >= 100; 2038#L25 [2018-11-23 02:59:11,427 INFO L796 eck$LassoCheckResult]: Loop: 2038#L25 assume true; 2038#L25 [2018-11-23 02:59:11,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash 996105169, now seen corresponding path program 11 times [2018-11-23 02:59:11,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:11,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:11,493 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:11,499 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 02:59:11,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:11,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:11,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 02:59:11,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:11,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 22 times [2018-11-23 02:59:11,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:59:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:59:11,521 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 17 Second operand 14 states. [2018-11-23 02:59:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:11,604 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2018-11-23 02:59:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 02:59:11,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 141 transitions. [2018-11-23 02:59:11,605 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:11,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 123 states and 140 transitions. [2018-11-23 02:59:11,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:11,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:11,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 140 transitions. [2018-11-23 02:59:11,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:11,606 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 140 transitions. [2018-11-23 02:59:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 140 transitions. [2018-11-23 02:59:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 30. [2018-11-23 02:59:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 02:59:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2018-11-23 02:59:11,608 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-23 02:59:11,608 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-23 02:59:11,608 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 02:59:11,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 45 transitions. [2018-11-23 02:59:11,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:11,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:11,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:11,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:11,612 INFO L794 eck$LassoCheckResult]: Stem: 2246#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 2247#L12 main_~i~0 := 0; 2248#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 2251#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 2252#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2256#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2275#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2274#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2273#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2272#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2271#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2270#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2269#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2268#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2267#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 2253#L21-2 assume main_~j~0 >= 100; 2250#L25 [2018-11-23 02:59:11,612 INFO L796 eck$LassoCheckResult]: Loop: 2250#L25 assume true; 2250#L25 [2018-11-23 02:59:11,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1850054218, now seen corresponding path program 10 times [2018-11-23 02:59:11,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:11,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:11,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:11,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:11,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:11,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:11,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 02:59:11,701 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:11,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 23 times [2018-11-23 02:59:11,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:59:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:59:11,706 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. cyclomatic complexity: 18 Second operand 13 states. [2018-11-23 02:59:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:11,713 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2018-11-23 02:59:11,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:59:11,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2018-11-23 02:59:11,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 46 transitions. [2018-11-23 02:59:11,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:11,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:11,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2018-11-23 02:59:11,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:11,715 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-23 02:59:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2018-11-23 02:59:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 02:59:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 02:59:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2018-11-23 02:59:11,716 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-23 02:59:11,716 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2018-11-23 02:59:11,716 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-23 02:59:11,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 46 transitions. [2018-11-23 02:59:11,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:11,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:11,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 1, 1, 1, 1] [2018-11-23 02:59:11,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:11,717 INFO L794 eck$LassoCheckResult]: Stem: 2369#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 2370#L12 main_~i~0 := 0; 2371#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2377#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2378#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2399#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2397#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2395#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2393#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2391#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2389#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2387#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2385#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2383#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2381#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 2372#L15-2 assume main_~i~0 >= 100; 2373#L25 [2018-11-23 02:59:11,717 INFO L796 eck$LassoCheckResult]: Loop: 2373#L25 assume true; 2373#L25 [2018-11-23 02:59:11,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash 814490859, now seen corresponding path program 12 times [2018-11-23 02:59:11,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:11,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:11,791 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:11,824 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 02:59:11,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:11,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:11,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:11,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 02:59:11,852 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:11,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,852 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 24 times [2018-11-23 02:59:11,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 02:59:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:59:11,857 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. cyclomatic complexity: 18 Second operand 15 states. [2018-11-23 02:59:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:11,948 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2018-11-23 02:59:11,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:59:11,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 158 transitions. [2018-11-23 02:59:11,949 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:11,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 139 states and 157 transitions. [2018-11-23 02:59:11,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:11,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:11,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 157 transitions. [2018-11-23 02:59:11,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:11,950 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-11-23 02:59:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 157 transitions. [2018-11-23 02:59:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 32. [2018-11-23 02:59:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 02:59:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2018-11-23 02:59:11,951 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 48 transitions. [2018-11-23 02:59:11,951 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 48 transitions. [2018-11-23 02:59:11,951 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-23 02:59:11,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 48 transitions. [2018-11-23 02:59:11,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:11,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:11,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:11,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:11,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:11,952 INFO L794 eck$LassoCheckResult]: Stem: 2603#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 2604#L12 main_~i~0 := 0; 2605#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 2608#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 2609#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2613#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2634#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2633#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2632#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2631#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2630#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2629#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2628#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2627#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2626#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2625#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 2610#L21-2 assume main_~j~0 >= 100; 2607#L25 [2018-11-23 02:59:11,952 INFO L796 eck$LassoCheckResult]: Loop: 2607#L25 assume true; 2607#L25 [2018-11-23 02:59:11,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1517104200, now seen corresponding path program 11 times [2018-11-23 02:59:11,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:11,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:12,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:12,040 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:12,050 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 02:59:12,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:12,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:12,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 02:59:12,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:12,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 25 times [2018-11-23 02:59:12,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:59:12,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:59:12,074 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. cyclomatic complexity: 19 Second operand 14 states. [2018-11-23 02:59:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:12,089 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2018-11-23 02:59:12,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 02:59:12,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2018-11-23 02:59:12,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 49 transitions. [2018-11-23 02:59:12,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:12,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:12,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 49 transitions. [2018-11-23 02:59:12,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:12,090 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-23 02:59:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 49 transitions. [2018-11-23 02:59:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 02:59:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:59:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-23 02:59:12,092 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-23 02:59:12,092 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-23 02:59:12,092 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-23 02:59:12,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2018-11-23 02:59:12,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:12,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:12,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 1, 1, 1, 1] [2018-11-23 02:59:12,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:12,093 INFO L794 eck$LassoCheckResult]: Stem: 2734#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 2735#L12 main_~i~0 := 0; 2736#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2742#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2743#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2766#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2764#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2762#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2760#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2758#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2756#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2754#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2752#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2750#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2748#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 2746#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 2737#L15-2 assume main_~i~0 >= 100; 2738#L25 [2018-11-23 02:59:12,093 INFO L796 eck$LassoCheckResult]: Loop: 2738#L25 assume true; 2738#L25 [2018-11-23 02:59:12,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -520585455, now seen corresponding path program 13 times [2018-11-23 02:59:12,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:12,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:12,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:12,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 02:59:12,225 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:12,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 26 times [2018-11-23 02:59:12,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:59:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:59:12,230 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 19 Second operand 16 states. [2018-11-23 02:59:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:12,293 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2018-11-23 02:59:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 02:59:12,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 176 transitions. [2018-11-23 02:59:12,294 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:12,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 156 states and 175 transitions. [2018-11-23 02:59:12,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:12,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:12,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 175 transitions. [2018-11-23 02:59:12,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:12,295 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 175 transitions. [2018-11-23 02:59:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 175 transitions. [2018-11-23 02:59:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 34. [2018-11-23 02:59:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:59:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2018-11-23 02:59:12,305 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. [2018-11-23 02:59:12,305 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. [2018-11-23 02:59:12,305 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-23 02:59:12,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 51 transitions. [2018-11-23 02:59:12,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:12,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:12,306 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:12,306 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:12,306 INFO L794 eck$LassoCheckResult]: Stem: 2991#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 2992#L12 main_~i~0 := 0; 2993#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 2996#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 2997#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3001#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3024#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3023#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3022#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3021#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3020#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3019#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3018#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3017#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3016#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3015#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3014#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 2998#L21-2 assume main_~j~0 >= 100; 2995#L25 [2018-11-23 02:59:12,306 INFO L796 eck$LassoCheckResult]: Loop: 2995#L25 assume true; 2995#L25 [2018-11-23 02:59:12,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 214411766, now seen corresponding path program 12 times [2018-11-23 02:59:12,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:12,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:12,396 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:12,405 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 02:59:12,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:12,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:12,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 02:59:12,426 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:12,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 27 times [2018-11-23 02:59:12,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 02:59:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:59:12,431 INFO L87 Difference]: Start difference. First operand 34 states and 51 transitions. cyclomatic complexity: 20 Second operand 15 states. [2018-11-23 02:59:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:12,454 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2018-11-23 02:59:12,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:59:12,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 53 transitions. [2018-11-23 02:59:12,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 52 transitions. [2018-11-23 02:59:12,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:12,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:12,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 52 transitions. [2018-11-23 02:59:12,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:12,457 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-11-23 02:59:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 52 transitions. [2018-11-23 02:59:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 02:59:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 02:59:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2018-11-23 02:59:12,458 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-11-23 02:59:12,458 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-11-23 02:59:12,458 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-23 02:59:12,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 52 transitions. [2018-11-23 02:59:12,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:12,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:12,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 1, 1, 1, 1] [2018-11-23 02:59:12,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:12,459 INFO L794 eck$LassoCheckResult]: Stem: 3130#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 3131#L12 main_~i~0 := 0; 3132#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3138#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3139#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3164#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3162#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3160#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3158#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3156#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3154#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3152#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3150#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3148#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3146#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3144#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3142#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 3133#L15-2 assume main_~i~0 >= 100; 3134#L25 [2018-11-23 02:59:12,459 INFO L796 eck$LassoCheckResult]: Loop: 3134#L25 assume true; 3134#L25 [2018-11-23 02:59:12,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1041721771, now seen corresponding path program 14 times [2018-11-23 02:59:12,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:12,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:12,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:12,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:12,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:12,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:12,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 02:59:12,602 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:12,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,602 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 28 times [2018-11-23 02:59:12,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:59:12,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:59:12,611 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. cyclomatic complexity: 20 Second operand 17 states. [2018-11-23 02:59:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:12,687 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2018-11-23 02:59:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 02:59:12,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 195 transitions. [2018-11-23 02:59:12,690 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:12,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 174 states and 194 transitions. [2018-11-23 02:59:12,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:12,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:12,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 194 transitions. [2018-11-23 02:59:12,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:12,691 INFO L705 BuchiCegarLoop]: Abstraction has 174 states and 194 transitions. [2018-11-23 02:59:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 194 transitions. [2018-11-23 02:59:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 36. [2018-11-23 02:59:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:59:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2018-11-23 02:59:12,693 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 54 transitions. [2018-11-23 02:59:12,693 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 54 transitions. [2018-11-23 02:59:12,693 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-23 02:59:12,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 54 transitions. [2018-11-23 02:59:12,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:12,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:12,694 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:12,694 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:12,694 INFO L794 eck$LassoCheckResult]: Stem: 3411#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 3412#L12 main_~i~0 := 0; 3413#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 3416#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 3417#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3421#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3446#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3445#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3444#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3443#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3442#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3441#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3440#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3439#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3438#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3437#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3436#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3435#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 3418#L21-2 assume main_~j~0 >= 100; 3415#L25 [2018-11-23 02:59:12,694 INFO L796 eck$LassoCheckResult]: Loop: 3415#L25 assume true; 3415#L25 [2018-11-23 02:59:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1943168136, now seen corresponding path program 13 times [2018-11-23 02:59:12,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:12,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:12,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 02:59:12,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:12,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 29 times [2018-11-23 02:59:12,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:59:12,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:59:12,828 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. cyclomatic complexity: 21 Second operand 16 states. [2018-11-23 02:59:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:12,843 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2018-11-23 02:59:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 02:59:12,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2018-11-23 02:59:12,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 55 transitions. [2018-11-23 02:59:12,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:12,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:12,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2018-11-23 02:59:12,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:12,844 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2018-11-23 02:59:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2018-11-23 02:59:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 02:59:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 02:59:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2018-11-23 02:59:12,846 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2018-11-23 02:59:12,846 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2018-11-23 02:59:12,846 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-23 02:59:12,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2018-11-23 02:59:12,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:12,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:12,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:12,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 1, 1, 1, 1] [2018-11-23 02:59:12,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:12,847 INFO L794 eck$LassoCheckResult]: Stem: 3558#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 3559#L12 main_~i~0 := 0; 3560#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3566#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3567#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3594#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3592#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3590#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3588#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3586#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3584#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3582#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3580#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3578#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3576#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3574#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3572#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 3570#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 3561#L15-2 assume main_~i~0 >= 100; 3562#L25 [2018-11-23 02:59:12,847 INFO L796 eck$LassoCheckResult]: Loop: 3562#L25 assume true; 3562#L25 [2018-11-23 02:59:12,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2066361775, now seen corresponding path program 15 times [2018-11-23 02:59:12,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:12,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:12,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:12,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 02:59:12,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:12,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:12,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:12,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 02:59:12,982 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:12,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 30 times [2018-11-23 02:59:12,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:12,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:12,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:12,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:12,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:59:12,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:59:12,985 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 21 Second operand 18 states. [2018-11-23 02:59:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:13,056 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2018-11-23 02:59:13,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 02:59:13,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 215 transitions. [2018-11-23 02:59:13,057 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:13,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 193 states and 214 transitions. [2018-11-23 02:59:13,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:13,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:13,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 214 transitions. [2018-11-23 02:59:13,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:13,058 INFO L705 BuchiCegarLoop]: Abstraction has 193 states and 214 transitions. [2018-11-23 02:59:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 214 transitions. [2018-11-23 02:59:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 38. [2018-11-23 02:59:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 02:59:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2018-11-23 02:59:13,060 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 57 transitions. [2018-11-23 02:59:13,060 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 57 transitions. [2018-11-23 02:59:13,060 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-23 02:59:13,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 57 transitions. [2018-11-23 02:59:13,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:13,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:13,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:13,061 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:13,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:13,061 INFO L794 eck$LassoCheckResult]: Stem: 3864#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 3865#L12 main_~i~0 := 0; 3866#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 3869#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 3870#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3874#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3901#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3900#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3899#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3898#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3897#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3896#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3895#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3894#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3893#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3892#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3891#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3890#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 3889#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 3871#L21-2 assume main_~j~0 >= 100; 3868#L25 [2018-11-23 02:59:13,061 INFO L796 eck$LassoCheckResult]: Loop: 3868#L25 assume true; 3868#L25 [2018-11-23 02:59:13,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash -108668362, now seen corresponding path program 14 times [2018-11-23 02:59:13,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:13,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:13,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:13,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:13,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:13,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 02:59:13,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:13,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 31 times [2018-11-23 02:59:13,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:59:13,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:59:13,183 INFO L87 Difference]: Start difference. First operand 38 states and 57 transitions. cyclomatic complexity: 22 Second operand 17 states. [2018-11-23 02:59:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:13,201 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-11-23 02:59:13,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 02:59:13,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 59 transitions. [2018-11-23 02:59:13,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:13,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 58 transitions. [2018-11-23 02:59:13,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:13,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:13,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 58 transitions. [2018-11-23 02:59:13,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:13,202 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 58 transitions. [2018-11-23 02:59:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 58 transitions. [2018-11-23 02:59:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 02:59:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 02:59:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2018-11-23 02:59:13,203 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 58 transitions. [2018-11-23 02:59:13,203 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 58 transitions. [2018-11-23 02:59:13,204 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-23 02:59:13,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 58 transitions. [2018-11-23 02:59:13,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:13,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:13,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:13,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 1, 1, 1, 1] [2018-11-23 02:59:13,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:13,205 INFO L794 eck$LassoCheckResult]: Stem: 4019#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 4020#L12 main_~i~0 := 0; 4021#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4027#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4028#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4057#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4055#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4053#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4051#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4049#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4047#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4045#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4043#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4041#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4039#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4037#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4035#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4033#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4031#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 4022#L15-2 assume main_~i~0 >= 100; 4023#L25 [2018-11-23 02:59:13,205 INFO L796 eck$LassoCheckResult]: Loop: 4023#L25 assume true; 4023#L25 [2018-11-23 02:59:13,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,205 INFO L82 PathProgramCache]: Analyzing trace with hash 367296107, now seen corresponding path program 16 times [2018-11-23 02:59:13,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:13,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:13,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:13,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:13,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:13,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:13,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:13,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 02:59:13,358 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:13,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 32 times [2018-11-23 02:59:13,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 02:59:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 02:59:13,361 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. cyclomatic complexity: 22 Second operand 19 states. [2018-11-23 02:59:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:13,439 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2018-11-23 02:59:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 02:59:13,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 236 transitions. [2018-11-23 02:59:13,442 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:13,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 213 states and 235 transitions. [2018-11-23 02:59:13,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:13,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:13,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 235 transitions. [2018-11-23 02:59:13,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:13,443 INFO L705 BuchiCegarLoop]: Abstraction has 213 states and 235 transitions. [2018-11-23 02:59:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 235 transitions. [2018-11-23 02:59:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 40. [2018-11-23 02:59:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 02:59:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2018-11-23 02:59:13,445 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2018-11-23 02:59:13,445 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2018-11-23 02:59:13,445 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-23 02:59:13,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 60 transitions. [2018-11-23 02:59:13,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:13,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:13,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:13,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:13,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:13,446 INFO L794 eck$LassoCheckResult]: Stem: 4351#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 4352#L12 main_~i~0 := 0; 4353#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 4356#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 4357#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4361#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4390#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4389#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4388#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4387#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4386#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4385#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4384#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4383#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4382#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4381#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4380#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4379#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4378#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4377#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 4358#L21-2 assume main_~j~0 >= 100; 4355#L25 [2018-11-23 02:59:13,446 INFO L796 eck$LassoCheckResult]: Loop: 4355#L25 assume true; 4355#L25 [2018-11-23 02:59:13,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,446 INFO L82 PathProgramCache]: Analyzing trace with hash 926249784, now seen corresponding path program 15 times [2018-11-23 02:59:13,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:13,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:13,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:13,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 02:59:13,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:13,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:13,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 02:59:13,574 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:13,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 33 times [2018-11-23 02:59:13,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:59:13,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:59:13,577 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. cyclomatic complexity: 23 Second operand 18 states. [2018-11-23 02:59:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:13,597 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-11-23 02:59:13,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 02:59:13,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-11-23 02:59:13,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:13,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 61 transitions. [2018-11-23 02:59:13,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:13,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:13,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 61 transitions. [2018-11-23 02:59:13,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:13,599 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-23 02:59:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 61 transitions. [2018-11-23 02:59:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 02:59:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 02:59:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2018-11-23 02:59:13,599 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-23 02:59:13,599 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-23 02:59:13,599 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-11-23 02:59:13,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 61 transitions. [2018-11-23 02:59:13,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:13,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:13,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:13,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 1, 1, 1, 1] [2018-11-23 02:59:13,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:13,600 INFO L794 eck$LassoCheckResult]: Stem: 4514#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 4515#L12 main_~i~0 := 0; 4516#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4522#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4523#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4554#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4552#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4550#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4548#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4546#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4544#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4542#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4540#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4538#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4536#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4534#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4532#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4530#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4528#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4526#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 4517#L15-2 assume main_~i~0 >= 100; 4518#L25 [2018-11-23 02:59:13,600 INFO L796 eck$LassoCheckResult]: Loop: 4518#L25 assume true; 4518#L25 [2018-11-23 02:59:13,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1498720879, now seen corresponding path program 17 times [2018-11-23 02:59:13,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:13,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:13,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:13,757 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 02:59:13,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:13,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:13,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 02:59:13,778 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:13,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 34 times [2018-11-23 02:59:13,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:13,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:59:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:59:13,782 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. cyclomatic complexity: 23 Second operand 20 states. [2018-11-23 02:59:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:13,849 INFO L93 Difference]: Finished difference Result 235 states and 258 transitions. [2018-11-23 02:59:13,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 02:59:13,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 258 transitions. [2018-11-23 02:59:13,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:13,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 234 states and 257 transitions. [2018-11-23 02:59:13,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:13,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:13,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 257 transitions. [2018-11-23 02:59:13,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:13,852 INFO L705 BuchiCegarLoop]: Abstraction has 234 states and 257 transitions. [2018-11-23 02:59:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 257 transitions. [2018-11-23 02:59:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 42. [2018-11-23 02:59:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 02:59:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2018-11-23 02:59:13,856 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2018-11-23 02:59:13,856 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2018-11-23 02:59:13,856 INFO L442 BuchiCegarLoop]: ======== Iteration 36============ [2018-11-23 02:59:13,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 63 transitions. [2018-11-23 02:59:13,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:13,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:13,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:13,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:13,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:13,857 INFO L794 eck$LassoCheckResult]: Stem: 4873#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 4874#L12 main_~i~0 := 0; 4875#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 4878#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 4879#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4883#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4914#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4913#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4912#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4911#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4910#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4909#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4908#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4907#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4906#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4905#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4904#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4903#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4902#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4901#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4900#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 4880#L21-2 assume main_~j~0 >= 100; 4877#L25 [2018-11-23 02:59:13,857 INFO L796 eck$LassoCheckResult]: Loop: 4877#L25 assume true; 4877#L25 [2018-11-23 02:59:13,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1351026058, now seen corresponding path program 16 times [2018-11-23 02:59:13,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:13,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:13,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:13,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:13,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:13,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:13,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:13,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:14,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 02:59:14,008 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:14,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 35 times [2018-11-23 02:59:14,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 02:59:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 02:59:14,011 INFO L87 Difference]: Start difference. First operand 42 states and 63 transitions. cyclomatic complexity: 24 Second operand 19 states. [2018-11-23 02:59:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:14,027 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2018-11-23 02:59:14,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 02:59:14,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2018-11-23 02:59:14,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 64 transitions. [2018-11-23 02:59:14,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:14,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:14,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 64 transitions. [2018-11-23 02:59:14,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:14,028 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 64 transitions. [2018-11-23 02:59:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 64 transitions. [2018-11-23 02:59:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 02:59:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 02:59:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2018-11-23 02:59:14,029 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 64 transitions. [2018-11-23 02:59:14,029 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 64 transitions. [2018-11-23 02:59:14,029 INFO L442 BuchiCegarLoop]: ======== Iteration 37============ [2018-11-23 02:59:14,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 64 transitions. [2018-11-23 02:59:14,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:14,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:14,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 1, 1, 1, 1] [2018-11-23 02:59:14,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:14,029 INFO L794 eck$LassoCheckResult]: Stem: 5044#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 5045#L12 main_~i~0 := 0; 5046#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5052#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5053#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5086#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5084#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5082#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5080#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5078#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5076#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5074#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5072#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5070#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5068#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5066#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5064#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5062#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5060#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5058#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5056#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 5047#L15-2 assume main_~i~0 >= 100; 5048#L25 [2018-11-23 02:59:14,029 INFO L796 eck$LassoCheckResult]: Loop: 5048#L25 assume true; 5048#L25 [2018-11-23 02:59:14,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash 784294699, now seen corresponding path program 18 times [2018-11-23 02:59:14,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:14,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:14,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:14,170 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 02:59:14,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:14,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:14,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-23 02:59:14,189 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:14,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 36 times [2018-11-23 02:59:14,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 02:59:14,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:59:14,196 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. cyclomatic complexity: 24 Second operand 21 states. [2018-11-23 02:59:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:14,264 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2018-11-23 02:59:14,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 02:59:14,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 281 transitions. [2018-11-23 02:59:14,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:14,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 256 states and 280 transitions. [2018-11-23 02:59:14,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:14,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:14,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 280 transitions. [2018-11-23 02:59:14,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:14,267 INFO L705 BuchiCegarLoop]: Abstraction has 256 states and 280 transitions. [2018-11-23 02:59:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 280 transitions. [2018-11-23 02:59:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 44. [2018-11-23 02:59:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 02:59:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2018-11-23 02:59:14,269 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 66 transitions. [2018-11-23 02:59:14,269 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 66 transitions. [2018-11-23 02:59:14,269 INFO L442 BuchiCegarLoop]: ======== Iteration 38============ [2018-11-23 02:59:14,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 66 transitions. [2018-11-23 02:59:14,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:14,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:14,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:14,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:14,270 INFO L794 eck$LassoCheckResult]: Stem: 5431#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 5432#L12 main_~i~0 := 0; 5433#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 5436#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 5437#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5441#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5474#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5473#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5472#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5471#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5470#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5469#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5468#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5467#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5466#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5465#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5464#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5463#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5462#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5461#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5460#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5459#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 5438#L21-2 assume main_~j~0 >= 100; 5435#L25 [2018-11-23 02:59:14,270 INFO L796 eck$LassoCheckResult]: Loop: 5435#L25 assume true; 5435#L25 [2018-11-23 02:59:14,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1067866872, now seen corresponding path program 17 times [2018-11-23 02:59:14,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:14,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:14,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:14,445 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 02:59:14,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:14,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:14,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 02:59:14,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:14,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 37 times [2018-11-23 02:59:14,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:59:14,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:59:14,477 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. cyclomatic complexity: 25 Second operand 20 states. [2018-11-23 02:59:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:14,495 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2018-11-23 02:59:14,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 02:59:14,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2018-11-23 02:59:14,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2018-11-23 02:59:14,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:14,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:14,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2018-11-23 02:59:14,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:14,496 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 67 transitions. [2018-11-23 02:59:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2018-11-23 02:59:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 02:59:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 02:59:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2018-11-23 02:59:14,497 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 67 transitions. [2018-11-23 02:59:14,497 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 67 transitions. [2018-11-23 02:59:14,497 INFO L442 BuchiCegarLoop]: ======== Iteration 39============ [2018-11-23 02:59:14,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 67 transitions. [2018-11-23 02:59:14,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:14,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:14,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 1, 1, 1, 1] [2018-11-23 02:59:14,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:14,498 INFO L794 eck$LassoCheckResult]: Stem: 5610#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 5611#L12 main_~i~0 := 0; 5612#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5618#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5619#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5654#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5652#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5650#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5648#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5646#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5644#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5642#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5640#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5638#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5636#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5634#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5632#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5630#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5628#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5626#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5624#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 5622#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 5613#L15-2 assume main_~i~0 >= 100; 5614#L25 [2018-11-23 02:59:14,498 INFO L796 eck$LassoCheckResult]: Loop: 5614#L25 assume true; 5614#L25 [2018-11-23 02:59:14,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1456666415, now seen corresponding path program 19 times [2018-11-23 02:59:14,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:14,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:14,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:14,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:14,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:14,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-23 02:59:14,656 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:14,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,656 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 38 times [2018-11-23 02:59:14,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:14,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 02:59:14,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 02:59:14,659 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. cyclomatic complexity: 25 Second operand 22 states. [2018-11-23 02:59:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:14,723 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-11-23 02:59:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 02:59:14,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 280 states and 305 transitions. [2018-11-23 02:59:14,724 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:14,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 280 states to 279 states and 304 transitions. [2018-11-23 02:59:14,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:14,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:14,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 304 transitions. [2018-11-23 02:59:14,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:14,725 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 304 transitions. [2018-11-23 02:59:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 304 transitions. [2018-11-23 02:59:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 46. [2018-11-23 02:59:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:59:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2018-11-23 02:59:14,726 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 69 transitions. [2018-11-23 02:59:14,726 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 69 transitions. [2018-11-23 02:59:14,726 INFO L442 BuchiCegarLoop]: ======== Iteration 40============ [2018-11-23 02:59:14,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 69 transitions. [2018-11-23 02:59:14,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:14,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:14,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:14,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:14,727 INFO L794 eck$LassoCheckResult]: Stem: 6026#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 6027#L12 main_~i~0 := 0; 6028#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 6031#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 6032#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6036#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6071#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6070#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6069#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6068#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6067#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6066#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6065#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6064#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6063#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6062#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6061#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6060#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6059#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6058#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6057#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6056#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6055#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 6033#L21-2 assume main_~j~0 >= 100; 6030#L25 [2018-11-23 02:59:14,727 INFO L796 eck$LassoCheckResult]: Loop: 6030#L25 assume true; 6030#L25 [2018-11-23 02:59:14,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1255863626, now seen corresponding path program 18 times [2018-11-23 02:59:14,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:14,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:14,864 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:14,876 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 02:59:14,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:14,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:14,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:14,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-23 02:59:14,895 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:14,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 39 times [2018-11-23 02:59:14,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:14,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 02:59:14,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:59:14,898 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. cyclomatic complexity: 26 Second operand 21 states. [2018-11-23 02:59:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:14,915 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2018-11-23 02:59:14,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 02:59:14,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2018-11-23 02:59:14,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 70 transitions. [2018-11-23 02:59:14,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:14,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:14,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 70 transitions. [2018-11-23 02:59:14,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:14,916 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 70 transitions. [2018-11-23 02:59:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 70 transitions. [2018-11-23 02:59:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 02:59:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 02:59:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2018-11-23 02:59:14,916 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 70 transitions. [2018-11-23 02:59:14,917 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 70 transitions. [2018-11-23 02:59:14,917 INFO L442 BuchiCegarLoop]: ======== Iteration 41============ [2018-11-23 02:59:14,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 70 transitions. [2018-11-23 02:59:14,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:14,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:14,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:14,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 1, 1, 1, 1] [2018-11-23 02:59:14,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:14,917 INFO L794 eck$LassoCheckResult]: Stem: 6213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 6214#L12 main_~i~0 := 0; 6215#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6221#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6222#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6259#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6257#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6255#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6253#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6251#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6249#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6247#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6245#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6243#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6241#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6239#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6237#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6235#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6233#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6231#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6229#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6227#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6225#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 6216#L15-2 assume main_~i~0 >= 100; 6217#L25 [2018-11-23 02:59:14,917 INFO L796 eck$LassoCheckResult]: Loop: 6217#L25 assume true; 6217#L25 [2018-11-23 02:59:14,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:14,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2087983083, now seen corresponding path program 20 times [2018-11-23 02:59:14,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:14,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:15,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:15,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:15,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:15,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:15,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:15,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-23 02:59:15,070 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:15,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:15,070 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 40 times [2018-11-23 02:59:15,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:15,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:15,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:15,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 02:59:15,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 02:59:15,078 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. cyclomatic complexity: 26 Second operand 23 states. [2018-11-23 02:59:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:15,144 INFO L93 Difference]: Finished difference Result 304 states and 330 transitions. [2018-11-23 02:59:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 02:59:15,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 330 transitions. [2018-11-23 02:59:15,145 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:15,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 303 states and 329 transitions. [2018-11-23 02:59:15,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:15,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:15,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 329 transitions. [2018-11-23 02:59:15,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:15,146 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 329 transitions. [2018-11-23 02:59:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 329 transitions. [2018-11-23 02:59:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 48. [2018-11-23 02:59:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 02:59:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2018-11-23 02:59:15,147 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 72 transitions. [2018-11-23 02:59:15,147 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 72 transitions. [2018-11-23 02:59:15,147 INFO L442 BuchiCegarLoop]: ======== Iteration 42============ [2018-11-23 02:59:15,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 72 transitions. [2018-11-23 02:59:15,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:15,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:15,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:15,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:15,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:15,148 INFO L794 eck$LassoCheckResult]: Stem: 6659#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 6660#L12 main_~i~0 := 0; 6661#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 6664#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 6665#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6669#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6706#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6705#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6704#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6703#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6702#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6701#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6700#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6699#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6698#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6697#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6696#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6695#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6694#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6693#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6692#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6691#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6690#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 6689#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 6666#L21-2 assume main_~j~0 >= 100; 6663#L25 [2018-11-23 02:59:15,148 INFO L796 eck$LassoCheckResult]: Loop: 6663#L25 assume true; 6663#L25 [2018-11-23 02:59:15,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash -277065032, now seen corresponding path program 19 times [2018-11-23 02:59:15,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:15,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:15,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:15,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:15,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-23 02:59:15,381 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:15,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:15,381 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 41 times [2018-11-23 02:59:15,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:15,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 02:59:15,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 02:59:15,390 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. cyclomatic complexity: 27 Second operand 22 states. [2018-11-23 02:59:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:15,419 INFO L93 Difference]: Finished difference Result 50 states and 74 transitions. [2018-11-23 02:59:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 02:59:15,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 74 transitions. [2018-11-23 02:59:15,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:15,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 49 states and 73 transitions. [2018-11-23 02:59:15,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:15,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:15,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 73 transitions. [2018-11-23 02:59:15,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:15,422 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 73 transitions. [2018-11-23 02:59:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 73 transitions. [2018-11-23 02:59:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 02:59:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 02:59:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2018-11-23 02:59:15,423 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 73 transitions. [2018-11-23 02:59:15,423 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 73 transitions. [2018-11-23 02:59:15,423 INFO L442 BuchiCegarLoop]: ======== Iteration 43============ [2018-11-23 02:59:15,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 73 transitions. [2018-11-23 02:59:15,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:15,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:15,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:15,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 1, 1, 1, 1] [2018-11-23 02:59:15,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:15,424 INFO L794 eck$LassoCheckResult]: Stem: 6854#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 6855#L12 main_~i~0 := 0; 6856#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6862#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6863#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6902#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6900#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6898#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6896#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6894#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6892#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6890#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6888#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6886#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6884#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6882#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6880#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6878#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6876#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6874#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6872#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6870#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6868#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6866#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 6857#L15-2 assume main_~i~0 >= 100; 6858#L25 [2018-11-23 02:59:15,424 INFO L796 eck$LassoCheckResult]: Loop: 6858#L25 assume true; 6858#L25 [2018-11-23 02:59:15,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash 302967825, now seen corresponding path program 21 times [2018-11-23 02:59:15,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:15,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:15,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:15,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:15,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:15,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:15,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 02:59:15,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:15,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:15,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-23 02:59:15,626 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:15,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 42 times [2018-11-23 02:59:15,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:15,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:15,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:15,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:15,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 02:59:15,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 02:59:15,634 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. cyclomatic complexity: 27 Second operand 24 states. [2018-11-23 02:59:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:15,755 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-11-23 02:59:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 02:59:15,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 356 transitions. [2018-11-23 02:59:15,756 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:15,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 328 states and 355 transitions. [2018-11-23 02:59:15,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:15,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:15,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 355 transitions. [2018-11-23 02:59:15,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:15,758 INFO L705 BuchiCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-11-23 02:59:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 355 transitions. [2018-11-23 02:59:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 50. [2018-11-23 02:59:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 02:59:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2018-11-23 02:59:15,760 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 75 transitions. [2018-11-23 02:59:15,760 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 75 transitions. [2018-11-23 02:59:15,760 INFO L442 BuchiCegarLoop]: ======== Iteration 44============ [2018-11-23 02:59:15,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 75 transitions. [2018-11-23 02:59:15,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:15,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:15,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:15,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:15,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:15,761 INFO L794 eck$LassoCheckResult]: Stem: 7331#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 7332#L12 main_~i~0 := 0; 7333#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 7336#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 7337#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7341#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7380#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7379#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7378#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7377#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7376#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7375#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7374#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7373#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7372#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7371#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7370#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7369#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7368#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7367#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7366#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7365#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7364#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7363#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 7362#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 7338#L21-2 assume main_~j~0 >= 100; 7335#L25 [2018-11-23 02:59:15,762 INFO L796 eck$LassoCheckResult]: Loop: 7335#L25 assume true; 7335#L25 [2018-11-23 02:59:15,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash 920310, now seen corresponding path program 20 times [2018-11-23 02:59:15,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:15,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:15,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:15,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:15,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:15,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:15,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:15,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:15,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:15,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:15,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-23 02:59:16,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:16,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 43 times [2018-11-23 02:59:16,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:16,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:16,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:16,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 02:59:16,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 02:59:16,009 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. cyclomatic complexity: 28 Second operand 23 states. [2018-11-23 02:59:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:16,034 INFO L93 Difference]: Finished difference Result 52 states and 77 transitions. [2018-11-23 02:59:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 02:59:16,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 77 transitions. [2018-11-23 02:59:16,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:16,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 51 states and 76 transitions. [2018-11-23 02:59:16,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:16,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:16,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 76 transitions. [2018-11-23 02:59:16,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:16,035 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 76 transitions. [2018-11-23 02:59:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 76 transitions. [2018-11-23 02:59:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 02:59:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 02:59:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2018-11-23 02:59:16,036 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 76 transitions. [2018-11-23 02:59:16,036 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 76 transitions. [2018-11-23 02:59:16,036 INFO L442 BuchiCegarLoop]: ======== Iteration 45============ [2018-11-23 02:59:16,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 76 transitions. [2018-11-23 02:59:16,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:16,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:16,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:16,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 1, 1, 1, 1] [2018-11-23 02:59:16,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:16,036 INFO L794 eck$LassoCheckResult]: Stem: 7534#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 7535#L12 main_~i~0 := 0; 7536#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7542#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7543#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7584#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7582#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7580#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7578#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7576#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7574#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7572#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7570#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7568#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7566#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7564#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7562#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7560#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7558#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7556#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7554#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7552#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7550#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7548#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 7546#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 7537#L15-2 assume main_~i~0 >= 100; 7538#L25 [2018-11-23 02:59:16,036 INFO L796 eck$LassoCheckResult]: Loop: 7538#L25 assume true; 7538#L25 [2018-11-23 02:59:16,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:16,037 INFO L82 PathProgramCache]: Analyzing trace with hash 802069675, now seen corresponding path program 22 times [2018-11-23 02:59:16,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:16,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:16,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:16,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:16,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:16,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:16,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:16,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:16,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:16,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-23 02:59:16,310 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:16,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 44 times [2018-11-23 02:59:16,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 02:59:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 02:59:16,320 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. cyclomatic complexity: 28 Second operand 25 states. [2018-11-23 02:59:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:16,420 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2018-11-23 02:59:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 02:59:16,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 383 transitions. [2018-11-23 02:59:16,423 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:16,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 354 states and 382 transitions. [2018-11-23 02:59:16,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:16,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:16,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 382 transitions. [2018-11-23 02:59:16,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:16,425 INFO L705 BuchiCegarLoop]: Abstraction has 354 states and 382 transitions. [2018-11-23 02:59:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 382 transitions. [2018-11-23 02:59:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 52. [2018-11-23 02:59:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 02:59:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2018-11-23 02:59:16,427 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 78 transitions. [2018-11-23 02:59:16,427 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 78 transitions. [2018-11-23 02:59:16,427 INFO L442 BuchiCegarLoop]: ======== Iteration 46============ [2018-11-23 02:59:16,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 78 transitions. [2018-11-23 02:59:16,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:16,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:16,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:16,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:16,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:16,428 INFO L794 eck$LassoCheckResult]: Stem: 8043#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 8044#L12 main_~i~0 := 0; 8045#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 8048#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 8049#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8053#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8094#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8093#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8092#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8091#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8090#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8089#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8088#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8087#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8086#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8085#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8084#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8083#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8082#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8081#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8080#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8079#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8078#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8077#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8076#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8075#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 8050#L21-2 assume main_~j~0 >= 100; 8047#L25 [2018-11-23 02:59:16,428 INFO L796 eck$LassoCheckResult]: Loop: 8047#L25 assume true; 8047#L25 [2018-11-23 02:59:16,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash 28531320, now seen corresponding path program 21 times [2018-11-23 02:59:16,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:16,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:16,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:16,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 02:59:16,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:16,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:16,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:16,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-23 02:59:16,630 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:16,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 45 times [2018-11-23 02:59:16,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:16,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:16,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:16,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 02:59:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 02:59:16,633 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. cyclomatic complexity: 29 Second operand 24 states. [2018-11-23 02:59:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:16,681 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2018-11-23 02:59:16,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 02:59:16,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2018-11-23 02:59:16,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:16,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 53 states and 79 transitions. [2018-11-23 02:59:16,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:16,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:16,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 79 transitions. [2018-11-23 02:59:16,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:16,684 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2018-11-23 02:59:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 79 transitions. [2018-11-23 02:59:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 02:59:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 02:59:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2018-11-23 02:59:16,685 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2018-11-23 02:59:16,685 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2018-11-23 02:59:16,686 INFO L442 BuchiCegarLoop]: ======== Iteration 47============ [2018-11-23 02:59:16,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 79 transitions. [2018-11-23 02:59:16,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:16,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:16,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:16,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 1, 1, 1, 1] [2018-11-23 02:59:16,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:16,686 INFO L794 eck$LassoCheckResult]: Stem: 8254#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 8255#L12 main_~i~0 := 0; 8256#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8262#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8263#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8306#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8304#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8302#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8300#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8298#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8296#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8294#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8292#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8290#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8288#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8286#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8284#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8282#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8280#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8278#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8276#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8274#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8272#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8270#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8268#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 8266#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 8257#L15-2 assume main_~i~0 >= 100; 8258#L25 [2018-11-23 02:59:16,687 INFO L796 eck$LassoCheckResult]: Loop: 8258#L25 assume true; 8258#L25 [2018-11-23 02:59:16,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:16,687 INFO L82 PathProgramCache]: Analyzing trace with hash -905642159, now seen corresponding path program 23 times [2018-11-23 02:59:16,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:16,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:16,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:16,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:16,951 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:16,980 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 02:59:16,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:16,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:17,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:17,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-23 02:59:17,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:17,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 46 times [2018-11-23 02:59:17,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:17,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:17,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 02:59:17,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 02:59:17,023 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. cyclomatic complexity: 29 Second operand 26 states. [2018-11-23 02:59:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:17,178 INFO L93 Difference]: Finished difference Result 382 states and 411 transitions. [2018-11-23 02:59:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 02:59:17,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 411 transitions. [2018-11-23 02:59:17,181 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:17,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 381 states and 410 transitions. [2018-11-23 02:59:17,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:17,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:17,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 381 states and 410 transitions. [2018-11-23 02:59:17,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:17,182 INFO L705 BuchiCegarLoop]: Abstraction has 381 states and 410 transitions. [2018-11-23 02:59:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states and 410 transitions. [2018-11-23 02:59:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 54. [2018-11-23 02:59:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 02:59:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2018-11-23 02:59:17,184 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 81 transitions. [2018-11-23 02:59:17,184 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 81 transitions. [2018-11-23 02:59:17,185 INFO L442 BuchiCegarLoop]: ======== Iteration 48============ [2018-11-23 02:59:17,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 81 transitions. [2018-11-23 02:59:17,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:17,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:17,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:17,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:17,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:17,186 INFO L794 eck$LassoCheckResult]: Stem: 8796#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 8797#L12 main_~i~0 := 0; 8798#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 8801#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 8802#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8806#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8849#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8848#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8847#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8846#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8845#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8844#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8843#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8842#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8841#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8840#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8839#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8838#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8837#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8836#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8835#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8834#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8833#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8832#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8831#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8830#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 8829#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 8803#L21-2 assume main_~j~0 >= 100; 8800#L25 [2018-11-23 02:59:17,186 INFO L796 eck$LassoCheckResult]: Loop: 8800#L25 assume true; 8800#L25 [2018-11-23 02:59:17,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash 884472630, now seen corresponding path program 22 times [2018-11-23 02:59:17,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:17,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:17,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:17,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:17,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:17,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:17,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:17,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:17,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:17,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-23 02:59:17,401 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:17,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 47 times [2018-11-23 02:59:17,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:17,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:17,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 02:59:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 02:59:17,404 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. cyclomatic complexity: 30 Second operand 25 states. [2018-11-23 02:59:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:17,432 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2018-11-23 02:59:17,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 02:59:17,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 83 transitions. [2018-11-23 02:59:17,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:17,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 82 transitions. [2018-11-23 02:59:17,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:17,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:17,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 82 transitions. [2018-11-23 02:59:17,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:17,434 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 82 transitions. [2018-11-23 02:59:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 82 transitions. [2018-11-23 02:59:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 02:59:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 02:59:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2018-11-23 02:59:17,435 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 82 transitions. [2018-11-23 02:59:17,435 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 82 transitions. [2018-11-23 02:59:17,436 INFO L442 BuchiCegarLoop]: ======== Iteration 49============ [2018-11-23 02:59:17,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 82 transitions. [2018-11-23 02:59:17,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:17,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:17,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:17,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 1, 1, 1, 1] [2018-11-23 02:59:17,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:17,436 INFO L794 eck$LassoCheckResult]: Stem: 9015#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 9016#L12 main_~i~0 := 0; 9017#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9023#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9024#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9069#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9067#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9065#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9063#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9061#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9059#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9057#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9055#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9053#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9051#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9049#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9047#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9045#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9043#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9041#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9039#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9037#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9035#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9033#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9031#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9029#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9027#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 9018#L15-2 assume main_~i~0 >= 100; 9019#L25 [2018-11-23 02:59:17,436 INFO L796 eck$LassoCheckResult]: Loop: 9019#L25 assume true; 9019#L25 [2018-11-23 02:59:17,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1989865835, now seen corresponding path program 24 times [2018-11-23 02:59:17,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:17,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:17,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:17,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:17,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:17,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:17,683 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:17,700 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 02:59:17,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:17,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-23 02:59:17,730 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:17,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:17,731 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 48 times [2018-11-23 02:59:17,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:17,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:17,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:17,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 02:59:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 02:59:17,758 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. cyclomatic complexity: 30 Second operand 27 states. [2018-11-23 02:59:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:17,885 INFO L93 Difference]: Finished difference Result 410 states and 440 transitions. [2018-11-23 02:59:17,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 02:59:17,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 410 states and 440 transitions. [2018-11-23 02:59:17,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:17,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 410 states to 409 states and 439 transitions. [2018-11-23 02:59:17,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:17,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:17,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 439 transitions. [2018-11-23 02:59:17,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:17,891 INFO L705 BuchiCegarLoop]: Abstraction has 409 states and 439 transitions. [2018-11-23 02:59:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 439 transitions. [2018-11-23 02:59:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 56. [2018-11-23 02:59:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 02:59:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2018-11-23 02:59:17,893 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2018-11-23 02:59:17,904 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2018-11-23 02:59:17,904 INFO L442 BuchiCegarLoop]: ======== Iteration 50============ [2018-11-23 02:59:17,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 84 transitions. [2018-11-23 02:59:17,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:17,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:17,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:17,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:17,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:17,905 INFO L794 eck$LassoCheckResult]: Stem: 9591#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 9592#L12 main_~i~0 := 0; 9593#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 9596#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 9597#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9601#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9646#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9645#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9644#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9643#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9642#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9641#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9640#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9639#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9638#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9637#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9636#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9635#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9634#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9633#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9632#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9631#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9630#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9629#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9628#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9627#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9626#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 9625#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 9598#L21-2 assume main_~j~0 >= 100; 9595#L25 [2018-11-23 02:59:17,905 INFO L796 eck$LassoCheckResult]: Loop: 9595#L25 assume true; 9595#L25 [2018-11-23 02:59:17,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:17,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1648849464, now seen corresponding path program 23 times [2018-11-23 02:59:17,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:17,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:18,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:18,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:18,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:18,115 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 02:59:18,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:18,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:18,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:18,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-23 02:59:18,143 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:18,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 49 times [2018-11-23 02:59:18,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:18,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 02:59:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 02:59:18,150 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. cyclomatic complexity: 31 Second operand 26 states. [2018-11-23 02:59:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:18,171 INFO L93 Difference]: Finished difference Result 58 states and 86 transitions. [2018-11-23 02:59:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 02:59:18,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 86 transitions. [2018-11-23 02:59:18,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:18,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 85 transitions. [2018-11-23 02:59:18,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:18,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:18,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 85 transitions. [2018-11-23 02:59:18,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:18,174 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 85 transitions. [2018-11-23 02:59:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 85 transitions. [2018-11-23 02:59:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 02:59:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 02:59:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2018-11-23 02:59:18,175 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 85 transitions. [2018-11-23 02:59:18,175 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 85 transitions. [2018-11-23 02:59:18,175 INFO L442 BuchiCegarLoop]: ======== Iteration 51============ [2018-11-23 02:59:18,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 85 transitions. [2018-11-23 02:59:18,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:18,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:18,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:18,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [25, 1, 1, 1, 1] [2018-11-23 02:59:18,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:18,176 INFO L794 eck$LassoCheckResult]: Stem: 9818#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 9819#L12 main_~i~0 := 0; 9820#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9826#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9827#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9874#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9872#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9870#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9868#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9866#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9864#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9862#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9860#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9858#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9856#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9854#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9852#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9850#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9848#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9846#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9844#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9842#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9840#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9838#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9836#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9834#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9832#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 9830#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 9821#L15-2 assume main_~i~0 >= 100; 9822#L25 [2018-11-23 02:59:18,176 INFO L796 eck$LassoCheckResult]: Loop: 9822#L25 assume true; 9822#L25 [2018-11-23 02:59:18,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1556300433, now seen corresponding path program 25 times [2018-11-23 02:59:18,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:18,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:18,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:18,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:18,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:18,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:18,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:18,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-23 02:59:18,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:18,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 50 times [2018-11-23 02:59:18,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:18,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:18,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:18,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 02:59:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 02:59:18,446 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. cyclomatic complexity: 31 Second operand 28 states. [2018-11-23 02:59:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:18,549 INFO L93 Difference]: Finished difference Result 439 states and 470 transitions. [2018-11-23 02:59:18,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 02:59:18,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 439 states and 470 transitions. [2018-11-23 02:59:18,552 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:18,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 439 states to 438 states and 469 transitions. [2018-11-23 02:59:18,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:18,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:18,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 469 transitions. [2018-11-23 02:59:18,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:18,554 INFO L705 BuchiCegarLoop]: Abstraction has 438 states and 469 transitions. [2018-11-23 02:59:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 469 transitions. [2018-11-23 02:59:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 58. [2018-11-23 02:59:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 02:59:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2018-11-23 02:59:18,556 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 87 transitions. [2018-11-23 02:59:18,556 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 87 transitions. [2018-11-23 02:59:18,556 INFO L442 BuchiCegarLoop]: ======== Iteration 52============ [2018-11-23 02:59:18,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 87 transitions. [2018-11-23 02:59:18,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:18,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:18,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:18,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:18,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:18,557 INFO L794 eck$LassoCheckResult]: Stem: 10429#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 10430#L12 main_~i~0 := 0; 10431#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 10434#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 10435#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10439#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10486#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10485#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10484#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10483#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10482#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10481#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10480#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10479#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10478#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10477#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10476#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10475#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10474#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10473#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10472#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10471#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10470#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10469#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10468#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10467#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10466#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10465#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 10464#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 10436#L21-2 assume main_~j~0 >= 100; 10433#L25 [2018-11-23 02:59:18,557 INFO L796 eck$LassoCheckResult]: Loop: 10433#L25 assume true; 10433#L25 [2018-11-23 02:59:18,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash -425272458, now seen corresponding path program 24 times [2018-11-23 02:59:18,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:18,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:18,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:18,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:18,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:18,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:18,761 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:18,786 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 02:59:18,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:18,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-23 02:59:18,814 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:18,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 51 times [2018-11-23 02:59:18,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:18,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:18,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:18,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:18,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 02:59:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 02:59:18,822 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. cyclomatic complexity: 32 Second operand 27 states. [2018-11-23 02:59:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:18,848 INFO L93 Difference]: Finished difference Result 60 states and 89 transitions. [2018-11-23 02:59:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 02:59:18,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 89 transitions. [2018-11-23 02:59:18,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:18,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 88 transitions. [2018-11-23 02:59:18,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:18,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:18,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 88 transitions. [2018-11-23 02:59:18,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:18,849 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 88 transitions. [2018-11-23 02:59:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 88 transitions. [2018-11-23 02:59:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 02:59:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 02:59:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2018-11-23 02:59:18,850 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 88 transitions. [2018-11-23 02:59:18,850 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 88 transitions. [2018-11-23 02:59:18,850 INFO L442 BuchiCegarLoop]: ======== Iteration 53============ [2018-11-23 02:59:18,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 88 transitions. [2018-11-23 02:59:18,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:18,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:18,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:18,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [26, 1, 1, 1, 1] [2018-11-23 02:59:18,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:18,851 INFO L794 eck$LassoCheckResult]: Stem: 10664#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 10665#L12 main_~i~0 := 0; 10666#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10672#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10673#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10722#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10720#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10718#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10716#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10714#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10712#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10710#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10708#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10706#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10704#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10702#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10700#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10698#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10696#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10694#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10692#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10690#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10688#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10686#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10684#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10682#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10680#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10678#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 10676#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 10667#L15-2 assume main_~i~0 >= 100; 10668#L25 [2018-11-23 02:59:18,851 INFO L796 eck$LassoCheckResult]: Loop: 10668#L25 assume true; 10668#L25 [2018-11-23 02:59:18,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1000674859, now seen corresponding path program 26 times [2018-11-23 02:59:18,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:19,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:19,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:19,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:19,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:19,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:19,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:19,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:19,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 02:59:19,098 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:19,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 52 times [2018-11-23 02:59:19,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:19,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:19,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:19,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:19,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 02:59:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 02:59:19,101 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. cyclomatic complexity: 32 Second operand 29 states. [2018-11-23 02:59:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:19,188 INFO L93 Difference]: Finished difference Result 469 states and 501 transitions. [2018-11-23 02:59:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 02:59:19,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 501 transitions. [2018-11-23 02:59:19,189 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:19,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 468 states and 500 transitions. [2018-11-23 02:59:19,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:19,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:19,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 468 states and 500 transitions. [2018-11-23 02:59:19,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:19,191 INFO L705 BuchiCegarLoop]: Abstraction has 468 states and 500 transitions. [2018-11-23 02:59:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states and 500 transitions. [2018-11-23 02:59:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 60. [2018-11-23 02:59:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 02:59:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2018-11-23 02:59:19,193 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-23 02:59:19,193 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-23 02:59:19,193 INFO L442 BuchiCegarLoop]: ======== Iteration 54============ [2018-11-23 02:59:19,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 90 transitions. [2018-11-23 02:59:19,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:19,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:19,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:19,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [25, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:19,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:19,194 INFO L794 eck$LassoCheckResult]: Stem: 11311#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 11312#L12 main_~i~0 := 0; 11313#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 11316#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 11317#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11321#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11370#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11369#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11368#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11367#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11366#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11365#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11364#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11363#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11362#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11361#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11360#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11359#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11358#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11357#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11356#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11355#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11354#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11353#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11352#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11351#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11350#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11349#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11348#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 11347#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 11318#L21-2 assume main_~j~0 >= 100; 11315#L25 [2018-11-23 02:59:19,194 INFO L796 eck$LassoCheckResult]: Loop: 11315#L25 assume true; 11315#L25 [2018-11-23 02:59:19,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash -298542600, now seen corresponding path program 25 times [2018-11-23 02:59:19,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:19,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:19,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:19,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:19,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:19,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:19,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:19,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:19,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:19,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-23 02:59:19,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:19,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 53 times [2018-11-23 02:59:19,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:19,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 02:59:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 02:59:19,445 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. cyclomatic complexity: 33 Second operand 28 states. [2018-11-23 02:59:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:19,483 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2018-11-23 02:59:19,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 02:59:19,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 92 transitions. [2018-11-23 02:59:19,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:19,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 61 states and 91 transitions. [2018-11-23 02:59:19,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:19,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:19,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 91 transitions. [2018-11-23 02:59:19,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:19,486 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 91 transitions. [2018-11-23 02:59:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 91 transitions. [2018-11-23 02:59:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 02:59:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 02:59:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2018-11-23 02:59:19,487 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 91 transitions. [2018-11-23 02:59:19,487 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 91 transitions. [2018-11-23 02:59:19,487 INFO L442 BuchiCegarLoop]: ======== Iteration 55============ [2018-11-23 02:59:19,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 91 transitions. [2018-11-23 02:59:19,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:19,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:19,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:19,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 1, 1, 1, 1] [2018-11-23 02:59:19,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:19,488 INFO L794 eck$LassoCheckResult]: Stem: 11554#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 11555#L12 main_~i~0 := 0; 11556#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11562#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11563#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11614#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11612#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11610#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11608#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11606#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11604#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11602#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11600#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11598#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11596#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11594#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11592#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11590#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11588#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11586#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11584#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11582#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11580#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11578#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11576#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11574#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11572#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11570#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11568#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11566#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 11557#L15-2 assume main_~i~0 >= 100; 11558#L25 [2018-11-23 02:59:19,488 INFO L796 eck$LassoCheckResult]: Loop: 11558#L25 assume true; 11558#L25 [2018-11-23 02:59:19,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:19,489 INFO L82 PathProgramCache]: Analyzing trace with hash 956151249, now seen corresponding path program 27 times [2018-11-23 02:59:19,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:19,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:19,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:19,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:19,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:19,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 02:59:19,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:19,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:19,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:19,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 02:59:19,794 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:19,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 54 times [2018-11-23 02:59:19,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 02:59:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 02:59:19,810 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. cyclomatic complexity: 33 Second operand 30 states. [2018-11-23 02:59:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:19,951 INFO L93 Difference]: Finished difference Result 500 states and 533 transitions. [2018-11-23 02:59:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 02:59:19,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 533 transitions. [2018-11-23 02:59:19,952 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:19,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 499 states and 532 transitions. [2018-11-23 02:59:19,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:19,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:19,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 499 states and 532 transitions. [2018-11-23 02:59:19,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:19,953 INFO L705 BuchiCegarLoop]: Abstraction has 499 states and 532 transitions. [2018-11-23 02:59:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states and 532 transitions. [2018-11-23 02:59:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 62. [2018-11-23 02:59:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 02:59:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2018-11-23 02:59:19,955 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 93 transitions. [2018-11-23 02:59:19,955 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 93 transitions. [2018-11-23 02:59:19,955 INFO L442 BuchiCegarLoop]: ======== Iteration 56============ [2018-11-23 02:59:19,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 93 transitions. [2018-11-23 02:59:19,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:19,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:19,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:19,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [26, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:19,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:19,956 INFO L794 eck$LassoCheckResult]: Stem: 12238#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 12239#L12 main_~i~0 := 0; 12240#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 12243#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 12244#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12248#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12299#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12298#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12297#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12296#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12295#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12294#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12293#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12292#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12291#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12290#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12289#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12288#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12287#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12286#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12285#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12284#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12283#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12282#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12281#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12280#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12279#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12278#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12277#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12276#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12275#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 12245#L21-2 assume main_~j~0 >= 100; 12242#L25 [2018-11-23 02:59:19,956 INFO L796 eck$LassoCheckResult]: Loop: 12242#L25 assume true; 12242#L25 [2018-11-23 02:59:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash -664884298, now seen corresponding path program 26 times [2018-11-23 02:59:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:20,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:20,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:20,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:20,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:20,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:20,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:20,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:20,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 02:59:20,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:20,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 55 times [2018-11-23 02:59:20,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 02:59:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 02:59:20,218 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. cyclomatic complexity: 34 Second operand 29 states. [2018-11-23 02:59:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:20,292 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2018-11-23 02:59:20,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 02:59:20,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 95 transitions. [2018-11-23 02:59:20,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:20,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 94 transitions. [2018-11-23 02:59:20,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:20,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:20,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 94 transitions. [2018-11-23 02:59:20,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:20,296 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 94 transitions. [2018-11-23 02:59:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 94 transitions. [2018-11-23 02:59:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 02:59:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 02:59:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2018-11-23 02:59:20,297 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 94 transitions. [2018-11-23 02:59:20,297 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 94 transitions. [2018-11-23 02:59:20,298 INFO L442 BuchiCegarLoop]: ======== Iteration 57============ [2018-11-23 02:59:20,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 94 transitions. [2018-11-23 02:59:20,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:20,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:20,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:20,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [28, 1, 1, 1, 1] [2018-11-23 02:59:20,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:20,298 INFO L794 eck$LassoCheckResult]: Stem: 12489#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 12490#L12 main_~i~0 := 0; 12491#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12497#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12498#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12551#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12549#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12547#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12545#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12543#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12541#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12539#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12537#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12535#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12533#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12531#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12529#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12527#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12525#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12523#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12521#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12519#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12517#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12515#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12513#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12511#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12509#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12507#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12505#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12503#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 12501#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 12492#L15-2 assume main_~i~0 >= 100; 12493#L25 [2018-11-23 02:59:20,298 INFO L796 eck$LassoCheckResult]: Loop: 12493#L25 assume true; 12493#L25 [2018-11-23 02:59:20,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash -424080661, now seen corresponding path program 28 times [2018-11-23 02:59:20,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:20,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:20,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:20,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:20,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:20,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:20,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:20,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:20,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:20,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-23 02:59:20,604 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:20,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:20,604 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 56 times [2018-11-23 02:59:20,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:20,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 02:59:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 02:59:20,610 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. cyclomatic complexity: 34 Second operand 31 states. [2018-11-23 02:59:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:20,711 INFO L93 Difference]: Finished difference Result 532 states and 566 transitions. [2018-11-23 02:59:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 02:59:20,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 566 transitions. [2018-11-23 02:59:20,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:20,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 531 states and 565 transitions. [2018-11-23 02:59:20,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:20,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:20,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 531 states and 565 transitions. [2018-11-23 02:59:20,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:20,714 INFO L705 BuchiCegarLoop]: Abstraction has 531 states and 565 transitions. [2018-11-23 02:59:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 565 transitions. [2018-11-23 02:59:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 64. [2018-11-23 02:59:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 02:59:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2018-11-23 02:59:20,716 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2018-11-23 02:59:20,716 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2018-11-23 02:59:20,716 INFO L442 BuchiCegarLoop]: ======== Iteration 58============ [2018-11-23 02:59:20,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 96 transitions. [2018-11-23 02:59:20,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:20,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:20,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:20,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:20,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:20,717 INFO L794 eck$LassoCheckResult]: Stem: 13211#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 13212#L12 main_~i~0 := 0; 13213#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 13216#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 13217#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13221#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13274#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13273#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13272#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13271#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13270#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13269#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13268#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13267#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13266#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13265#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13264#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13263#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13262#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13261#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13260#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13259#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13258#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13257#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13256#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13255#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13254#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13253#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13252#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13251#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13250#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13249#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 13218#L21-2 assume main_~j~0 >= 100; 13215#L25 [2018-11-23 02:59:20,718 INFO L796 eck$LassoCheckResult]: Loop: 13215#L25 assume true; 13215#L25 [2018-11-23 02:59:20,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash 863424952, now seen corresponding path program 27 times [2018-11-23 02:59:20,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:20,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:20,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:20,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:20,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:20,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:20,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:20,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 02:59:20,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:20,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:21,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:21,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 02:59:21,006 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:21,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:21,006 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 57 times [2018-11-23 02:59:21,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:21,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 02:59:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 02:59:21,011 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. cyclomatic complexity: 35 Second operand 30 states. [2018-11-23 02:59:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:21,039 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2018-11-23 02:59:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 02:59:21,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 98 transitions. [2018-11-23 02:59:21,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:21,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 97 transitions. [2018-11-23 02:59:21,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:21,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:21,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 97 transitions. [2018-11-23 02:59:21,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:21,040 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2018-11-23 02:59:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 97 transitions. [2018-11-23 02:59:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 02:59:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 02:59:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2018-11-23 02:59:21,041 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2018-11-23 02:59:21,041 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2018-11-23 02:59:21,041 INFO L442 BuchiCegarLoop]: ======== Iteration 59============ [2018-11-23 02:59:21,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 97 transitions. [2018-11-23 02:59:21,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:21,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:21,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:21,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [29, 1, 1, 1, 1] [2018-11-23 02:59:21,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:21,041 INFO L794 eck$LassoCheckResult]: Stem: 13470#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 13471#L12 main_~i~0 := 0; 13472#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13478#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13479#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13534#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13532#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13530#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13528#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13526#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13524#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13522#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13520#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13518#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13516#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13514#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13512#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13510#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13508#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13506#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13504#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13502#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13500#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13498#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13496#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13494#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13492#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13490#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13488#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13486#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13484#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 13482#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 13473#L15-2 assume main_~i~0 >= 100; 13474#L25 [2018-11-23 02:59:21,042 INFO L796 eck$LassoCheckResult]: Loop: 13474#L25 assume true; 13474#L25 [2018-11-23 02:59:21,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:21,042 INFO L82 PathProgramCache]: Analyzing trace with hash -261596911, now seen corresponding path program 29 times [2018-11-23 02:59:21,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:21,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:21,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:21,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:21,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:21,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:21,297 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:21,311 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 02:59:21,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:21,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:21,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:21,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 02:59:21,331 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:21,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 58 times [2018-11-23 02:59:21,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:21,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 02:59:21,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 02:59:21,334 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. cyclomatic complexity: 35 Second operand 32 states. [2018-11-23 02:59:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:21,444 INFO L93 Difference]: Finished difference Result 565 states and 600 transitions. [2018-11-23 02:59:21,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 02:59:21,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 565 states and 600 transitions. [2018-11-23 02:59:21,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:21,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 565 states to 564 states and 599 transitions. [2018-11-23 02:59:21,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:21,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:21,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 599 transitions. [2018-11-23 02:59:21,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:21,446 INFO L705 BuchiCegarLoop]: Abstraction has 564 states and 599 transitions. [2018-11-23 02:59:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 599 transitions. [2018-11-23 02:59:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 66. [2018-11-23 02:59:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 02:59:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2018-11-23 02:59:21,448 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 99 transitions. [2018-11-23 02:59:21,448 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 99 transitions. [2018-11-23 02:59:21,448 INFO L442 BuchiCegarLoop]: ======== Iteration 60============ [2018-11-23 02:59:21,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 99 transitions. [2018-11-23 02:59:21,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:21,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:21,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:21,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [28, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:21,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:21,449 INFO L794 eck$LassoCheckResult]: Stem: 14231#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 14232#L12 main_~i~0 := 0; 14233#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 14236#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 14237#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14241#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14296#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14295#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14294#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14293#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14292#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14291#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14290#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14289#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14288#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14287#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14286#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14285#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14284#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14283#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14282#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14281#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14280#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14279#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14278#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14277#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14276#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14275#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14274#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14273#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14272#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14271#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14270#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 14238#L21-2 assume main_~j~0 >= 100; 14235#L25 [2018-11-23 02:59:21,449 INFO L796 eck$LassoCheckResult]: Loop: 14235#L25 assume true; 14235#L25 [2018-11-23 02:59:21,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash 996371446, now seen corresponding path program 28 times [2018-11-23 02:59:21,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:21,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:21,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:21,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:21,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:21,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:21,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:21,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:21,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:21,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:21,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:21,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-23 02:59:21,719 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:21,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 59 times [2018-11-23 02:59:21,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:21,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 02:59:21,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 02:59:21,722 INFO L87 Difference]: Start difference. First operand 66 states and 99 transitions. cyclomatic complexity: 36 Second operand 31 states. [2018-11-23 02:59:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:21,753 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2018-11-23 02:59:21,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 02:59:21,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 101 transitions. [2018-11-23 02:59:21,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:21,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 67 states and 100 transitions. [2018-11-23 02:59:21,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:21,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:21,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 100 transitions. [2018-11-23 02:59:21,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:21,754 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 100 transitions. [2018-11-23 02:59:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 100 transitions. [2018-11-23 02:59:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 02:59:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 02:59:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2018-11-23 02:59:21,755 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 100 transitions. [2018-11-23 02:59:21,755 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 100 transitions. [2018-11-23 02:59:21,755 INFO L442 BuchiCegarLoop]: ======== Iteration 61============ [2018-11-23 02:59:21,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 100 transitions. [2018-11-23 02:59:21,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:21,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:21,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:21,755 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [30, 1, 1, 1, 1] [2018-11-23 02:59:21,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:21,755 INFO L794 eck$LassoCheckResult]: Stem: 14498#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 14499#L12 main_~i~0 := 0; 14500#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14506#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14507#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14564#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14562#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14560#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14558#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14556#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14554#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14552#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14550#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14548#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14546#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14544#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14542#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14540#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14538#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14536#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14534#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14532#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14530#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14528#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14526#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14524#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14522#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14520#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14518#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14516#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14514#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14512#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 14510#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 14501#L15-2 assume main_~i~0 >= 100; 14502#L25 [2018-11-23 02:59:21,755 INFO L796 eck$LassoCheckResult]: Loop: 14502#L25 assume true; 14502#L25 [2018-11-23 02:59:21,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 480432043, now seen corresponding path program 30 times [2018-11-23 02:59:21,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:21,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:22,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:22,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:22,046 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:22,060 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-23 02:59:22,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:22,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:22,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:22,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-23 02:59:22,080 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:22,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 60 times [2018-11-23 02:59:22,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:22,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:22,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:22,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 02:59:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 02:59:22,083 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. cyclomatic complexity: 36 Second operand 33 states. [2018-11-23 02:59:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:22,177 INFO L93 Difference]: Finished difference Result 599 states and 635 transitions. [2018-11-23 02:59:22,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 02:59:22,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 635 transitions. [2018-11-23 02:59:22,179 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:22,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 598 states and 634 transitions. [2018-11-23 02:59:22,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:22,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:22,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 598 states and 634 transitions. [2018-11-23 02:59:22,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:22,181 INFO L705 BuchiCegarLoop]: Abstraction has 598 states and 634 transitions. [2018-11-23 02:59:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states and 634 transitions. [2018-11-23 02:59:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 68. [2018-11-23 02:59:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 02:59:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2018-11-23 02:59:22,183 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 102 transitions. [2018-11-23 02:59:22,183 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 102 transitions. [2018-11-23 02:59:22,183 INFO L442 BuchiCegarLoop]: ======== Iteration 62============ [2018-11-23 02:59:22,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 102 transitions. [2018-11-23 02:59:22,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:22,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:22,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:22,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [29, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:22,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:22,184 INFO L794 eck$LassoCheckResult]: Stem: 15299#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 15300#L12 main_~i~0 := 0; 15301#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 15304#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 15305#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15309#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15366#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15365#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15364#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15363#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15362#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15361#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15360#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15359#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15358#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15357#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15356#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15355#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15354#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15353#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15352#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15351#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15350#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15349#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15348#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15347#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15346#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15345#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15344#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15343#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15342#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15341#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15340#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15339#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 15306#L21-2 assume main_~j~0 >= 100; 15303#L25 [2018-11-23 02:59:22,184 INFO L796 eck$LassoCheckResult]: Loop: 15303#L25 assume true; 15303#L25 [2018-11-23 02:59:22,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 822745464, now seen corresponding path program 29 times [2018-11-23 02:59:22,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:22,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:22,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:22,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:22,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:22,442 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 02:59:22,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:22,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:22,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:22,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 02:59:22,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:22,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 61 times [2018-11-23 02:59:22,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:22,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 02:59:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 02:59:22,466 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. cyclomatic complexity: 37 Second operand 32 states. [2018-11-23 02:59:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:22,497 INFO L93 Difference]: Finished difference Result 70 states and 104 transitions. [2018-11-23 02:59:22,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 02:59:22,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 104 transitions. [2018-11-23 02:59:22,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:22,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 103 transitions. [2018-11-23 02:59:22,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:22,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:22,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 103 transitions. [2018-11-23 02:59:22,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:22,498 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 103 transitions. [2018-11-23 02:59:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 103 transitions. [2018-11-23 02:59:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 02:59:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 02:59:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2018-11-23 02:59:22,499 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 103 transitions. [2018-11-23 02:59:22,499 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 103 transitions. [2018-11-23 02:59:22,499 INFO L442 BuchiCegarLoop]: ======== Iteration 63============ [2018-11-23 02:59:22,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 103 transitions. [2018-11-23 02:59:22,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:22,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:22,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:22,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [31, 1, 1, 1, 1] [2018-11-23 02:59:22,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:22,499 INFO L794 eck$LassoCheckResult]: Stem: 15574#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 15575#L12 main_~i~0 := 0; 15576#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15582#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15583#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15642#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15640#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15638#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15636#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15634#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15632#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15630#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15628#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15626#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15624#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15622#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15620#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15618#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15616#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15614#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15612#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15610#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15608#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15606#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15604#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15602#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15600#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15598#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15596#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15594#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15592#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15590#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15588#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 15586#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 15577#L15-2 assume main_~i~0 >= 100; 15578#L25 [2018-11-23 02:59:22,499 INFO L796 eck$LassoCheckResult]: Loop: 15578#L25 assume true; 15578#L25 [2018-11-23 02:59:22,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2008493137, now seen corresponding path program 31 times [2018-11-23 02:59:22,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:22,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:22,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:22,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:22,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:22,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:22,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 02:59:22,822 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:22,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 62 times [2018-11-23 02:59:22,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:22,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 02:59:22,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 02:59:22,824 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. cyclomatic complexity: 37 Second operand 34 states. [2018-11-23 02:59:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:22,965 INFO L93 Difference]: Finished difference Result 634 states and 671 transitions. [2018-11-23 02:59:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 02:59:22,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 634 states and 671 transitions. [2018-11-23 02:59:22,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:22,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 634 states to 633 states and 670 transitions. [2018-11-23 02:59:22,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:22,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:22,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 633 states and 670 transitions. [2018-11-23 02:59:22,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:22,970 INFO L705 BuchiCegarLoop]: Abstraction has 633 states and 670 transitions. [2018-11-23 02:59:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states and 670 transitions. [2018-11-23 02:59:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 70. [2018-11-23 02:59:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 02:59:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2018-11-23 02:59:22,973 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 105 transitions. [2018-11-23 02:59:22,973 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 105 transitions. [2018-11-23 02:59:22,973 INFO L442 BuchiCegarLoop]: ======== Iteration 64============ [2018-11-23 02:59:22,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 105 transitions. [2018-11-23 02:59:22,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:22,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:22,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:22,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [30, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:22,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:22,974 INFO L794 eck$LassoCheckResult]: Stem: 16416#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 16417#L12 main_~i~0 := 0; 16418#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 16421#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 16422#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16426#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16485#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16484#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16483#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16482#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16481#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16480#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16479#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16478#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16477#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16476#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16475#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16474#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16473#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16472#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16471#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16470#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16469#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16468#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16467#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16466#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16465#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16464#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16463#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16462#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16461#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16460#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16459#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16458#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16457#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 16423#L21-2 assume main_~j~0 >= 100; 16420#L25 [2018-11-23 02:59:22,974 INFO L796 eck$LassoCheckResult]: Loop: 16420#L25 assume true; 16420#L25 [2018-11-23 02:59:22,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash -264692682, now seen corresponding path program 30 times [2018-11-23 02:59:22,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:22,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:22,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:22,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:23,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:23,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:23,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:23,349 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-23 02:59:23,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:23,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:23,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:23,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-23 02:59:23,382 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:23,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 63 times [2018-11-23 02:59:23,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:23,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 02:59:23,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 02:59:23,397 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. cyclomatic complexity: 38 Second operand 33 states. [2018-11-23 02:59:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:23,428 INFO L93 Difference]: Finished difference Result 72 states and 107 transitions. [2018-11-23 02:59:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 02:59:23,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 107 transitions. [2018-11-23 02:59:23,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:23,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 71 states and 106 transitions. [2018-11-23 02:59:23,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:23,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:23,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 106 transitions. [2018-11-23 02:59:23,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:23,430 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 106 transitions. [2018-11-23 02:59:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 106 transitions. [2018-11-23 02:59:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-23 02:59:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 02:59:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2018-11-23 02:59:23,431 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 106 transitions. [2018-11-23 02:59:23,431 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 106 transitions. [2018-11-23 02:59:23,431 INFO L442 BuchiCegarLoop]: ======== Iteration 65============ [2018-11-23 02:59:23,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 106 transitions. [2018-11-23 02:59:23,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:23,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:23,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:23,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [32, 1, 1, 1, 1] [2018-11-23 02:59:23,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:23,432 INFO L794 eck$LassoCheckResult]: Stem: 16699#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 16700#L12 main_~i~0 := 0; 16701#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16707#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16708#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16769#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16767#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16765#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16763#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16761#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16759#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16757#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16755#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16753#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16751#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16749#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16747#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16745#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16743#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16741#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16739#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16737#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16735#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16733#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16731#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16729#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16727#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16725#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16723#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16721#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16719#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16717#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16715#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16713#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 16711#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 16702#L15-2 assume main_~i~0 >= 100; 16703#L25 [2018-11-23 02:59:23,432 INFO L796 eck$LassoCheckResult]: Loop: 16703#L25 assume true; 16703#L25 [2018-11-23 02:59:23,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:23,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2133746795, now seen corresponding path program 32 times [2018-11-23 02:59:23,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:23,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:23,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:23,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:23,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:23,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:23,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:23,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:23,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:23,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-23 02:59:23,858 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:23,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 64 times [2018-11-23 02:59:23,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:23,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:23,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:23,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 02:59:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 02:59:23,861 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. cyclomatic complexity: 38 Second operand 35 states. [2018-11-23 02:59:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:23,979 INFO L93 Difference]: Finished difference Result 670 states and 708 transitions. [2018-11-23 02:59:23,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 02:59:23,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 708 transitions. [2018-11-23 02:59:23,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:23,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 669 states and 707 transitions. [2018-11-23 02:59:23,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:23,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:23,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 669 states and 707 transitions. [2018-11-23 02:59:23,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:23,982 INFO L705 BuchiCegarLoop]: Abstraction has 669 states and 707 transitions. [2018-11-23 02:59:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states and 707 transitions. [2018-11-23 02:59:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 72. [2018-11-23 02:59:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 02:59:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2018-11-23 02:59:23,983 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 108 transitions. [2018-11-23 02:59:23,983 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 108 transitions. [2018-11-23 02:59:23,983 INFO L442 BuchiCegarLoop]: ======== Iteration 66============ [2018-11-23 02:59:23,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 108 transitions. [2018-11-23 02:59:23,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:23,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:23,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:23,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [31, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:23,984 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:23,984 INFO L794 eck$LassoCheckResult]: Stem: 17583#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 17584#L12 main_~i~0 := 0; 17585#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 17588#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 17589#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17593#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17654#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17653#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17652#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17651#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17650#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17649#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17648#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17647#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17646#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17645#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17644#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17643#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17642#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17641#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17640#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17639#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17638#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17637#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17636#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17635#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17634#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17633#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17632#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17631#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17630#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17629#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17628#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17627#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17626#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 17625#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 17590#L21-2 assume main_~j~0 >= 100; 17587#L25 [2018-11-23 02:59:23,984 INFO L796 eck$LassoCheckResult]: Loop: 17587#L25 assume true; 17587#L25 [2018-11-23 02:59:23,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:23,984 INFO L82 PathProgramCache]: Analyzing trace with hash 384463160, now seen corresponding path program 31 times [2018-11-23 02:59:23,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:23,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:24,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:24,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:24,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:24,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:24,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:24,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 02:59:24,366 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:24,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 65 times [2018-11-23 02:59:24,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:24,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 02:59:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 02:59:24,369 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. cyclomatic complexity: 39 Second operand 34 states. [2018-11-23 02:59:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:24,396 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2018-11-23 02:59:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 02:59:24,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 110 transitions. [2018-11-23 02:59:24,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:24,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 109 transitions. [2018-11-23 02:59:24,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:24,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:24,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 109 transitions. [2018-11-23 02:59:24,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:24,397 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 109 transitions. [2018-11-23 02:59:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 109 transitions. [2018-11-23 02:59:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-23 02:59:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 02:59:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2018-11-23 02:59:24,398 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 109 transitions. [2018-11-23 02:59:24,398 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 109 transitions. [2018-11-23 02:59:24,398 INFO L442 BuchiCegarLoop]: ======== Iteration 67============ [2018-11-23 02:59:24,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 109 transitions. [2018-11-23 02:59:24,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:24,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:24,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:24,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [33, 1, 1, 1, 1] [2018-11-23 02:59:24,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:24,398 INFO L794 eck$LassoCheckResult]: Stem: 17874#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 17875#L12 main_~i~0 := 0; 17876#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17882#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17883#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17946#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17944#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17942#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17940#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17938#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17936#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17934#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17932#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17930#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17928#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17926#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17924#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17922#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17920#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17918#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17916#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17914#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17912#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17910#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17908#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17906#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17904#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17902#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17900#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17898#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17896#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17894#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17892#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17890#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17888#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 17886#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 17877#L15-2 assume main_~i~0 >= 100; 17878#L25 [2018-11-23 02:59:24,398 INFO L796 eck$LassoCheckResult]: Loop: 17878#L25 assume true; 17878#L25 [2018-11-23 02:59:24,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1721642897, now seen corresponding path program 33 times [2018-11-23 02:59:24,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:24,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:24,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:24,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:24,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:24,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:24,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:24,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 02:59:24,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:24,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:24,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:24,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-23 02:59:24,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:24,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:24,771 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 66 times [2018-11-23 02:59:24,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:24,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:24,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 02:59:24,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 02:59:24,773 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. cyclomatic complexity: 39 Second operand 36 states. [2018-11-23 02:59:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:24,897 INFO L93 Difference]: Finished difference Result 707 states and 746 transitions. [2018-11-23 02:59:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 02:59:24,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 707 states and 746 transitions. [2018-11-23 02:59:24,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:24,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 707 states to 706 states and 745 transitions. [2018-11-23 02:59:24,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:24,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:24,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 706 states and 745 transitions. [2018-11-23 02:59:24,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:24,901 INFO L705 BuchiCegarLoop]: Abstraction has 706 states and 745 transitions. [2018-11-23 02:59:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states and 745 transitions. [2018-11-23 02:59:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 74. [2018-11-23 02:59:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 02:59:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2018-11-23 02:59:24,904 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 111 transitions. [2018-11-23 02:59:24,904 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 111 transitions. [2018-11-23 02:59:24,904 INFO L442 BuchiCegarLoop]: ======== Iteration 68============ [2018-11-23 02:59:24,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 111 transitions. [2018-11-23 02:59:24,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:24,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:24,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:24,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [32, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:24,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:24,905 INFO L794 eck$LassoCheckResult]: Stem: 18801#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 18802#L12 main_~i~0 := 0; 18803#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 18806#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 18807#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18811#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18874#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18873#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18872#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18871#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18870#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18869#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18868#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18867#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18866#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18865#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18864#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18863#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18862#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18861#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18860#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18859#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18858#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18857#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18856#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18855#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18854#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18853#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18852#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18851#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18850#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18849#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18848#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18847#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18846#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18845#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 18844#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 18808#L21-2 assume main_~j~0 >= 100; 18805#L25 [2018-11-23 02:59:24,905 INFO L796 eck$LassoCheckResult]: Loop: 18805#L25 assume true; 18805#L25 [2018-11-23 02:59:24,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -966542218, now seen corresponding path program 32 times [2018-11-23 02:59:24,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:24,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:25,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:25,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:25,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:25,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:25,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:25,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:25,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:25,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-23 02:59:25,277 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:25,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 67 times [2018-11-23 02:59:25,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 02:59:25,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 02:59:25,279 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. cyclomatic complexity: 40 Second operand 35 states. [2018-11-23 02:59:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:25,310 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2018-11-23 02:59:25,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 02:59:25,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 113 transitions. [2018-11-23 02:59:25,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:25,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 112 transitions. [2018-11-23 02:59:25,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:25,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:25,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 112 transitions. [2018-11-23 02:59:25,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:25,312 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 112 transitions. [2018-11-23 02:59:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 112 transitions. [2018-11-23 02:59:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 02:59:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 02:59:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2018-11-23 02:59:25,313 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 112 transitions. [2018-11-23 02:59:25,313 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 112 transitions. [2018-11-23 02:59:25,313 INFO L442 BuchiCegarLoop]: ======== Iteration 69============ [2018-11-23 02:59:25,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 112 transitions. [2018-11-23 02:59:25,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:25,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:25,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:25,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [34, 1, 1, 1, 1] [2018-11-23 02:59:25,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:25,314 INFO L794 eck$LassoCheckResult]: Stem: 19100#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 19101#L12 main_~i~0 := 0; 19102#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19108#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19109#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19174#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19172#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19170#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19168#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19166#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19164#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19162#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19160#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19158#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19156#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19154#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19152#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19150#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19148#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19146#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19144#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19142#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19140#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19138#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19136#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19134#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19132#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19130#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19128#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19126#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19124#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19122#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19120#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19118#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19116#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19114#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 19112#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 19103#L15-2 assume main_~i~0 >= 100; 19104#L25 [2018-11-23 02:59:25,314 INFO L796 eck$LassoCheckResult]: Loop: 19104#L25 assume true; 19104#L25 [2018-11-23 02:59:25,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1831323947, now seen corresponding path program 34 times [2018-11-23 02:59:25,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:25,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:25,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:25,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:25,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:25,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:25,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:25,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:25,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-23 02:59:25,645 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:25,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 68 times [2018-11-23 02:59:25,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:25,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 02:59:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 02:59:25,658 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. cyclomatic complexity: 40 Second operand 37 states. [2018-11-23 02:59:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:25,776 INFO L93 Difference]: Finished difference Result 745 states and 785 transitions. [2018-11-23 02:59:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 02:59:25,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 745 states and 785 transitions. [2018-11-23 02:59:25,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:25,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 745 states to 744 states and 784 transitions. [2018-11-23 02:59:25,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:25,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:25,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 784 transitions. [2018-11-23 02:59:25,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:25,780 INFO L705 BuchiCegarLoop]: Abstraction has 744 states and 784 transitions. [2018-11-23 02:59:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 784 transitions. [2018-11-23 02:59:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 76. [2018-11-23 02:59:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 02:59:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2018-11-23 02:59:25,782 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-11-23 02:59:25,782 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-11-23 02:59:25,782 INFO L442 BuchiCegarLoop]: ======== Iteration 70============ [2018-11-23 02:59:25,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 114 transitions. [2018-11-23 02:59:25,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:25,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:25,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:25,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [33, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:25,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:25,783 INFO L794 eck$LassoCheckResult]: Stem: 20071#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 20072#L12 main_~i~0 := 0; 20073#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 20076#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 20077#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20081#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20146#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20145#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20144#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20143#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20142#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20141#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20140#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20139#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20138#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20137#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20136#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20135#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20134#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20133#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20132#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20131#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20130#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20129#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20128#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20127#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20126#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20125#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20124#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20123#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20122#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20121#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20120#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20119#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20118#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20117#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20116#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 20115#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 20078#L21-2 assume main_~j~0 >= 100; 20075#L25 [2018-11-23 02:59:25,783 INFO L796 eck$LassoCheckResult]: Loop: 20075#L25 assume true; 20075#L25 [2018-11-23 02:59:25,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 101964024, now seen corresponding path program 33 times [2018-11-23 02:59:25,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:25,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:26,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:26,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:26,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:26,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 02:59:26,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:26,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:26,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:26,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-23 02:59:26,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:26,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 69 times [2018-11-23 02:59:26,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 02:59:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 02:59:26,164 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. cyclomatic complexity: 41 Second operand 36 states. [2018-11-23 02:59:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:26,192 INFO L93 Difference]: Finished difference Result 78 states and 116 transitions. [2018-11-23 02:59:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 02:59:26,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 116 transitions. [2018-11-23 02:59:26,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:26,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 77 states and 115 transitions. [2018-11-23 02:59:26,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:26,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:26,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 115 transitions. [2018-11-23 02:59:26,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:26,193 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2018-11-23 02:59:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 115 transitions. [2018-11-23 02:59:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-23 02:59:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 02:59:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2018-11-23 02:59:26,193 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2018-11-23 02:59:26,193 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2018-11-23 02:59:26,193 INFO L442 BuchiCegarLoop]: ======== Iteration 71============ [2018-11-23 02:59:26,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 115 transitions. [2018-11-23 02:59:26,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:26,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:26,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:26,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [35, 1, 1, 1, 1] [2018-11-23 02:59:26,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:26,194 INFO L794 eck$LassoCheckResult]: Stem: 20378#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 20379#L12 main_~i~0 := 0; 20380#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20386#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20387#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20454#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20452#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20450#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20448#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20446#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20444#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20442#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20440#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20438#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20436#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20434#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20432#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20430#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20428#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20426#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20424#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20422#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20420#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20418#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20416#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20414#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20412#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20410#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20408#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20406#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20404#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20402#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20400#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20398#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20396#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20394#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20392#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 20390#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 20381#L15-2 assume main_~i~0 >= 100; 20382#L25 [2018-11-23 02:59:26,194 INFO L796 eck$LassoCheckResult]: Loop: 20382#L25 assume true; 20382#L25 [2018-11-23 02:59:26,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash 936469201, now seen corresponding path program 35 times [2018-11-23 02:59:26,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:26,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:26,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:26,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:26,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:26,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:26,536 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:26,552 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 02:59:26,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:26,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:26,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:26,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-23 02:59:26,572 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:26,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 70 times [2018-11-23 02:59:26,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:26,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:26,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 02:59:26,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 02:59:26,586 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. cyclomatic complexity: 41 Second operand 38 states. [2018-11-23 02:59:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:26,700 INFO L93 Difference]: Finished difference Result 784 states and 825 transitions. [2018-11-23 02:59:26,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 02:59:26,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 784 states and 825 transitions. [2018-11-23 02:59:26,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:26,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 784 states to 783 states and 824 transitions. [2018-11-23 02:59:26,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:26,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:26,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 783 states and 824 transitions. [2018-11-23 02:59:26,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:26,704 INFO L705 BuchiCegarLoop]: Abstraction has 783 states and 824 transitions. [2018-11-23 02:59:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states and 824 transitions. [2018-11-23 02:59:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 78. [2018-11-23 02:59:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 02:59:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 117 transitions. [2018-11-23 02:59:26,707 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 117 transitions. [2018-11-23 02:59:26,707 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 117 transitions. [2018-11-23 02:59:26,707 INFO L442 BuchiCegarLoop]: ======== Iteration 72============ [2018-11-23 02:59:26,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 117 transitions. [2018-11-23 02:59:26,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:26,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:26,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:26,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [34, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:26,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:26,708 INFO L794 eck$LassoCheckResult]: Stem: 21394#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 21395#L12 main_~i~0 := 0; 21396#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 21399#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 21400#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21404#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21471#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21470#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21469#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21468#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21467#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21466#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21465#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21464#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21463#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21462#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21461#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21460#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21459#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21458#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21457#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21456#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21455#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21454#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21453#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21452#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21451#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21450#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21449#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21448#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21447#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21446#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21445#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21444#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21443#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21442#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21441#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21440#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 21439#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 21401#L21-2 assume main_~j~0 >= 100; 21398#L25 [2018-11-23 02:59:26,708 INFO L796 eck$LassoCheckResult]: Loop: 21398#L25 assume true; 21398#L25 [2018-11-23 02:59:26,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1134080842, now seen corresponding path program 34 times [2018-11-23 02:59:26,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:26,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:26,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:27,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:27,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:27,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:27,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:27,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:27,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:27,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:27,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-23 02:59:27,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:27,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 71 times [2018-11-23 02:59:27,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:27,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:27,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 02:59:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 02:59:27,097 INFO L87 Difference]: Start difference. First operand 78 states and 117 transitions. cyclomatic complexity: 42 Second operand 37 states. [2018-11-23 02:59:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:27,117 INFO L93 Difference]: Finished difference Result 80 states and 119 transitions. [2018-11-23 02:59:27,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 02:59:27,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 119 transitions. [2018-11-23 02:59:27,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:27,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 79 states and 118 transitions. [2018-11-23 02:59:27,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:27,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:27,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 118 transitions. [2018-11-23 02:59:27,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:27,118 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 118 transitions. [2018-11-23 02:59:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 118 transitions. [2018-11-23 02:59:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 02:59:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 02:59:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2018-11-23 02:59:27,118 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 118 transitions. [2018-11-23 02:59:27,119 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 118 transitions. [2018-11-23 02:59:27,119 INFO L442 BuchiCegarLoop]: ======== Iteration 73============ [2018-11-23 02:59:27,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 118 transitions. [2018-11-23 02:59:27,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:27,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:27,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:27,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [36, 1, 1, 1, 1] [2018-11-23 02:59:27,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:27,119 INFO L794 eck$LassoCheckResult]: Stem: 21709#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 21710#L12 main_~i~0 := 0; 21711#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21717#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21718#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21787#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21785#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21783#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21781#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21779#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21777#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21775#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21773#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21771#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21769#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21767#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21765#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21763#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21761#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21759#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21757#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21755#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21753#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21751#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21749#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21747#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21745#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21743#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21741#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21739#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21737#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21735#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21733#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21731#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21729#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21727#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21725#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21723#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 21721#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 21712#L15-2 assume main_~i~0 >= 100; 21713#L25 [2018-11-23 02:59:27,119 INFO L796 eck$LassoCheckResult]: Loop: 21713#L25 assume true; 21713#L25 [2018-11-23 02:59:27,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1034224149, now seen corresponding path program 36 times [2018-11-23 02:59:27,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:27,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:27,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:27,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:27,478 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:27,494 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 02:59:27,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:27,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:27,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:27,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-11-23 02:59:27,515 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:27,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 72 times [2018-11-23 02:59:27,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:27,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 02:59:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 02:59:27,518 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. cyclomatic complexity: 42 Second operand 39 states. [2018-11-23 02:59:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:27,640 INFO L93 Difference]: Finished difference Result 824 states and 866 transitions. [2018-11-23 02:59:27,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 02:59:27,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 824 states and 866 transitions. [2018-11-23 02:59:27,642 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:27,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 824 states to 823 states and 865 transitions. [2018-11-23 02:59:27,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:27,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:27,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 823 states and 865 transitions. [2018-11-23 02:59:27,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:27,645 INFO L705 BuchiCegarLoop]: Abstraction has 823 states and 865 transitions. [2018-11-23 02:59:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states and 865 transitions. [2018-11-23 02:59:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 80. [2018-11-23 02:59:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 02:59:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2018-11-23 02:59:27,647 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 120 transitions. [2018-11-23 02:59:27,647 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 120 transitions. [2018-11-23 02:59:27,647 INFO L442 BuchiCegarLoop]: ======== Iteration 74============ [2018-11-23 02:59:27,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 120 transitions. [2018-11-23 02:59:27,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:27,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:27,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:27,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [35, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:27,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:27,648 INFO L794 eck$LassoCheckResult]: Stem: 22771#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 22772#L12 main_~i~0 := 0; 22773#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 22776#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 22777#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22781#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22850#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22849#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22848#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22847#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22846#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22845#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22844#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22843#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22842#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22841#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22840#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22839#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22838#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22837#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22836#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22835#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22834#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22833#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22832#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22831#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22830#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22829#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22828#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22827#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22826#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22825#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22824#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22823#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22822#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22821#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22820#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22819#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22818#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22817#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 22778#L21-2 assume main_~j~0 >= 100; 22775#L25 [2018-11-23 02:59:27,648 INFO L796 eck$LassoCheckResult]: Loop: 22775#L25 assume true; 22775#L25 [2018-11-23 02:59:27,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash -796766024, now seen corresponding path program 35 times [2018-11-23 02:59:27,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:27,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:27,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:27,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:27,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:27,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:27,962 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:28,001 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 02:59:28,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:28,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:28,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:28,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-23 02:59:28,021 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:28,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 73 times [2018-11-23 02:59:28,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:28,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 02:59:28,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 02:59:28,024 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. cyclomatic complexity: 43 Second operand 38 states. [2018-11-23 02:59:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:28,060 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2018-11-23 02:59:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 02:59:28,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 122 transitions. [2018-11-23 02:59:28,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:28,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 81 states and 121 transitions. [2018-11-23 02:59:28,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:28,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:28,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 121 transitions. [2018-11-23 02:59:28,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:28,061 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 121 transitions. [2018-11-23 02:59:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 121 transitions. [2018-11-23 02:59:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 02:59:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 02:59:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2018-11-23 02:59:28,061 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 121 transitions. [2018-11-23 02:59:28,061 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 121 transitions. [2018-11-23 02:59:28,061 INFO L442 BuchiCegarLoop]: ======== Iteration 75============ [2018-11-23 02:59:28,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 121 transitions. [2018-11-23 02:59:28,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:28,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:28,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:28,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 1, 1, 1, 1] [2018-11-23 02:59:28,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:28,062 INFO L794 eck$LassoCheckResult]: Stem: 23094#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 23095#L12 main_~i~0 := 0; 23096#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23102#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23103#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23174#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23172#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23170#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23168#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23166#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23164#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23162#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23160#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23158#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23156#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23154#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23152#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23150#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23148#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23146#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23144#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23142#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23140#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23138#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23136#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23134#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23132#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23130#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23128#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23126#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23124#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23122#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23120#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23118#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23116#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23114#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23112#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23110#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23108#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 23106#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 23097#L15-2 assume main_~i~0 >= 100; 23098#L25 [2018-11-23 02:59:28,062 INFO L796 eck$LassoCheckResult]: Loop: 23098#L25 assume true; 23098#L25 [2018-11-23 02:59:28,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1996175855, now seen corresponding path program 37 times [2018-11-23 02:59:28,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:28,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:28,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:28,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:28,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:28,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:28,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:28,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:28,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-11-23 02:59:28,483 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:28,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 74 times [2018-11-23 02:59:28,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:28,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:28,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 02:59:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 02:59:28,488 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. cyclomatic complexity: 43 Second operand 40 states. [2018-11-23 02:59:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:28,646 INFO L93 Difference]: Finished difference Result 865 states and 908 transitions. [2018-11-23 02:59:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 02:59:28,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 865 states and 908 transitions. [2018-11-23 02:59:28,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:28,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 865 states to 864 states and 907 transitions. [2018-11-23 02:59:28,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:28,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:28,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 864 states and 907 transitions. [2018-11-23 02:59:28,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:28,651 INFO L705 BuchiCegarLoop]: Abstraction has 864 states and 907 transitions. [2018-11-23 02:59:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states and 907 transitions. [2018-11-23 02:59:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 82. [2018-11-23 02:59:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 02:59:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2018-11-23 02:59:28,654 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 123 transitions. [2018-11-23 02:59:28,654 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 123 transitions. [2018-11-23 02:59:28,654 INFO L442 BuchiCegarLoop]: ======== Iteration 76============ [2018-11-23 02:59:28,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 123 transitions. [2018-11-23 02:59:28,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:28,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:28,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:28,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [36, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:28,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:28,655 INFO L794 eck$LassoCheckResult]: Stem: 24203#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 24204#L12 main_~i~0 := 0; 24205#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 24208#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 24209#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24213#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24284#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24283#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24282#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24281#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24280#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24279#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24278#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24277#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24276#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24275#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24274#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24273#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24272#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24271#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24270#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24269#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24268#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24267#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24266#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24265#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24264#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24263#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24262#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24261#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24260#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24259#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24258#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24257#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24256#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24255#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24254#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24253#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24252#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24251#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 24250#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 24210#L21-2 assume main_~j~0 >= 100; 24207#L25 [2018-11-23 02:59:28,655 INFO L796 eck$LassoCheckResult]: Loop: 24207#L25 assume true; 24207#L25 [2018-11-23 02:59:28,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1070058742, now seen corresponding path program 36 times [2018-11-23 02:59:28,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:28,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:28,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:28,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:28,986 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:59:29,009 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 02:59:29,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:29,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:29,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:29,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-11-23 02:59:29,030 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:29,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 75 times [2018-11-23 02:59:29,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:29,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:29,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:29,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 02:59:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 02:59:29,033 INFO L87 Difference]: Start difference. First operand 82 states and 123 transitions. cyclomatic complexity: 44 Second operand 39 states. [2018-11-23 02:59:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:29,055 INFO L93 Difference]: Finished difference Result 84 states and 125 transitions. [2018-11-23 02:59:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 02:59:29,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 125 transitions. [2018-11-23 02:59:29,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:29,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 83 states and 124 transitions. [2018-11-23 02:59:29,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:29,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:29,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 124 transitions. [2018-11-23 02:59:29,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:29,056 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 124 transitions. [2018-11-23 02:59:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 124 transitions. [2018-11-23 02:59:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 02:59:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 02:59:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2018-11-23 02:59:29,057 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 124 transitions. [2018-11-23 02:59:29,057 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 124 transitions. [2018-11-23 02:59:29,057 INFO L442 BuchiCegarLoop]: ======== Iteration 77============ [2018-11-23 02:59:29,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 124 transitions. [2018-11-23 02:59:29,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:29,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:29,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:29,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [38, 1, 1, 1, 1] [2018-11-23 02:59:29,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:29,058 INFO L794 eck$LassoCheckResult]: Stem: 24534#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 24535#L12 main_~i~0 := 0; 24536#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24542#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24543#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24616#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24614#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24612#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24610#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24608#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24606#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24604#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24602#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24600#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24598#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24596#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24594#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24592#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24590#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24588#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24586#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24584#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24582#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24580#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24578#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24576#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24574#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24572#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24570#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24568#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24566#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24564#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24562#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24560#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24558#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24556#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24554#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24552#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24550#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24548#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 24546#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 24537#L15-2 assume main_~i~0 >= 100; 24538#L25 [2018-11-23 02:59:29,058 INFO L796 eck$LassoCheckResult]: Loop: 24538#L25 assume true; 24538#L25 [2018-11-23 02:59:29,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1751907669, now seen corresponding path program 38 times [2018-11-23 02:59:29,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:29,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:29,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:29,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:29,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:29,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:29,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:29,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:29,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:29,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:29,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-11-23 02:59:29,456 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:29,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 76 times [2018-11-23 02:59:29,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 02:59:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 02:59:29,460 INFO L87 Difference]: Start difference. First operand 83 states and 124 transitions. cyclomatic complexity: 44 Second operand 41 states. [2018-11-23 02:59:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:29,609 INFO L93 Difference]: Finished difference Result 907 states and 951 transitions. [2018-11-23 02:59:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 02:59:29,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 907 states and 951 transitions. [2018-11-23 02:59:29,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:29,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 907 states to 906 states and 950 transitions. [2018-11-23 02:59:29,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:29,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:29,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 906 states and 950 transitions. [2018-11-23 02:59:29,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:29,615 INFO L705 BuchiCegarLoop]: Abstraction has 906 states and 950 transitions. [2018-11-23 02:59:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states and 950 transitions. [2018-11-23 02:59:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 84. [2018-11-23 02:59:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 02:59:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2018-11-23 02:59:29,617 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 126 transitions. [2018-11-23 02:59:29,618 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 126 transitions. [2018-11-23 02:59:29,618 INFO L442 BuchiCegarLoop]: ======== Iteration 78============ [2018-11-23 02:59:29,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 126 transitions. [2018-11-23 02:59:29,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:29,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:29,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:29,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:29,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:29,618 INFO L794 eck$LassoCheckResult]: Stem: 25691#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 25692#L12 main_~i~0 := 0; 25693#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 25696#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 25697#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25701#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25774#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25773#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25772#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25771#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25770#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25769#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25768#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25767#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25766#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25765#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25764#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25763#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25762#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25761#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25760#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25759#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25758#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25757#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25756#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25755#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25754#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25753#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25752#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25751#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25750#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25749#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25748#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25747#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25746#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25745#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25744#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25743#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25742#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25741#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25740#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 25739#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 25698#L21-2 assume main_~j~0 >= 100; 25695#L25 [2018-11-23 02:59:29,619 INFO L796 eck$LassoCheckResult]: Loop: 25695#L25 assume true; 25695#L25 [2018-11-23 02:59:29,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:29,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1187915656, now seen corresponding path program 37 times [2018-11-23 02:59:29,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:29,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:29,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:29,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:29,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:29,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:29,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:29,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:30,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:30,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-11-23 02:59:30,004 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:30,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:30,004 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 77 times [2018-11-23 02:59:30,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:30,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 02:59:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 02:59:30,007 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. cyclomatic complexity: 45 Second operand 40 states. [2018-11-23 02:59:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:30,037 INFO L93 Difference]: Finished difference Result 86 states and 128 transitions. [2018-11-23 02:59:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 02:59:30,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 128 transitions. [2018-11-23 02:59:30,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:30,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 85 states and 127 transitions. [2018-11-23 02:59:30,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:30,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:30,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 127 transitions. [2018-11-23 02:59:30,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:30,038 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-11-23 02:59:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 127 transitions. [2018-11-23 02:59:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-23 02:59:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 02:59:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-11-23 02:59:30,039 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-11-23 02:59:30,039 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-11-23 02:59:30,039 INFO L442 BuchiCegarLoop]: ======== Iteration 79============ [2018-11-23 02:59:30,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 127 transitions. [2018-11-23 02:59:30,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:30,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:30,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:30,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [39, 1, 1, 1, 1] [2018-11-23 02:59:30,040 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:30,040 INFO L794 eck$LassoCheckResult]: Stem: 26030#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 26031#L12 main_~i~0 := 0; 26032#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26038#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26039#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26114#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26112#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26110#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26108#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26106#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26104#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26102#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26100#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26098#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26096#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26094#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26092#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26090#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26088#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26086#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26084#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26082#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26080#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26078#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26076#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26074#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26072#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26070#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26068#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26066#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26064#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26062#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26060#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26058#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26056#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26054#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26052#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26050#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26048#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26046#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26044#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 26042#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 26033#L15-2 assume main_~i~0 >= 100; 26034#L25 [2018-11-23 02:59:30,040 INFO L796 eck$LassoCheckResult]: Loop: 26034#L25 assume true; 26034#L25 [2018-11-23 02:59:30,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1525438801, now seen corresponding path program 39 times [2018-11-23 02:59:30,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:30,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:30,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:30,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:30,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:30,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 02:59:30,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:30,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-11-23 02:59:30,493 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:30,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 78 times [2018-11-23 02:59:30,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:30,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:30,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:30,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:30,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 02:59:30,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 02:59:30,497 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. cyclomatic complexity: 45 Second operand 42 states. [2018-11-23 02:59:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:30,670 INFO L93 Difference]: Finished difference Result 950 states and 995 transitions. [2018-11-23 02:59:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 02:59:30,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 950 states and 995 transitions. [2018-11-23 02:59:30,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:30,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 950 states to 949 states and 994 transitions. [2018-11-23 02:59:30,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:30,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:30,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 949 states and 994 transitions. [2018-11-23 02:59:30,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:30,676 INFO L705 BuchiCegarLoop]: Abstraction has 949 states and 994 transitions. [2018-11-23 02:59:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states and 994 transitions. [2018-11-23 02:59:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 86. [2018-11-23 02:59:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 02:59:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2018-11-23 02:59:30,678 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2018-11-23 02:59:30,679 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2018-11-23 02:59:30,679 INFO L442 BuchiCegarLoop]: ======== Iteration 80============ [2018-11-23 02:59:30,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 129 transitions. [2018-11-23 02:59:30,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:30,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:30,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:30,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [38, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:30,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:30,680 INFO L794 eck$LassoCheckResult]: Stem: 27236#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 27237#L12 main_~i~0 := 0; 27238#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 27241#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 27242#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27246#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27321#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27320#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27319#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27318#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27317#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27316#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27315#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27314#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27313#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27312#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27311#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27310#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27309#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27308#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27307#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27306#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27305#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27304#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27303#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27302#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27301#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27300#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27299#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27298#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27297#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27296#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27295#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27294#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27293#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27292#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27291#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27290#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27289#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27288#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27287#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27286#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 27285#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 27243#L21-2 assume main_~j~0 >= 100; 27240#L25 [2018-11-23 02:59:30,680 INFO L796 eck$LassoCheckResult]: Loop: 27240#L25 assume true; 27240#L25 [2018-11-23 02:59:30,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:30,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1829322038, now seen corresponding path program 38 times [2018-11-23 02:59:30,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:30,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:30,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:31,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:31,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:31,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:59:31,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:59:31,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:31,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:31,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:31,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-11-23 02:59:31,088 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:31,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:31,089 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 79 times [2018-11-23 02:59:31,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:31,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:31,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:31,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 02:59:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 02:59:31,091 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. cyclomatic complexity: 46 Second operand 41 states. [2018-11-23 02:59:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:31,140 INFO L93 Difference]: Finished difference Result 88 states and 131 transitions. [2018-11-23 02:59:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 02:59:31,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 131 transitions. [2018-11-23 02:59:31,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:31,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 130 transitions. [2018-11-23 02:59:31,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:31,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:31,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 130 transitions. [2018-11-23 02:59:31,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:31,141 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-11-23 02:59:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 130 transitions. [2018-11-23 02:59:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-23 02:59:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 02:59:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-11-23 02:59:31,142 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-11-23 02:59:31,142 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-11-23 02:59:31,142 INFO L442 BuchiCegarLoop]: ======== Iteration 81============ [2018-11-23 02:59:31,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 130 transitions. [2018-11-23 02:59:31,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:31,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:31,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:31,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [40, 1, 1, 1, 1] [2018-11-23 02:59:31,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:31,143 INFO L794 eck$LassoCheckResult]: Stem: 27583#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 27584#L12 main_~i~0 := 0; 27585#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27591#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27592#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27669#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27667#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27665#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27663#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27661#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27659#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27657#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27655#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27653#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27651#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27649#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27647#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27645#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27643#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27641#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27639#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27637#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27635#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27633#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27631#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27629#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27627#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27625#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27623#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27621#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27619#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27617#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27615#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27613#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27611#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27609#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27607#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27605#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27603#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27601#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27599#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27597#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 27595#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 27586#L15-2 assume main_~i~0 >= 100; 27587#L25 [2018-11-23 02:59:31,143 INFO L796 eck$LassoCheckResult]: Loop: 27587#L25 assume true; 27587#L25 [2018-11-23 02:59:31,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash 43964267, now seen corresponding path program 40 times [2018-11-23 02:59:31,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:31,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:59:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:31,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:31,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:31,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:59:31,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:59:31,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:31,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:31,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:31,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-11-23 02:59:31,572 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:31,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 80 times [2018-11-23 02:59:31,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:31,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 02:59:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 02:59:31,575 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. cyclomatic complexity: 46 Second operand 43 states. [2018-11-23 02:59:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:31,725 INFO L93 Difference]: Finished difference Result 994 states and 1040 transitions. [2018-11-23 02:59:31,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 02:59:31,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 994 states and 1040 transitions. [2018-11-23 02:59:31,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 02:59:31,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 994 states to 993 states and 1039 transitions. [2018-11-23 02:59:31,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 02:59:31,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:59:31,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 993 states and 1039 transitions. [2018-11-23 02:59:31,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:31,728 INFO L705 BuchiCegarLoop]: Abstraction has 993 states and 1039 transitions. [2018-11-23 02:59:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states and 1039 transitions. [2018-11-23 02:59:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 88. [2018-11-23 02:59:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 02:59:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2018-11-23 02:59:31,730 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 132 transitions. [2018-11-23 02:59:31,730 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 132 transitions. [2018-11-23 02:59:31,730 INFO L442 BuchiCegarLoop]: ======== Iteration 82============ [2018-11-23 02:59:31,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 132 transitions. [2018-11-23 02:59:31,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:31,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:31,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:31,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [39, 1, 1, 1, 1, 1, 1] [2018-11-23 02:59:31,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:31,731 INFO L794 eck$LassoCheckResult]: Stem: 28839#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 28840#L12 main_~i~0 := 0; 28841#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 28844#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 28845#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28849#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28926#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28925#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28924#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28923#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28922#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28921#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28920#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28919#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28918#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28917#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28916#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28915#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28914#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28913#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28912#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28911#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28910#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28909#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28908#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28907#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28906#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28905#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28904#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28903#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28902#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28901#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28900#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28899#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28898#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28897#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28896#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28895#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28894#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28893#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28892#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28891#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28890#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 28889#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 28846#L21-2 assume main_~j~0 >= 100; 28843#L25 [2018-11-23 02:59:31,731 INFO L796 eck$LassoCheckResult]: Loop: 28843#L25 assume true; 28843#L25 [2018-11-23 02:59:31,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 874410040, now seen corresponding path program 39 times [2018-11-23 02:59:31,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:31,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:32,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:32,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:32,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:59:32,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 02:59:32,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:32,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-11-23 02:59:32,178 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:32,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 81 times [2018-11-23 02:59:32,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:32,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:32,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:32,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:32,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 02:59:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 02:59:32,181 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. cyclomatic complexity: 47 Second operand 42 states. [2018-11-23 02:59:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:32,230 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2018-11-23 02:59:32,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 02:59:32,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 134 transitions. [2018-11-23 02:59:32,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:32,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 89 states and 133 transitions. [2018-11-23 02:59:32,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 02:59:32,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 02:59:32,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 133 transitions. [2018-11-23 02:59:32,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:59:32,232 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2018-11-23 02:59:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 133 transitions. [2018-11-23 02:59:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-23 02:59:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 02:59:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2018-11-23 02:59:32,233 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2018-11-23 02:59:32,233 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2018-11-23 02:59:32,233 INFO L442 BuchiCegarLoop]: ======== Iteration 83============ [2018-11-23 02:59:32,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 133 transitions. [2018-11-23 02:59:32,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 02:59:32,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:59:32,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:59:32,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [41, 1, 1, 1, 1] [2018-11-23 02:59:32,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 02:59:32,234 INFO L794 eck$LassoCheckResult]: Stem: 29194#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 29195#L12 main_~i~0 := 0; 29196#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29202#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29203#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29282#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29280#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29278#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29276#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29274#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29272#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29270#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29268#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29266#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29264#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29262#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29260#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29258#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29256#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29254#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29252#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29250#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29248#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29246#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29244#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29242#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29240#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29238#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29236#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29234#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29232#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29230#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29228#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29226#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29224#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29222#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29220#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29218#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29216#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29214#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29212#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29210#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29208#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 29206#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 29197#L15-2 assume main_~i~0 >= 100; 29198#L25 [2018-11-23 02:59:32,234 INFO L796 eck$LassoCheckResult]: Loop: 29198#L25 assume true; 29198#L25 [2018-11-23 02:59:32,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1362893969, now seen corresponding path program 41 times [2018-11-23 02:59:32,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:32,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:59:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:32,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:59:32,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:59:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:59:32,672 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 02:59:32,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:59:32,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:59:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:59:32,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:59:32,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-23 02:59:32,704 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:59:32,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:59:32,705 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 82 times [2018-11-23 02:59:32,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:59:32,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:59:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:32,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:59:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:59:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:59:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 02:59:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 02:59:32,707 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. cyclomatic complexity: 47 Second operand 44 states. [2018-11-23 02:59:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:59:32,862 INFO L93 Difference]: Finished difference Result 1039 states and 1086 transitions. [2018-11-23 02:59:32,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 02:59:32,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1039 states and 1086 transitions. [2018-11-23 02:59:32,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2018-11-23 03:02:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:14,251 INFO L93 Difference]: Finished difference Result 4954 states and 5055 transitions. [2018-11-23 03:02:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-23 03:02:14,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4954 states and 5055 transitions. [2018-11-23 03:02:14,257 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 03:02:14,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4954 states to 4953 states and 5054 transitions. [2018-11-23 03:02:14,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:02:14,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:02:14,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4953 states and 5054 transitions. [2018-11-23 03:02:14,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:14,260 INFO L705 BuchiCegarLoop]: Abstraction has 4953 states and 5054 transitions. [2018-11-23 03:02:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states and 5054 transitions. [2018-11-23 03:02:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 198. [2018-11-23 03:02:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 03:02:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 297 transitions. [2018-11-23 03:02:14,266 INFO L728 BuchiCegarLoop]: Abstraction has 198 states and 297 transitions. [2018-11-23 03:02:14,266 INFO L608 BuchiCegarLoop]: Abstraction has 198 states and 297 transitions. [2018-11-23 03:02:14,266 INFO L442 BuchiCegarLoop]: ======== Iteration 192============ [2018-11-23 03:02:14,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 297 transitions. [2018-11-23 03:02:14,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:14,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:14,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:14,267 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [94, 1, 1, 1, 1, 1, 1] [2018-11-23 03:02:14,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:14,267 INFO L794 eck$LassoCheckResult]: Stem: 235584#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 235585#L12 main_~i~0 := 0; 235586#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 235589#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 235590#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235594#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235781#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235780#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235779#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235778#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235777#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235776#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235775#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235774#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235773#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235772#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235771#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235770#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235769#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235768#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235767#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235766#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235765#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235764#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235763#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235762#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235761#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235760#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235759#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235758#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235757#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235756#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235755#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235754#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235753#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235752#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235751#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235750#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235749#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235748#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235747#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235746#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235745#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235744#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235743#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235742#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235741#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235740#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235739#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235738#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235737#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235736#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235735#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235734#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235733#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235732#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235731#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235730#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235729#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235728#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235727#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235726#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235725#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235724#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235723#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235722#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235721#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235720#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235719#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235718#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235717#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235716#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235715#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235714#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235713#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235712#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235711#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235710#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235709#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235708#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235707#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235706#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235705#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235704#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235703#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235702#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235701#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235700#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235699#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235698#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235697#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235696#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235695#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235694#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235693#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235692#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235691#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235690#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 235689#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 235591#L21-2 assume main_~j~0 >= 100; 235588#L25 [2018-11-23 03:02:14,267 INFO L796 eck$LassoCheckResult]: Loop: 235588#L25 assume true; 235588#L25 [2018-11-23 03:02:14,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1331569718, now seen corresponding path program 94 times [2018-11-23 03:02:14,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:14,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:14,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:16,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:16,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:02:16,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:02:16,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:02:16,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:16,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:16,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-11-23 03:02:16,323 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:16,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 191 times [2018-11-23 03:02:16,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:16,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:16,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:16,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-23 03:02:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 03:02:16,326 INFO L87 Difference]: Start difference. First operand 198 states and 297 transitions. cyclomatic complexity: 102 Second operand 97 states. [2018-11-23 03:02:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:16,440 INFO L93 Difference]: Finished difference Result 200 states and 299 transitions. [2018-11-23 03:02:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-23 03:02:16,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 299 transitions. [2018-11-23 03:02:16,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:16,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 199 states and 298 transitions. [2018-11-23 03:02:16,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 03:02:16,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 03:02:16,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 298 transitions. [2018-11-23 03:02:16,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:16,441 INFO L705 BuchiCegarLoop]: Abstraction has 199 states and 298 transitions. [2018-11-23 03:02:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 298 transitions. [2018-11-23 03:02:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-23 03:02:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 03:02:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2018-11-23 03:02:16,442 INFO L728 BuchiCegarLoop]: Abstraction has 199 states and 298 transitions. [2018-11-23 03:02:16,442 INFO L608 BuchiCegarLoop]: Abstraction has 199 states and 298 transitions. [2018-11-23 03:02:16,442 INFO L442 BuchiCegarLoop]: ======== Iteration 193============ [2018-11-23 03:02:16,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 298 transitions. [2018-11-23 03:02:16,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:16,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:16,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:16,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [96, 1, 1, 1, 1] [2018-11-23 03:02:16,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:16,443 INFO L794 eck$LassoCheckResult]: Stem: 236379#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 236380#L12 main_~i~0 := 0; 236381#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236387#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236388#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236577#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236575#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236573#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236571#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236569#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236567#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236565#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236563#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236561#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236559#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236557#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236555#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236553#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236551#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236549#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236547#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236545#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236543#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236541#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236539#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236537#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236535#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236533#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236531#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236529#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236527#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236525#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236523#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236521#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236519#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236517#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236515#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236513#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236511#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236509#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236507#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236505#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236503#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236501#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236499#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236497#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236495#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236493#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236491#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236489#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236487#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236485#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236483#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236481#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236479#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236477#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236475#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236473#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236471#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236469#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236467#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236465#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236463#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236461#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236459#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236457#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236455#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236453#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236451#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236449#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236447#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236445#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236443#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236441#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236439#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236437#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236435#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236433#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236431#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236429#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236427#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236425#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236423#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236421#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236419#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236417#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236415#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236413#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236411#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236409#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236407#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236405#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236403#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236401#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236399#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236397#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236395#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236393#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 236391#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 236382#L15-2 assume main_~i~0 >= 100; 236383#L25 [2018-11-23 03:02:16,443 INFO L796 eck$LassoCheckResult]: Loop: 236383#L25 assume true; 236383#L25 [2018-11-23 03:02:16,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1188953195, now seen corresponding path program 96 times [2018-11-23 03:02:16,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:16,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:18,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:18,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:18,521 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 03:02:18,579 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-23 03:02:18,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:02:18,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:18,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:18,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-11-23 03:02:18,612 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:18,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 192 times [2018-11-23 03:02:18,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:18,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:18,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:18,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-23 03:02:18,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-23 03:02:18,619 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. cyclomatic complexity: 102 Second operand 99 states. [2018-11-23 03:02:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:19,882 INFO L93 Difference]: Finished difference Result 5054 states and 5156 transitions. [2018-11-23 03:02:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-23 03:02:19,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5054 states and 5156 transitions. [2018-11-23 03:02:19,888 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 03:02:19,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5054 states to 5053 states and 5155 transitions. [2018-11-23 03:02:19,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:02:19,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:02:19,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5053 states and 5155 transitions. [2018-11-23 03:02:19,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:19,891 INFO L705 BuchiCegarLoop]: Abstraction has 5053 states and 5155 transitions. [2018-11-23 03:02:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5053 states and 5155 transitions. [2018-11-23 03:02:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5053 to 200. [2018-11-23 03:02:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 03:02:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 300 transitions. [2018-11-23 03:02:19,897 INFO L728 BuchiCegarLoop]: Abstraction has 200 states and 300 transitions. [2018-11-23 03:02:19,897 INFO L608 BuchiCegarLoop]: Abstraction has 200 states and 300 transitions. [2018-11-23 03:02:19,897 INFO L442 BuchiCegarLoop]: ======== Iteration 194============ [2018-11-23 03:02:19,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 300 transitions. [2018-11-23 03:02:19,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:19,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:19,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:19,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [95, 1, 1, 1, 1, 1, 1] [2018-11-23 03:02:19,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:19,898 INFO L794 eck$LassoCheckResult]: Stem: 242031#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 242032#L12 main_~i~0 := 0; 242033#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 242036#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 242037#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242041#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242230#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242229#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242228#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242227#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242226#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242225#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242224#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242223#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242222#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242221#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242220#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242219#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242218#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242217#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242216#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242215#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242214#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242213#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242212#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242211#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242210#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242209#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242208#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242207#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242206#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242205#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242204#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242203#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242202#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242201#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242200#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242199#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242198#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242197#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242196#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242195#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242194#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242193#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242192#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242191#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242190#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242189#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242188#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242187#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242186#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242185#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242184#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242183#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242182#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242181#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242180#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242179#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242178#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242177#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242176#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242175#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242174#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242173#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242172#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242171#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242170#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242169#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242168#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242167#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242166#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242165#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242164#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242163#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242162#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242161#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242160#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242159#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242158#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242157#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242156#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242155#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242154#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242153#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242152#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242151#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242150#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242149#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242148#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242147#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242146#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242145#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242144#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242143#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242142#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242141#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242140#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242139#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242138#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 242137#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 242038#L21-2 assume main_~j~0 >= 100; 242035#L25 [2018-11-23 03:02:19,898 INFO L796 eck$LassoCheckResult]: Loop: 242035#L25 assume true; 242035#L25 [2018-11-23 03:02:19,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1671009992, now seen corresponding path program 95 times [2018-11-23 03:02:19,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:19,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:19,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:21,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:21,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:21,977 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 03:02:22,066 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-11-23 03:02:22,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:02:22,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:22,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:22,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-11-23 03:02:22,103 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:22,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 193 times [2018-11-23 03:02:22,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:22,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:22,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-23 03:02:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-11-23 03:02:22,110 INFO L87 Difference]: Start difference. First operand 200 states and 300 transitions. cyclomatic complexity: 103 Second operand 98 states. [2018-11-23 03:02:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:22,201 INFO L93 Difference]: Finished difference Result 202 states and 302 transitions. [2018-11-23 03:02:22,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-23 03:02:22,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 302 transitions. [2018-11-23 03:02:22,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:22,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 201 states and 301 transitions. [2018-11-23 03:02:22,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 03:02:22,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 03:02:22,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 301 transitions. [2018-11-23 03:02:22,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:22,203 INFO L705 BuchiCegarLoop]: Abstraction has 201 states and 301 transitions. [2018-11-23 03:02:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 301 transitions. [2018-11-23 03:02:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-23 03:02:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 03:02:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2018-11-23 03:02:22,204 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 301 transitions. [2018-11-23 03:02:22,204 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 301 transitions. [2018-11-23 03:02:22,204 INFO L442 BuchiCegarLoop]: ======== Iteration 195============ [2018-11-23 03:02:22,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 301 transitions. [2018-11-23 03:02:22,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:22,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:22,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:22,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [97, 1, 1, 1, 1] [2018-11-23 03:02:22,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:22,204 INFO L794 eck$LassoCheckResult]: Stem: 242834#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 242835#L12 main_~i~0 := 0; 242836#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242842#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242843#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243034#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243032#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243030#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243028#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243026#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243024#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243022#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243020#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243018#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243016#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243014#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243012#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243010#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243008#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243006#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243004#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243002#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 243000#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242998#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242996#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242994#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242992#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242990#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242988#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242986#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242984#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242982#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242980#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242978#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242976#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242974#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242972#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242970#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242968#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242966#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242964#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242962#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242960#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242958#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242956#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242954#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242952#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242950#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242948#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242946#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242944#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242942#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242940#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242938#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242936#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242934#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242932#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242930#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242928#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242926#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242924#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242922#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242920#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242918#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242916#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242914#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242912#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242910#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242908#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242906#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242904#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242902#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242900#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242898#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242896#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242894#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242892#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242890#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242888#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242886#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242884#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242882#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242880#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242878#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242876#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242874#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242872#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242870#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242868#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242866#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242864#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242862#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242860#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242858#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242856#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242854#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242852#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242850#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242848#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 242846#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 242837#L15-2 assume main_~i~0 >= 100; 242838#L25 [2018-11-23 03:02:22,205 INFO L796 eck$LassoCheckResult]: Loop: 242838#L25 assume true; 242838#L25 [2018-11-23 03:02:22,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:22,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1797154927, now seen corresponding path program 97 times [2018-11-23 03:02:22,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:22,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:22,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:02:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:24,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:24,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:02:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:24,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:24,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:24,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-11-23 03:02:24,378 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:24,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 194 times [2018-11-23 03:02:24,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:24,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:24,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:02:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-11-23 03:02:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-23 03:02:24,382 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. cyclomatic complexity: 103 Second operand 100 states. [2018-11-23 03:02:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:25,285 INFO L93 Difference]: Finished difference Result 5155 states and 5258 transitions. [2018-11-23 03:02:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-11-23 03:02:25,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5155 states and 5258 transitions. [2018-11-23 03:02:25,291 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 03:02:25,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5155 states to 5154 states and 5257 transitions. [2018-11-23 03:02:25,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:02:25,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:02:25,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5154 states and 5257 transitions. [2018-11-23 03:02:25,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:25,295 INFO L705 BuchiCegarLoop]: Abstraction has 5154 states and 5257 transitions. [2018-11-23 03:02:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states and 5257 transitions. [2018-11-23 03:02:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 202. [2018-11-23 03:02:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-23 03:02:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2018-11-23 03:02:25,301 INFO L728 BuchiCegarLoop]: Abstraction has 202 states and 303 transitions. [2018-11-23 03:02:25,301 INFO L608 BuchiCegarLoop]: Abstraction has 202 states and 303 transitions. [2018-11-23 03:02:25,301 INFO L442 BuchiCegarLoop]: ======== Iteration 196============ [2018-11-23 03:02:25,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 303 transitions. [2018-11-23 03:02:25,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:25,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:25,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:25,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [96, 1, 1, 1, 1, 1, 1] [2018-11-23 03:02:25,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:25,302 INFO L794 eck$LassoCheckResult]: Stem: 248593#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 248594#L12 main_~i~0 := 0; 248595#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 248598#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 248599#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248603#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248794#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248793#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248792#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248791#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248790#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248789#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248788#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248787#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248786#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248785#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248784#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248783#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248782#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248781#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248780#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248779#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248778#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248777#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248776#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248775#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248774#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248773#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248772#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248771#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248770#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248769#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248768#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248767#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248766#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248765#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248764#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248763#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248762#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248761#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248760#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248759#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248758#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248757#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248756#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248755#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248754#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248753#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248752#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248751#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248750#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248749#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248748#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248747#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248746#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248745#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248744#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248743#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248742#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248741#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248740#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248739#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248738#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248737#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248736#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248735#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248734#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248733#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248732#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248731#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248730#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248729#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248728#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248727#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248726#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248725#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248724#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248723#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248722#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248721#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248720#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248719#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248718#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248717#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248716#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248715#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248714#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248713#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248712#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248711#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248710#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248709#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248708#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248707#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248706#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248705#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248704#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248703#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248702#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248701#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 248700#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 248600#L21-2 assume main_~j~0 >= 100; 248597#L25 [2018-11-23 03:02:25,302 INFO L796 eck$LassoCheckResult]: Loop: 248597#L25 assume true; 248597#L25 [2018-11-23 03:02:25,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -261700490, now seen corresponding path program 96 times [2018-11-23 03:02:25,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:25,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:25,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:25,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:25,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:27,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:27,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:27,383 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 03:02:27,479 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-23 03:02:27,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:02:27,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:27,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:27,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-11-23 03:02:27,516 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:27,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 195 times [2018-11-23 03:02:27,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:27,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:27,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:27,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-23 03:02:27,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-23 03:02:27,526 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. cyclomatic complexity: 104 Second operand 99 states. [2018-11-23 03:02:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:27,626 INFO L93 Difference]: Finished difference Result 204 states and 305 transitions. [2018-11-23 03:02:27,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-23 03:02:27,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 305 transitions. [2018-11-23 03:02:27,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:27,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 203 states and 304 transitions. [2018-11-23 03:02:27,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 03:02:27,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 03:02:27,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 304 transitions. [2018-11-23 03:02:27,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:27,627 INFO L705 BuchiCegarLoop]: Abstraction has 203 states and 304 transitions. [2018-11-23 03:02:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 304 transitions. [2018-11-23 03:02:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-11-23 03:02:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-23 03:02:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 304 transitions. [2018-11-23 03:02:27,629 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 304 transitions. [2018-11-23 03:02:27,629 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 304 transitions. [2018-11-23 03:02:27,629 INFO L442 BuchiCegarLoop]: ======== Iteration 197============ [2018-11-23 03:02:27,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 304 transitions. [2018-11-23 03:02:27,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:27,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:27,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:27,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [98, 1, 1, 1, 1] [2018-11-23 03:02:27,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:27,630 INFO L794 eck$LassoCheckResult]: Stem: 249404#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 249405#L12 main_~i~0 := 0; 249406#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249412#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249413#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249606#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249604#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249602#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249600#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249598#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249596#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249594#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249592#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249590#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249588#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249586#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249584#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249582#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249580#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249578#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249576#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249574#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249572#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249570#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249568#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249566#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249564#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249562#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249560#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249558#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249556#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249554#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249552#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249550#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249548#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249546#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249544#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249542#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249540#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249538#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249536#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249534#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249532#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249530#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249528#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249526#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249524#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249522#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249520#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249518#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249516#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249514#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249512#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249510#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249508#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249506#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249504#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249502#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249500#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249498#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249496#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249494#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249492#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249490#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249488#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249486#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249484#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249482#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249480#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249478#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249476#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249474#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249472#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249470#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249468#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249466#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249464#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249462#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249460#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249458#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249456#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249454#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249452#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249450#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249448#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249446#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249444#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249442#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249440#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249438#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249436#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249434#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249432#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249430#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249428#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249426#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249424#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249422#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249420#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249418#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 249416#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 249407#L15-2 assume main_~i~0 >= 100; 249408#L25 [2018-11-23 03:02:27,630 INFO L796 eck$LassoCheckResult]: Loop: 249408#L25 assume true; 249408#L25 [2018-11-23 03:02:27,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:27,630 INFO L82 PathProgramCache]: Analyzing trace with hash 122773803, now seen corresponding path program 98 times [2018-11-23 03:02:27,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:27,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:27,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:27,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:29,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:29,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:29,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:02:29,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:02:29,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:02:29,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:29,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:29,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-11-23 03:02:29,850 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:29,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 196 times [2018-11-23 03:02:29,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:29,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:29,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:29,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:29,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:29,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-11-23 03:02:29,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-11-23 03:02:29,854 INFO L87 Difference]: Start difference. First operand 203 states and 304 transitions. cyclomatic complexity: 104 Second operand 101 states. [2018-11-23 03:02:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:31,184 INFO L93 Difference]: Finished difference Result 5257 states and 5361 transitions. [2018-11-23 03:02:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-11-23 03:02:31,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5257 states and 5361 transitions. [2018-11-23 03:02:31,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 03:02:31,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5257 states to 5256 states and 5360 transitions. [2018-11-23 03:02:31,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:02:31,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:02:31,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5256 states and 5360 transitions. [2018-11-23 03:02:31,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:31,194 INFO L705 BuchiCegarLoop]: Abstraction has 5256 states and 5360 transitions. [2018-11-23 03:02:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states and 5360 transitions. [2018-11-23 03:02:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 204. [2018-11-23 03:02:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 03:02:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 306 transitions. [2018-11-23 03:02:31,200 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 306 transitions. [2018-11-23 03:02:31,200 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 306 transitions. [2018-11-23 03:02:31,200 INFO L442 BuchiCegarLoop]: ======== Iteration 198============ [2018-11-23 03:02:31,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 306 transitions. [2018-11-23 03:02:31,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:31,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:31,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:31,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [97, 1, 1, 1, 1, 1, 1] [2018-11-23 03:02:31,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:31,201 INFO L794 eck$LassoCheckResult]: Stem: 255271#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 255272#L12 main_~i~0 := 0; 255273#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 255276#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 255277#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255281#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255474#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255473#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255472#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255471#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255470#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255469#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255468#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255467#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255466#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255465#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255464#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255463#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255462#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255461#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255460#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255459#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255458#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255457#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255456#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255455#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255454#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255453#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255452#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255451#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255450#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255449#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255448#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255447#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255446#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255445#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255444#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255443#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255442#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255441#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255440#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255439#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255438#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255437#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255436#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255435#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255434#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255433#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255432#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255431#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255430#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255429#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255428#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255427#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255426#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255425#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255424#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255423#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255422#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255421#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255420#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255419#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255418#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255417#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255416#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255415#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255414#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255413#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255412#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255411#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255410#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255409#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255408#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255407#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255406#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255405#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255404#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255403#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255402#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255401#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255400#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255399#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255398#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255397#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255396#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255395#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255394#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255393#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255392#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255391#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255390#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255389#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255388#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255387#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255386#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255385#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255384#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255383#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255382#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255381#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255380#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255379#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 255278#L21-2 assume main_~j~0 >= 100; 255275#L25 [2018-11-23 03:02:31,201 INFO L796 eck$LassoCheckResult]: Loop: 255275#L25 assume true; 255275#L25 [2018-11-23 03:02:31,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash 477221112, now seen corresponding path program 97 times [2018-11-23 03:02:31,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:31,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:33,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:33,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:33,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:02:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:33,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:33,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:33,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-11-23 03:02:33,383 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:33,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 197 times [2018-11-23 03:02:33,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:33,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:02:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-11-23 03:02:33,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-23 03:02:33,385 INFO L87 Difference]: Start difference. First operand 204 states and 306 transitions. cyclomatic complexity: 105 Second operand 100 states. [2018-11-23 03:02:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:33,503 INFO L93 Difference]: Finished difference Result 206 states and 308 transitions. [2018-11-23 03:02:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-11-23 03:02:33,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 308 transitions. [2018-11-23 03:02:33,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:33,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 205 states and 307 transitions. [2018-11-23 03:02:33,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 03:02:33,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 03:02:33,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 307 transitions. [2018-11-23 03:02:33,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:33,504 INFO L705 BuchiCegarLoop]: Abstraction has 205 states and 307 transitions. [2018-11-23 03:02:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 307 transitions. [2018-11-23 03:02:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-11-23 03:02:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-23 03:02:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 307 transitions. [2018-11-23 03:02:33,505 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 307 transitions. [2018-11-23 03:02:33,505 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 307 transitions. [2018-11-23 03:02:33,505 INFO L442 BuchiCegarLoop]: ======== Iteration 199============ [2018-11-23 03:02:33,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 307 transitions. [2018-11-23 03:02:33,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:33,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:33,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:33,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [99, 1, 1, 1, 1] [2018-11-23 03:02:33,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:33,506 INFO L794 eck$LassoCheckResult]: Stem: 256090#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 256091#L12 main_~i~0 := 0; 256092#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256098#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256099#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256294#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256292#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256290#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256288#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256286#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256284#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256282#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256280#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256278#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256276#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256274#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256272#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256270#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256268#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256266#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256264#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256262#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256260#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256258#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256256#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256254#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256252#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256250#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256248#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256246#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256244#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256242#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256240#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256238#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256236#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256234#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256232#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256230#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256228#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256226#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256224#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256222#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256220#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256218#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256216#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256214#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256212#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256210#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256208#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256206#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256204#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256202#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256200#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256198#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256196#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256194#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256192#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256190#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256188#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256186#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256184#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256182#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256180#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256178#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256176#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256174#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256172#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256170#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256168#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256166#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256164#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256162#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256160#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256158#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256156#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256154#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256152#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256150#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256148#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256146#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256144#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256142#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256140#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256138#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256136#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256134#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256132#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256130#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256128#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256126#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256124#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256122#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256120#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256118#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256116#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256114#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256112#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256110#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256108#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256106#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256104#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 256102#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 256093#L15-2 assume main_~i~0 >= 100; 256094#L25 [2018-11-23 03:02:33,506 INFO L796 eck$LassoCheckResult]: Loop: 256094#L25 assume true; 256094#L25 [2018-11-23 03:02:33,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash -488977711, now seen corresponding path program 99 times [2018-11-23 03:02:33,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:33,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:33,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:33,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:33,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:35,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:35,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:35,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:02:35,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-11-23 03:02:35,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:02:35,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:35,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:35,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-11-23 03:02:35,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:35,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 198 times [2018-11-23 03:02:35,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:35,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:35,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-23 03:02:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-23 03:02:35,790 INFO L87 Difference]: Start difference. First operand 205 states and 307 transitions. cyclomatic complexity: 105 Second operand 102 states. [2018-11-23 03:02:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:36,992 INFO L93 Difference]: Finished difference Result 5359 states and 5464 transitions. [2018-11-23 03:02:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-23 03:02:36,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5359 states and 5464 transitions. [2018-11-23 03:02:36,998 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-23 03:02:37,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5359 states to 5358 states and 5463 transitions. [2018-11-23 03:02:37,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:02:37,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:02:37,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5358 states and 5463 transitions. [2018-11-23 03:02:37,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:37,003 INFO L705 BuchiCegarLoop]: Abstraction has 5358 states and 5463 transitions. [2018-11-23 03:02:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5358 states and 5463 transitions. [2018-11-23 03:02:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5358 to 206. [2018-11-23 03:02:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-23 03:02:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 309 transitions. [2018-11-23 03:02:37,009 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 309 transitions. [2018-11-23 03:02:37,009 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 309 transitions. [2018-11-23 03:02:37,009 INFO L442 BuchiCegarLoop]: ======== Iteration 200============ [2018-11-23 03:02:37,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 309 transitions. [2018-11-23 03:02:37,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:37,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:37,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:37,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [98, 1, 1, 1, 1, 1, 1] [2018-11-23 03:02:37,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:37,010 INFO L794 eck$LassoCheckResult]: Stem: 262065#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 262066#L12 main_~i~0 := 0; 262067#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 262070#L15-2 assume !(main_~i~0 >= 100);main_~j~0 := 0; 262071#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262075#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262270#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262269#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262268#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262267#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262266#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262265#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262264#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262263#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262262#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262261#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262260#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262259#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262258#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262257#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262256#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262255#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262254#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262253#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262252#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262251#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262250#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262249#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262248#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262247#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262246#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262245#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262244#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262243#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262242#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262241#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262240#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262239#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262238#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262237#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262236#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262235#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262234#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262233#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262232#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262231#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262230#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262229#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262228#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262227#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262226#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262225#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262224#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262223#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262222#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262221#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262220#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262219#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262218#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262217#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262216#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262215#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262214#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262213#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262212#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262211#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262210#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262209#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262208#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262207#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262206#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262205#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262204#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262203#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262202#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262201#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262200#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262199#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262198#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262197#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262196#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262195#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262194#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262193#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262192#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262191#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262190#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262189#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262188#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262187#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262186#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262185#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262184#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262183#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262182#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262181#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262180#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262179#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262178#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262177#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262176#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262175#L21-1 assume !!(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 262174#L21-1 assume !(0 != main_#t~nondet3 && main_~i~0 < 1000000);havoc main_#t~nondet3; 262072#L21-2 assume main_~j~0 >= 100; 262069#L25 [2018-11-23 03:02:37,010 INFO L796 eck$LassoCheckResult]: Loop: 262069#L25 assume true; 262069#L25 [2018-11-23 03:02:37,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1908954294, now seen corresponding path program 98 times [2018-11-23 03:02:37,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:37,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:37,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:37,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:37,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:02:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:39,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:02:39,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:02:39,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:02:39,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:02:39,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:02:39,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:02:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:02:39,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:02:39,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-11-23 03:02:39,265 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:02:39,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 199 times [2018-11-23 03:02:39,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:39,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:39,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-11-23 03:02:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-11-23 03:02:39,270 INFO L87 Difference]: Start difference. First operand 206 states and 309 transitions. cyclomatic complexity: 106 Second operand 101 states. [2018-11-23 03:02:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:02:39,404 INFO L93 Difference]: Finished difference Result 208 states and 311 transitions. [2018-11-23 03:02:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-11-23 03:02:39,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 311 transitions. [2018-11-23 03:02:39,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:39,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 207 states and 310 transitions. [2018-11-23 03:02:39,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 03:02:39,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 03:02:39,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 310 transitions. [2018-11-23 03:02:39,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:02:39,405 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 310 transitions. [2018-11-23 03:02:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 310 transitions. [2018-11-23 03:02:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-11-23 03:02:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 03:02:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 310 transitions. [2018-11-23 03:02:39,406 INFO L728 BuchiCegarLoop]: Abstraction has 207 states and 310 transitions. [2018-11-23 03:02:39,406 INFO L608 BuchiCegarLoop]: Abstraction has 207 states and 310 transitions. [2018-11-23 03:02:39,406 INFO L442 BuchiCegarLoop]: ======== Iteration 201============ [2018-11-23 03:02:39,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 310 transitions. [2018-11-23 03:02:39,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 03:02:39,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:02:39,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:02:39,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [100, 1, 1, 1, 1] [2018-11-23 03:02:39,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 03:02:39,406 INFO L794 eck$LassoCheckResult]: Stem: 262892#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; 262893#L12 main_~i~0 := 0; 262894#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262900#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262901#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263098#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263096#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263094#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263092#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263090#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263088#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263086#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263084#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263082#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263080#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263078#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263076#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263074#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263072#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263070#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263068#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263066#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263064#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263062#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263060#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263058#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263056#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263054#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263052#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263050#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263048#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263046#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263044#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263042#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263040#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263038#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263036#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263034#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263032#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263030#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263028#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263026#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263024#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263022#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263020#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263018#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263016#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263014#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263012#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263010#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263008#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263006#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263004#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263002#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 263000#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262998#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262996#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262994#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262992#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262990#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262988#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262986#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262984#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262982#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262980#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262978#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262976#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262974#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262972#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262970#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262968#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262966#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262964#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262962#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262960#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262958#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262956#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262954#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262952#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262950#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262948#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262946#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262944#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262942#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262940#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262938#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262936#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262934#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262932#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262930#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262928#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262926#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262924#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262922#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262920#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262918#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262916#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262914#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262912#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262910#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262908#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262906#L15-1 assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 262904#L15-1 assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; 262895#L15-2 assume main_~i~0 >= 100; 262896#L25 [2018-11-23 03:02:39,407 INFO L796 eck$LassoCheckResult]: Loop: 262896#L25 assume true; 262896#L25 [2018-11-23 03:02:39,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2021561835, now seen corresponding path program 100 times [2018-11-23 03:02:39,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:39,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:02:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:39,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 200 times [2018-11-23 03:02:39,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:39,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:39,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:39,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:02:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1756092503, now seen corresponding path program 1 times [2018-11-23 03:02:39,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:02:39,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:02:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:02:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:02:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:02:43,146 WARN L180 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 713 DAG size of output: 607 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; [?] main_~i~0 := 0; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; [?] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 [L11] int i, j; [L13] i = 0 [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND FALSE !(__VERIFIER_nondet_int() && i < 1000000) [L18] COND TRUE i >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] assume true; [L18] STUCK: goto STUCK; ----- [2018-11-23 03:02:53,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:02:53 BoogieIcfgContainer [2018-11-23 03:02:53,064 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:02:53,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:02:53,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:02:53,064 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:02:53,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:59:08" (3/4) ... [2018-11-23 03:02:53,066 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; [?] main_~i~0 := 0; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; [?] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 [L11] int i, j; [L13] i = 0 [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND FALSE !(__VERIFIER_nondet_int() && i < 1000000) [L18] COND TRUE i >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] assume true; [L18] STUCK: goto STUCK; ----- [2018-11-23 03:03:09,793 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05a47e9d-27d4-43c6-b5b8-5f0df4401428/bin-2019/uautomizer/witness.graphml [2018-11-23 03:03:09,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:03:09,794 INFO L168 Benchmark]: Toolchain (without parser) took 241523.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -61.7 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:09,795 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:03:09,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.75 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:09,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.70 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:09,795 INFO L168 Benchmark]: Boogie Preprocessor took 15.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:03:09,795 INFO L168 Benchmark]: RCFGBuilder took 176.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:09,795 INFO L168 Benchmark]: BuchiAutomizer took 224432.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.9 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 128.2 MB). Peak memory consumption was 433.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:09,796 INFO L168 Benchmark]: Witness Printer took 16729.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:09,797 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.75 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.70 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 176.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 224432.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.9 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 128.2 MB). Peak memory consumption was 433.7 MB. Max. memory is 11.5 GB. * Witness Printer took 16729.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 200 terminating modules (199 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + 1999999 and consists of 4 locations. 199 modules have a trivial ranking function, the largest among these consists of 102 locations. The remainder module has 207 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 214.5s and 201 iterations. TraceHistogramMax:100. Analysis of lassos took 170.9s. Construction of modules took 16.5s. Büchi inclusion checks took 25.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 200. Automata minimization 0.4s AutomataMinimizationTime, 200 MinimizatonAttempts, 177054 StatesRemovedByMinimization, 101 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 207 states and ocurred in iteration 200. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1401 SDtfs, 19918 SDslu, 18376 SDs, 0 SdLazy, 37559 SolverSat, 9893 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN199 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 10]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@669fcf3c=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d65ba84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4d1a8222=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@780f4b9f=0, i=100, j=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1cd6ed0c=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; [?] main_~i~0 := 0; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; [?] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 [L11] int i, j; [L13] i = 0 [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND FALSE !(__VERIFIER_nondet_int() && i < 1000000) [L18] COND TRUE i >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] assume true; [L18] STUCK: goto STUCK; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0; [?] main_~i~0 := 0; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1;main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; [?] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000);havoc main_#t~nondet1; [?] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !!(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] assume !(0 != main_#t~nondet1 && main_~i~0 < 1000000); [L15] havoc main_#t~nondet1; [L18] assume main_~i~0 >= 100; [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post2, main_#t~nondet1, main_#t~post4, main_#t~post5, main_#t~nondet3, main_~i~0, main_~j~0; [L11] havoc main_~i~0; [L11] havoc main_~j~0; [L13] main_~i~0 := 0; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND FALSE !(!(0 != main_#t~nondet1 && main_~i~0 < 1000000)) [L15] havoc main_#t~nondet1; [L16] main_#t~post2 := main_~i~0; [L16] main_~i~0 := 1 + main_#t~post2; [L16] havoc main_#t~post2; [L15-L17] COND TRUE !(0 != main_#t~nondet1 && main_~i~0 < 1000000) [L15] havoc main_#t~nondet1; [L18] COND TRUE main_~i~0 >= 100 [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L11] havoc ~i~0; [L11] havoc ~j~0; [L13] ~i~0 := 0; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND FALSE !(!(0 != #t~nondet1 && ~i~0 < 1000000)) [L15] havoc #t~nondet1; [L16] #t~post2 := ~i~0; [L16] ~i~0 := 1 + #t~post2; [L16] havoc #t~post2; [L15-L17] COND TRUE !(0 != #t~nondet1 && ~i~0 < 1000000) [L15] havoc #t~nondet1; [L18] COND TRUE ~i~0 >= 100 [L11] int i, j; [L13] i = 0 [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND FALSE !(__VERIFIER_nondet_int() && i < 1000000) [L18] COND TRUE i >= 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L18] assume true; [L18] assume true; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L18] assume true; [L18] STUCK: goto STUCK; ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L11] int i, j; [L13] i = 0 [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND TRUE __VERIFIER_nondet_int() && i < 1000000 [L16] i++ [L15] COND FALSE !(__VERIFIER_nondet_int() && i < 1000000) [L18] COND TRUE i >= 100 Loop: [L18] STUCK: goto STUCK; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...