./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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 64bit --witnessprinter.graph.data.programhash 4e32f3b75457895ed6b80ddc53a00ac44a497e1b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 09:50:15,913 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:50:15,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:50:15,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:50:15,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:50:15,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:50:15,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:50:15,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:50:15,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:50:15,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:50:15,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:50:15,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:50:15,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:50:15,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:50:15,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:50:15,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:50:15,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:50:15,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:50:15,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:50:15,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:50:15,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:50:15,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:50:15,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:50:15,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:50:15,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:50:15,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:50:15,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:50:15,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:50:15,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:50:15,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:50:15,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:50:15,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:50:15,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:50:15,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:50:15,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:50:15,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:50:15,937 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 09:50:15,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:50:15,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:50:15,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:50:15,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:50:15,949 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:50:15,949 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:50:15,949 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:50:15,949 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:50:15,950 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:50:15,950 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:50:15,950 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:50:15,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:50:15,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:50:15,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:50:15,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:50:15,951 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:50:15,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:50:15,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:50:15,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:50:15,951 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:50:15,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:50:15,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:50:15,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:50:15,952 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:50:15,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:50:15,952 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:50:15,952 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:50:15,953 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:50:15,953 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_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e32f3b75457895ed6b80ddc53a00ac44a497e1b [2018-11-10 09:50:15,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:50:15,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:50:15,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:50:15,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:50:15,989 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:50:15,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c [2018-11-10 09:50:16,033 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/data/0056888c8/5e6e13ba92c242c481659d10e0a1c6f7/FLAGaaecaf5f3 [2018-11-10 09:50:16,431 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:50:16,432 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c [2018-11-10 09:50:16,436 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/data/0056888c8/5e6e13ba92c242c481659d10e0a1c6f7/FLAGaaecaf5f3 [2018-11-10 09:50:16,447 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/data/0056888c8/5e6e13ba92c242c481659d10e0a1c6f7 [2018-11-10 09:50:16,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:50:16,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:50:16,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:50:16,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:50:16,454 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:50:16,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf60991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16, skipping insertion in model container [2018-11-10 09:50:16,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:50:16,478 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:50:16,574 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:50:16,577 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:50:16,585 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:50:16,593 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:50:16,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16 WrapperNode [2018-11-10 09:50:16,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:50:16,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:50:16,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:50:16,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:50:16,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:50:16,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:50:16,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:50:16,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:50:16,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... [2018-11-10 09:50:16,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:50:16,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:50:16,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:50:16,624 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:50:16,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:16,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:50:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:50:16,782 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:50:16,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:16 BoogieIcfgContainer [2018-11-10 09:50:16,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:50:16,784 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:50:16,784 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:50:16,787 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:50:16,787 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:50:16,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:50:16" (1/3) ... [2018-11-10 09:50:16,788 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2289a3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:50:16, skipping insertion in model container [2018-11-10 09:50:16,789 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:50:16,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:16" (2/3) ... [2018-11-10 09:50:16,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2289a3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:50:16, skipping insertion in model container [2018-11-10 09:50:16,789 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:50:16,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:16" (3/3) ... [2018-11-10 09:50:16,791 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_22_false-termination_true-no-overflow.c [2018-11-10 09:50:16,833 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:50:16,833 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:50:16,833 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:50:16,833 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:50:16,833 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:50:16,833 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:50:16,834 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:50:16,834 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:50:16,834 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:50:16,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-10 09:50:16,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:16,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:16,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:16,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:50:16,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:50:16,858 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:50:16,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-10 09:50:16,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:16,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:16,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:16,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:50:16,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:50:16,866 INFO L793 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 8#L10-2true [2018-11-10 09:50:16,866 INFO L795 eck$LassoCheckResult]: Loop: 8#L10-2true assume true; 9#L9-1true assume !!(main_~i~0 < 100); 4#L10true assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 8#L10-2true [2018-11-10 09:50:16,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 09:50:16,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:16,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:16,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:16,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:16,936 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 1 times [2018-11-10 09:50:16,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:16,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:16,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:16,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:16,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:16,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 28694888, now seen corresponding path program 1 times [2018-11-10 09:50:16,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:16,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:16,983 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-10 09:50:16,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:50:16,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:50:17,016 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:17,016 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:17,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:17,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:17,017 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:50:17,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:17,017 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:17,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 09:50:17,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:17,018 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:17,038 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-10 09:50:17,052 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-10 09:50:17,055 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-10 09:50:17,122 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:17,122 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:17,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,149 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:50:17,149 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:17,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,169 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:50:17,169 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,174 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:50:17,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,197 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:50:17,212 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:17,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:17,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:17,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:17,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:50:17,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:17,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:17,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 09:50:17,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:17,213 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:17,214 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-10 09:50:17,223 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-10 09:50:17,226 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-10 09:50:17,260 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:17,264 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:50:17,265 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-10 09:50:17,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:17,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:17,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:17,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:17,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:50:17,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:50:17,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:50:17,277 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-10 09:50:17,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:17,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:17,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:17,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:17,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:50:17,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:50:17,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:50:17,288 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-10 09:50:17,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:17,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:50:17,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:17,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:17,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:17,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:50:17,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:50:17,295 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:50:17,299 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:50:17,299 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:50:17,301 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:50:17,301 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:50:17,301 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:50:17,301 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:50:17,302 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:50:17,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:17,358 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-10 09:50:17,367 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-10 09:50:17,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2018-11-10 09:50:17,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 6 states. [2018-11-10 09:50:17,395 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-10 09:50:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 09:50:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-10 09:50:17,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-10 09:50:17,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:17,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 09:50:17,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:17,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 09:50:17,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:17,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-10 09:50:17,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:17,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-11-10 09:50:17,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 09:50:17,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 09:50:17,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-10 09:50:17,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:17,405 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 09:50:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-10 09:50:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 09:50:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 09:50:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-10 09:50:17,422 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 09:50:17,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:50:17,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:50:17,424 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 3 states. [2018-11-10 09:50:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:17,430 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-11-10 09:50:17,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:50:17,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2018-11-10 09:50:17,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:17,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 9 transitions. [2018-11-10 09:50:17,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-10 09:50:17,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 09:50:17,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2018-11-10 09:50:17,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:50:17,432 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 09:50:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2018-11-10 09:50:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-10 09:50:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 09:50:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-11-10 09:50:17,433 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 09:50:17,433 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 09:50:17,434 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:50:17,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2018-11-10 09:50:17,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:17,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:17,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:17,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 09:50:17,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:50:17,435 INFO L793 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 97#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 98#L10-2 assume true; 102#L9-1 assume !!(main_~i~0 < 100); 99#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 100#L10-2 [2018-11-10 09:50:17,435 INFO L795 eck$LassoCheckResult]: Loop: 100#L10-2 assume true; 104#L9-1 assume !!(main_~i~0 < 100); 103#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 100#L10-2 [2018-11-10 09:50:17,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-11-10 09:50:17,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:17,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,441 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 2 times [2018-11-10 09:50:17,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:17,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 150863077, now seen corresponding path program 1 times [2018-11-10 09:50:17,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:17,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,464 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-10 09:50:17,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:17,465 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:17,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:17,483 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-10 09:50:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:17,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 09:50:17,512 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:17,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:17,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:17,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:17,512 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:50:17,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:17,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:17,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 09:50:17,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:17,512 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:17,513 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-10 09:50:17,516 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-10 09:50:17,518 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-10 09:50:17,559 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:17,560 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,585 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:50:17,585 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,612 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:50:17,612 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,614 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:50:17,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,635 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:50:17,652 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:17,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:17,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:17,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:17,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:50:17,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:17,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:17,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 09:50:17,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:17,653 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:17,654 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-10 09:50:17,656 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-10 09:50:17,661 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-10 09:50:17,681 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:17,681 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:50:17,682 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-10 09:50:17,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:17,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:17,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:17,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:17,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:50:17,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:50:17,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:50:17,691 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-10 09:50:17,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:17,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:50:17,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:17,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:17,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:17,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:50:17,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:50:17,697 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:50:17,700 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:50:17,700 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:50:17,701 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:50:17,701 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:50:17,701 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:50:17,701 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:50:17,701 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:50:17,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:17,726 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-10 09:50:17,726 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-10 09:50:17,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-10 09:50:17,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 14 states and 17 transitions. Complement of second has 5 states. [2018-11-10 09:50:17,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 09:50:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-10 09:50:17,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 09:50:17,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:17,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-10 09:50:17,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:17,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-10 09:50:17,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:17,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-10 09:50:17,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:17,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2018-11-10 09:50:17,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 09:50:17,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 09:50:17,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-10 09:50:17,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:17,736 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 09:50:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-10 09:50:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-10 09:50:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 09:50:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-10 09:50:17,738 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 09:50:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:50:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:50:17,738 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 4 states. [2018-11-10 09:50:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:17,759 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-10 09:50:17,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:50:17,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-10 09:50:17,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:17,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 12 transitions. [2018-11-10 09:50:17,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 09:50:17,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 09:50:17,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-10 09:50:17,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:50:17,761 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 09:50:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-10 09:50:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 09:50:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 09:50:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-10 09:50:17,762 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 09:50:17,762 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 09:50:17,762 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:50:17,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-10 09:50:17,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 09:50:17,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:17,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:17,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1] [2018-11-10 09:50:17,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:50:17,763 INFO L793 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 214#L10-2 assume true; 218#L9-1 assume !!(main_~i~0 < 100); 215#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 216#L10-2 assume true; 223#L9-1 assume !!(main_~i~0 < 100); 222#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 220#L10-2 [2018-11-10 09:50:17,764 INFO L795 eck$LassoCheckResult]: Loop: 220#L10-2 assume true; 221#L9-1 assume !!(main_~i~0 < 100); 219#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 220#L10-2 [2018-11-10 09:50:17,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash 150863075, now seen corresponding path program 2 times [2018-11-10 09:50:17,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:17,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 3 times [2018-11-10 09:50:17,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:17,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:17,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1826081864, now seen corresponding path program 2 times [2018-11-10 09:50:17,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:17,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:17,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:17,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:17,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:17,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:17,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:17,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:17,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 09:50:17,858 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:17,858 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:17,858 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:17,858 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:17,858 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:50:17,858 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:17,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:17,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 09:50:17,859 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:17,859 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:17,860 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-10 09:50:17,863 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-10 09:50:17,865 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-10 09:50:17,894 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:17,894 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,917 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:50:17,917 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,920 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,945 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:50:17,945 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:17,948 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:17,977 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:50:17,977 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:17,980 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:50:18,006 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:18,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:18,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:18,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:18,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:50:18,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:18,007 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:18,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 09:50:18,007 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:18,007 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:18,008 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-10 09:50:18,015 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-10 09:50:18,030 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-10 09:50:18,068 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:18,068 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:50:18,068 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-10 09:50:18,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:18,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:18,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:18,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:18,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:50:18,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:50:18,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:50:18,072 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-10 09:50:18,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:18,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:50:18,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:18,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:18,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:18,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:50:18,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:50:18,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:50:18,078 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:50:18,078 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:50:18,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:50:18,079 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:50:18,079 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:50:18,079 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:50:18,080 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:50:18,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,104 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-10 09:50:18,104 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-10 09:50:18,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-10 09:50:18,112 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 13 states and 14 transitions. Complement of second has 5 states. [2018-11-10 09:50:18,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 09:50:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-10 09:50:18,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-10 09:50:18,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,113 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:50:18,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,133 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-10 09:50:18,134 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 09:50:18,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-10 09:50:18,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 13 states and 14 transitions. Complement of second has 5 states. [2018-11-10 09:50:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 09:50:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-10 09:50:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-10 09:50:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,139 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:50:18,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,156 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-10 09:50:18,156 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 09:50:18,156 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-10 09:50:18,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 16 states and 18 transitions. Complement of second has 4 states. [2018-11-10 09:50:18,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 09:50:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-10 09:50:18,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-10 09:50:18,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 09:50:18,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-10 09:50:18,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-11-10 09:50:18,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:50:18,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 16 transitions. [2018-11-10 09:50:18,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 09:50:18,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 09:50:18,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-10 09:50:18,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:18,165 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 09:50:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-10 09:50:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-10 09:50:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 09:50:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-10 09:50:18,167 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-10 09:50:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:50:18,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:50:18,167 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-11-10 09:50:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:18,185 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-10 09:50:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:50:18,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-10 09:50:18,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:50:18,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2018-11-10 09:50:18,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 09:50:18,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 09:50:18,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-10 09:50:18,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:18,188 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 09:50:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-10 09:50:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-10 09:50:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 09:50:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-10 09:50:18,189 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-10 09:50:18,189 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-10 09:50:18,189 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:50:18,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-10 09:50:18,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:50:18,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:18,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:18,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1] [2018-11-10 09:50:18,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:50:18,191 INFO L793 eck$LassoCheckResult]: Stem: 464#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 459#L10-2 assume true; 472#L9-1 assume !!(main_~i~0 < 100); 460#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 461#L10-2 assume true; 465#L9-1 assume !!(main_~i~0 < 100); 466#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 471#L10-2 assume true; 468#L9-1 [2018-11-10 09:50:18,191 INFO L795 eck$LassoCheckResult]: Loop: 468#L9-1 assume !!(main_~i~0 < 100); 470#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 469#L10-2 assume true; 468#L9-1 [2018-11-10 09:50:18,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash 381788035, now seen corresponding path program 3 times [2018-11-10 09:50:18,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 1 times [2018-11-10 09:50:18,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash 773962880, now seen corresponding path program 4 times [2018-11-10 09:50:18,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,222 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:18,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:18,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:18,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:18,223 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:50:18,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:18,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:18,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 09:50:18,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:18,223 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:18,224 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-10 09:50:18,228 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-10 09:50:18,230 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-10 09:50:18,258 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:18,259 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:18,260 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:50:18,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:18,300 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:50:18,301 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:18,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:18,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:18,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:18,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:50:18,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,302 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:18,302 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:18,302 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 09:50:18,302 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:18,302 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:18,303 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-10 09:50:18,307 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-10 09:50:18,309 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-10 09:50:18,329 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:18,329 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:50:18,329 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-10 09:50:18,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:18,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:50:18,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:18,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:18,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:18,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:50:18,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:50:18,333 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:50:18,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:50:18,335 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:50:18,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:50:18,336 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:50:18,336 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:50:18,336 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 99 Supporting invariants [] [2018-11-10 09:50:18,336 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:50:18,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,388 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-10 09:50:18,388 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:50:18,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 09:50:18,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 27 states and 31 transitions. Complement of second has 5 states. [2018-11-10 09:50:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:50:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-10 09:50:18,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 09:50:18,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 09:50:18,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 09:50:18,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-10 09:50:18,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:50:18,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 23 transitions. [2018-11-10 09:50:18,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 09:50:18,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-10 09:50:18,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-10 09:50:18,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:18,397 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 09:50:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-10 09:50:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-10 09:50:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 09:50:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-10 09:50:18,399 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 09:50:18,399 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 09:50:18,399 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:50:18,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-10 09:50:18,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 09:50:18,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:18,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:18,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 1, 1, 1] [2018-11-10 09:50:18,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:50:18,400 INFO L793 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 557#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 558#L10-2 assume true; 564#L9-1 assume !!(main_~i~0 < 100); 561#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 562#L10-2 assume true; 565#L9-1 assume !!(main_~i~0 < 100); 566#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 574#L10-2 assume true; 572#L9-1 assume !!(main_~i~0 < 100); 573#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 571#L10-2 assume true; 569#L9-1 assume !!(main_~i~0 < 100); 570#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 568#L10-2 assume true; 567#L9-1 [2018-11-10 09:50:18,400 INFO L795 eck$LassoCheckResult]: Loop: 567#L9-1 assume !!(main_~i~0 < 100); 559#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 560#L10-2 assume true; 567#L9-1 [2018-11-10 09:50:18,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1743725217, now seen corresponding path program 3 times [2018-11-10 09:50:18,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:18,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:18,424 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:18,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:18,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 09:50:18,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:18,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:18,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:18,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 09:50:18,458 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:18,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 2 times [2018-11-10 09:50:18,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,469 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:18,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:18,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:18,470 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:18,470 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:50:18,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,470 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:18,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:18,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 09:50:18,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:18,470 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:18,471 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-10 09:50:18,480 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-10 09:50:18,482 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-10 09:50:18,499 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:18,500 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:50:18,506 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:50:18,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:50:18,542 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:50:18,543 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:50:18,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:50:18,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:50:18,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:50:18,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:50:18,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:50:18,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:50:18,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:50:18,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 09:50:18,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:50:18,543 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:50:18,544 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-10 09:50:18,551 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-10 09:50:18,553 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-10 09:50:18,575 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:50:18,575 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:50:18,576 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-10 09:50:18,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:50:18,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:50:18,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:50:18,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:50:18,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:50:18,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:50:18,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:50:18,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:50:18,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:50:18,582 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:50:18,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:50:18,582 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:50:18,582 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:50:18,583 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 99 Supporting invariants [] [2018-11-10 09:50:18,583 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:50:18,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,607 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-10 09:50:18,608 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:50:18,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 09:50:18,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 27 states and 31 transitions. Complement of second has 5 states. [2018-11-10 09:50:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:50:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-10 09:50:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 09:50:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,617 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:50:18,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,640 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-10 09:50:18,641 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:50:18,641 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 09:50:18,656 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 27 states and 30 transitions. Complement of second has 7 states. [2018-11-10 09:50:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:50:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-10 09:50:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 09:50:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,657 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:50:18,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,681 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-10 09:50:18,681 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:50:18,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 09:50:18,688 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 31 states and 36 transitions. Complement of second has 6 states. [2018-11-10 09:50:18,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 09:50:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:50:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-10 09:50:18,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 09:50:18,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-10 09:50:18,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-10 09:50:18,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:50:18,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-11-10 09:50:18,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:50:18,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 23 transitions. [2018-11-10 09:50:18,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:18,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:18,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-10 09:50:18,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:18,692 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 09:50:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-10 09:50:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-11-10 09:50:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 09:50:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-10 09:50:18,693 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 09:50:18,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:50:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:50:18,694 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2018-11-10 09:50:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:18,707 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-10 09:50:18,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:50:18,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-10 09:50:18,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:18,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2018-11-10 09:50:18,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:18,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:18,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-11-10 09:50:18,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:18,709 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-10 09:50:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-11-10 09:50:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-10 09:50:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 09:50:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-10 09:50:18,710 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-10 09:50:18,710 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-10 09:50:18,723 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:50:18,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-11-10 09:50:18,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:18,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:18,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:18,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 1, 1, 1] [2018-11-10 09:50:18,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:18,725 INFO L793 eck$LassoCheckResult]: Stem: 946#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 942#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 943#L10-2 assume true; 947#L9-1 assume !!(main_~i~0 < 100); 948#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 960#L10-2 assume true; 949#L9-1 assume !!(main_~i~0 < 100); 944#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 945#L10-2 assume true; 958#L9-1 assume !!(main_~i~0 < 100); 959#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 950#L10-2 assume true; 951#L9-1 assume !!(main_~i~0 < 100); 957#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 956#L10-2 assume true; 954#L9-1 assume !!(main_~i~0 < 100); 955#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 952#L10-2 assume true; 953#L9-1 [2018-11-10 09:50:18,725 INFO L795 eck$LassoCheckResult]: Loop: 953#L9-1 assume !!(main_~i~0 < 100); 957#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 956#L10-2 assume true; 954#L9-1 assume !!(main_~i~0 < 100); 955#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 952#L10-2 assume true; 953#L9-1 [2018-11-10 09:50:18,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash -313340450, now seen corresponding path program 4 times [2018-11-10 09:50:18,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:18,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:18,759 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:18,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:18,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:18,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:18,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:18,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 09:50:18,792 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:18,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 1 times [2018-11-10 09:50:18,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:50:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:50:18,809 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-10 09:50:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:18,826 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-10 09:50:18,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:50:18,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-10 09:50:18,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:18,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2018-11-10 09:50:18,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:18,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:18,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-11-10 09:50:18,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:18,828 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 09:50:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-11-10 09:50:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-10 09:50:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 09:50:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-10 09:50:18,829 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-10 09:50:18,829 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-10 09:50:18,829 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 09:50:18,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2018-11-10 09:50:18,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:18,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:18,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:18,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 5, 1, 1, 1] [2018-11-10 09:50:18,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:18,829 INFO L793 eck$LassoCheckResult]: Stem: 1052#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1048#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1049#L10-2 assume true; 1053#L9-1 assume !!(main_~i~0 < 100); 1055#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1069#L10-2 assume true; 1056#L9-1 assume !!(main_~i~0 < 100); 1050#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1051#L10-2 assume true; 1054#L9-1 assume !!(main_~i~0 < 100); 1068#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1067#L10-2 assume true; 1066#L9-1 assume !!(main_~i~0 < 100); 1065#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1064#L10-2 assume true; 1062#L9-1 assume !!(main_~i~0 < 100); 1063#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1061#L10-2 assume true; 1059#L9-1 assume !!(main_~i~0 < 100); 1060#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1057#L10-2 assume true; 1058#L9-1 [2018-11-10 09:50:18,830 INFO L795 eck$LassoCheckResult]: Loop: 1058#L9-1 assume !!(main_~i~0 < 100); 1063#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1061#L10-2 assume true; 1059#L9-1 assume !!(main_~i~0 < 100); 1060#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1057#L10-2 assume true; 1058#L9-1 [2018-11-10 09:50:18,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1763246719, now seen corresponding path program 5 times [2018-11-10 09:50:18,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:18,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:18,856 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:18,867 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-10 09:50:18,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:18,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:18,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:18,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 09:50:18,887 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:18,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 2 times [2018-11-10 09:50:18,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:50:18,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:50:18,905 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-10 09:50:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:18,918 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-10 09:50:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:50:18,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-11-10 09:50:18,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:18,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2018-11-10 09:50:18,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:18,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:18,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2018-11-10 09:50:18,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:18,919 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-10 09:50:18,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2018-11-10 09:50:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-10 09:50:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 09:50:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-10 09:50:18,921 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 09:50:18,921 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 09:50:18,921 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 09:50:18,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2018-11-10 09:50:18,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:18,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:18,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:18,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 1, 1, 1] [2018-11-10 09:50:18,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:18,922 INFO L793 eck$LassoCheckResult]: Stem: 1174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1171#L10-2 assume true; 1175#L9-1 assume !!(main_~i~0 < 100); 1172#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1173#L10-2 assume true; 1176#L9-1 assume !!(main_~i~0 < 100); 1177#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1194#L10-2 assume true; 1193#L9-1 assume !!(main_~i~0 < 100); 1192#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1191#L10-2 assume true; 1190#L9-1 assume !!(main_~i~0 < 100); 1189#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1188#L10-2 assume true; 1187#L9-1 assume !!(main_~i~0 < 100); 1186#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1185#L10-2 assume true; 1183#L9-1 assume !!(main_~i~0 < 100); 1184#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1182#L10-2 assume true; 1180#L9-1 assume !!(main_~i~0 < 100); 1181#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1178#L10-2 assume true; 1179#L9-1 [2018-11-10 09:50:18,922 INFO L795 eck$LassoCheckResult]: Loop: 1179#L9-1 assume !!(main_~i~0 < 100); 1184#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1182#L10-2 assume true; 1180#L9-1 assume !!(main_~i~0 < 100); 1181#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1178#L10-2 assume true; 1179#L9-1 [2018-11-10 09:50:18,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1434810626, now seen corresponding path program 6 times [2018-11-10 09:50:18,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:18,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:18,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:18,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:18,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:18,987 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:18,995 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:19,000 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-10 09:50:19,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:19,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:19,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 09:50:19,021 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:19,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 3 times [2018-11-10 09:50:19,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:50:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:50:19,037 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 09:50:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:19,052 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-10 09:50:19,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:50:19,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-10 09:50:19,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2018-11-10 09:50:19,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:19,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:19,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-11-10 09:50:19,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:19,053 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 09:50:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-11-10 09:50:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-10 09:50:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 09:50:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-10 09:50:19,055 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-10 09:50:19,055 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-10 09:50:19,055 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 09:50:19,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-11-10 09:50:19,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:19,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:19,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 7, 1, 1, 1] [2018-11-10 09:50:19,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:19,056 INFO L793 eck$LassoCheckResult]: Stem: 1312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1309#L10-2 assume true; 1313#L9-1 assume !!(main_~i~0 < 100); 1315#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1335#L10-2 assume true; 1316#L9-1 assume !!(main_~i~0 < 100); 1310#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1311#L10-2 assume true; 1314#L9-1 assume !!(main_~i~0 < 100); 1334#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1333#L10-2 assume true; 1332#L9-1 assume !!(main_~i~0 < 100); 1331#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1330#L10-2 assume true; 1329#L9-1 assume !!(main_~i~0 < 100); 1328#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1327#L10-2 assume true; 1326#L9-1 assume !!(main_~i~0 < 100); 1325#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1324#L10-2 assume true; 1322#L9-1 assume !!(main_~i~0 < 100); 1323#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1321#L10-2 assume true; 1319#L9-1 assume !!(main_~i~0 < 100); 1320#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1317#L10-2 assume true; 1318#L9-1 [2018-11-10 09:50:19,057 INFO L795 eck$LassoCheckResult]: Loop: 1318#L9-1 assume !!(main_~i~0 < 100); 1323#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1321#L10-2 assume true; 1319#L9-1 assume !!(main_~i~0 < 100); 1320#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1317#L10-2 assume true; 1318#L9-1 [2018-11-10 09:50:19,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -930664351, now seen corresponding path program 7 times [2018-11-10 09:50:19,057 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:19,100 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:19,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 09:50:19,143 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:19,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 4 times [2018-11-10 09:50:19,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:50:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:50:19,164 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-10 09:50:19,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:19,179 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-10 09:50:19,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:50:19,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-11-10 09:50:19,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2018-11-10 09:50:19,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:19,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:19,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2018-11-10 09:50:19,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:19,181 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 09:50:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2018-11-10 09:50:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-10 09:50:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 09:50:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-10 09:50:19,182 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-10 09:50:19,182 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-10 09:50:19,182 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 09:50:19,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-11-10 09:50:19,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:19,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:19,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 8, 1, 1, 1] [2018-11-10 09:50:19,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:19,184 INFO L793 eck$LassoCheckResult]: Stem: 1466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1462#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1463#L10-2 assume true; 1467#L9-1 assume !!(main_~i~0 < 100); 1469#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1492#L10-2 assume true; 1470#L9-1 assume !!(main_~i~0 < 100); 1464#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1465#L10-2 assume true; 1468#L9-1 assume !!(main_~i~0 < 100); 1491#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1490#L10-2 assume true; 1489#L9-1 assume !!(main_~i~0 < 100); 1488#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1487#L10-2 assume true; 1486#L9-1 assume !!(main_~i~0 < 100); 1485#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1484#L10-2 assume true; 1483#L9-1 assume !!(main_~i~0 < 100); 1482#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1481#L10-2 assume true; 1480#L9-1 assume !!(main_~i~0 < 100); 1479#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1478#L10-2 assume true; 1476#L9-1 assume !!(main_~i~0 < 100); 1477#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1475#L10-2 assume true; 1473#L9-1 assume !!(main_~i~0 < 100); 1474#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1471#L10-2 assume true; 1472#L9-1 [2018-11-10 09:50:19,184 INFO L795 eck$LassoCheckResult]: Loop: 1472#L9-1 assume !!(main_~i~0 < 100); 1477#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1475#L10-2 assume true; 1473#L9-1 assume !!(main_~i~0 < 100); 1474#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1471#L10-2 assume true; 1472#L9-1 [2018-11-10 09:50:19,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1409619938, now seen corresponding path program 8 times [2018-11-10 09:50:19,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:19,234 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:19,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:19,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:19,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:19,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 09:50:19,268 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:19,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 5 times [2018-11-10 09:50:19,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:50:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:50:19,284 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-10 09:50:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:19,299 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-10 09:50:19,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:50:19,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2018-11-10 09:50:19,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2018-11-10 09:50:19,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:19,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:19,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2018-11-10 09:50:19,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:19,300 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-10 09:50:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2018-11-10 09:50:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-10 09:50:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 09:50:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-10 09:50:19,302 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-10 09:50:19,302 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-10 09:50:19,302 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 09:50:19,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 36 transitions. [2018-11-10 09:50:19,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:19,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:19,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 9, 1, 1, 1] [2018-11-10 09:50:19,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:19,304 INFO L793 eck$LassoCheckResult]: Stem: 1636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1633#L10-2 assume true; 1637#L9-1 assume !!(main_~i~0 < 100); 1638#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1665#L10-2 assume true; 1639#L9-1 assume !!(main_~i~0 < 100); 1634#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1635#L10-2 assume true; 1640#L9-1 assume !!(main_~i~0 < 100); 1664#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1663#L10-2 assume true; 1662#L9-1 assume !!(main_~i~0 < 100); 1661#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1660#L10-2 assume true; 1659#L9-1 assume !!(main_~i~0 < 100); 1658#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1657#L10-2 assume true; 1656#L9-1 assume !!(main_~i~0 < 100); 1655#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1654#L10-2 assume true; 1653#L9-1 assume !!(main_~i~0 < 100); 1652#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1651#L10-2 assume true; 1650#L9-1 assume !!(main_~i~0 < 100); 1649#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1648#L10-2 assume true; 1646#L9-1 assume !!(main_~i~0 < 100); 1647#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1645#L10-2 assume true; 1643#L9-1 assume !!(main_~i~0 < 100); 1644#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1641#L10-2 assume true; 1642#L9-1 [2018-11-10 09:50:19,304 INFO L795 eck$LassoCheckResult]: Loop: 1642#L9-1 assume !!(main_~i~0 < 100); 1647#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1645#L10-2 assume true; 1643#L9-1 assume !!(main_~i~0 < 100); 1644#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1641#L10-2 assume true; 1642#L9-1 [2018-11-10 09:50:19,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2094154943, now seen corresponding path program 9 times [2018-11-10 09:50:19,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:19,371 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:19,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:19,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 09:50:19,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:19,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:19,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-10 09:50:19,408 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:19,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 6 times [2018-11-10 09:50:19,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:50:19,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:50:19,426 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 09:50:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:19,448 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-10 09:50:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:50:19,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2018-11-10 09:50:19,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2018-11-10 09:50:19,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:19,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:19,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-11-10 09:50:19,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:19,450 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-10 09:50:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-11-10 09:50:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-10 09:50:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 09:50:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-10 09:50:19,452 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-10 09:50:19,452 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-10 09:50:19,452 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 09:50:19,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2018-11-10 09:50:19,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:19,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:19,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 10, 1, 1, 1] [2018-11-10 09:50:19,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:19,453 INFO L793 eck$LassoCheckResult]: Stem: 1822#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1819#L10-2 assume true; 1823#L9-1 assume !!(main_~i~0 < 100); 1824#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1854#L10-2 assume true; 1825#L9-1 assume !!(main_~i~0 < 100); 1820#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1821#L10-2 assume true; 1826#L9-1 assume !!(main_~i~0 < 100); 1853#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1852#L10-2 assume true; 1851#L9-1 assume !!(main_~i~0 < 100); 1850#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1849#L10-2 assume true; 1848#L9-1 assume !!(main_~i~0 < 100); 1847#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1846#L10-2 assume true; 1845#L9-1 assume !!(main_~i~0 < 100); 1844#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1843#L10-2 assume true; 1842#L9-1 assume !!(main_~i~0 < 100); 1841#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1840#L10-2 assume true; 1839#L9-1 assume !!(main_~i~0 < 100); 1838#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1837#L10-2 assume true; 1836#L9-1 assume !!(main_~i~0 < 100); 1835#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1834#L10-2 assume true; 1832#L9-1 assume !!(main_~i~0 < 100); 1833#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1831#L10-2 assume true; 1829#L9-1 assume !!(main_~i~0 < 100); 1830#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1827#L10-2 assume true; 1828#L9-1 [2018-11-10 09:50:19,454 INFO L795 eck$LassoCheckResult]: Loop: 1828#L9-1 assume !!(main_~i~0 < 100); 1833#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 1831#L10-2 assume true; 1829#L9-1 assume !!(main_~i~0 < 100); 1830#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1827#L10-2 assume true; 1828#L9-1 [2018-11-10 09:50:19,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1723199806, now seen corresponding path program 10 times [2018-11-10 09:50:19,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:19,514 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:19,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:19,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:19,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:19,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:19,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-10 09:50:19,560 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:19,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 7 times [2018-11-10 09:50:19,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:50:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:50:19,588 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-10 09:50:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:19,613 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-10 09:50:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 09:50:19,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2018-11-10 09:50:19,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2018-11-10 09:50:19,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:19,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:19,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2018-11-10 09:50:19,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:19,615 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-10 09:50:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2018-11-10 09:50:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-10 09:50:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 09:50:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-10 09:50:19,616 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-10 09:50:19,616 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-10 09:50:19,616 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 09:50:19,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 42 transitions. [2018-11-10 09:50:19,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:19,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:19,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 11, 1, 1, 1] [2018-11-10 09:50:19,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:19,617 INFO L793 eck$LassoCheckResult]: Stem: 2024#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2020#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2021#L10-2 assume true; 2025#L9-1 assume !!(main_~i~0 < 100); 2022#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2023#L10-2 assume true; 2026#L9-1 assume !!(main_~i~0 < 100); 2027#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2059#L10-2 assume true; 2058#L9-1 assume !!(main_~i~0 < 100); 2057#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2056#L10-2 assume true; 2055#L9-1 assume !!(main_~i~0 < 100); 2054#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2053#L10-2 assume true; 2052#L9-1 assume !!(main_~i~0 < 100); 2051#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2050#L10-2 assume true; 2049#L9-1 assume !!(main_~i~0 < 100); 2048#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2047#L10-2 assume true; 2046#L9-1 assume !!(main_~i~0 < 100); 2045#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2044#L10-2 assume true; 2043#L9-1 assume !!(main_~i~0 < 100); 2042#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2041#L10-2 assume true; 2040#L9-1 assume !!(main_~i~0 < 100); 2039#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2038#L10-2 assume true; 2037#L9-1 assume !!(main_~i~0 < 100); 2036#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2035#L10-2 assume true; 2033#L9-1 assume !!(main_~i~0 < 100); 2034#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2032#L10-2 assume true; 2030#L9-1 assume !!(main_~i~0 < 100); 2031#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2028#L10-2 assume true; 2029#L9-1 [2018-11-10 09:50:19,617 INFO L795 eck$LassoCheckResult]: Loop: 2029#L9-1 assume !!(main_~i~0 < 100); 2034#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2032#L10-2 assume true; 2030#L9-1 assume !!(main_~i~0 < 100); 2031#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2028#L10-2 assume true; 2029#L9-1 [2018-11-10 09:50:19,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1900503519, now seen corresponding path program 11 times [2018-11-10 09:50:19,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:19,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:19,684 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:19,690 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:19,705 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-10 09:50:19,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:19,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:19,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-10 09:50:19,732 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:19,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 8 times [2018-11-10 09:50:19,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:50:19,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:50:19,767 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. cyclomatic complexity: 3 Second operand 14 states. [2018-11-10 09:50:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:19,799 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-10 09:50:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:50:19,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 49 transitions. [2018-11-10 09:50:19,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 47 transitions. [2018-11-10 09:50:19,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:19,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:19,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 47 transitions. [2018-11-10 09:50:19,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:19,801 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-10 09:50:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 47 transitions. [2018-11-10 09:50:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-10 09:50:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 09:50:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-10 09:50:19,803 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-10 09:50:19,803 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-10 09:50:19,803 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 09:50:19,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2018-11-10 09:50:19,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:19,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:19,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:19,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 12, 1, 1, 1] [2018-11-10 09:50:19,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:19,804 INFO L793 eck$LassoCheckResult]: Stem: 2242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2239#L10-2 assume true; 2243#L9-1 assume !!(main_~i~0 < 100); 2245#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2280#L10-2 assume true; 2246#L9-1 assume !!(main_~i~0 < 100); 2240#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2241#L10-2 assume true; 2244#L9-1 assume !!(main_~i~0 < 100); 2279#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2278#L10-2 assume true; 2277#L9-1 assume !!(main_~i~0 < 100); 2276#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2275#L10-2 assume true; 2274#L9-1 assume !!(main_~i~0 < 100); 2273#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2272#L10-2 assume true; 2271#L9-1 assume !!(main_~i~0 < 100); 2270#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2269#L10-2 assume true; 2268#L9-1 assume !!(main_~i~0 < 100); 2267#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2266#L10-2 assume true; 2265#L9-1 assume !!(main_~i~0 < 100); 2264#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2263#L10-2 assume true; 2262#L9-1 assume !!(main_~i~0 < 100); 2261#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2260#L10-2 assume true; 2259#L9-1 assume !!(main_~i~0 < 100); 2258#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2257#L10-2 assume true; 2256#L9-1 assume !!(main_~i~0 < 100); 2255#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2254#L10-2 assume true; 2252#L9-1 assume !!(main_~i~0 < 100); 2253#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2251#L10-2 assume true; 2249#L9-1 assume !!(main_~i~0 < 100); 2250#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2247#L10-2 assume true; 2248#L9-1 [2018-11-10 09:50:19,804 INFO L795 eck$LassoCheckResult]: Loop: 2248#L9-1 assume !!(main_~i~0 < 100); 2253#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2251#L10-2 assume true; 2249#L9-1 assume !!(main_~i~0 < 100); 2250#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2247#L10-2 assume true; 2248#L9-1 [2018-11-10 09:50:19,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1643273634, now seen corresponding path program 12 times [2018-11-10 09:50:19,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:19,914 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:19,922 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:19,935 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-10 09:50:19,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:19,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:19,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:19,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-10 09:50:19,970 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:19,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 9 times [2018-11-10 09:50:19,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:50:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:50:20,000 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 3 Second operand 15 states. [2018-11-10 09:50:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:20,030 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-10 09:50:20,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 09:50:20,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 52 transitions. [2018-11-10 09:50:20,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 50 transitions. [2018-11-10 09:50:20,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:20,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:20,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2018-11-10 09:50:20,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:20,032 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-10 09:50:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2018-11-10 09:50:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-10 09:50:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 09:50:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-10 09:50:20,034 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-10 09:50:20,034 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-10 09:50:20,034 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 09:50:20,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 48 transitions. [2018-11-10 09:50:20,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:20,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:20,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 13, 1, 1, 1] [2018-11-10 09:50:20,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:20,038 INFO L793 eck$LassoCheckResult]: Stem: 2476#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2472#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2473#L10-2 assume true; 2477#L9-1 assume !!(main_~i~0 < 100); 2479#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2517#L10-2 assume true; 2480#L9-1 assume !!(main_~i~0 < 100); 2474#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2475#L10-2 assume true; 2478#L9-1 assume !!(main_~i~0 < 100); 2516#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2515#L10-2 assume true; 2514#L9-1 assume !!(main_~i~0 < 100); 2513#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2512#L10-2 assume true; 2511#L9-1 assume !!(main_~i~0 < 100); 2510#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2509#L10-2 assume true; 2508#L9-1 assume !!(main_~i~0 < 100); 2507#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2506#L10-2 assume true; 2505#L9-1 assume !!(main_~i~0 < 100); 2504#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2503#L10-2 assume true; 2502#L9-1 assume !!(main_~i~0 < 100); 2501#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2500#L10-2 assume true; 2499#L9-1 assume !!(main_~i~0 < 100); 2498#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2497#L10-2 assume true; 2496#L9-1 assume !!(main_~i~0 < 100); 2495#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2494#L10-2 assume true; 2493#L9-1 assume !!(main_~i~0 < 100); 2492#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2491#L10-2 assume true; 2490#L9-1 assume !!(main_~i~0 < 100); 2489#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2488#L10-2 assume true; 2486#L9-1 assume !!(main_~i~0 < 100); 2487#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2485#L10-2 assume true; 2483#L9-1 assume !!(main_~i~0 < 100); 2484#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2481#L10-2 assume true; 2482#L9-1 [2018-11-10 09:50:20,038 INFO L795 eck$LassoCheckResult]: Loop: 2482#L9-1 assume !!(main_~i~0 < 100); 2487#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2485#L10-2 assume true; 2483#L9-1 assume !!(main_~i~0 < 100); 2484#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2481#L10-2 assume true; 2482#L9-1 [2018-11-10 09:50:20,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,038 INFO L82 PathProgramCache]: Analyzing trace with hash -729425663, now seen corresponding path program 13 times [2018-11-10 09:50:20,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:20,138 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:20,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:20,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:20,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-10 09:50:20,196 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:20,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 10 times [2018-11-10 09:50:20,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 09:50:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:50:20,225 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. cyclomatic complexity: 3 Second operand 16 states. [2018-11-10 09:50:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:20,273 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-10 09:50:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 09:50:20,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 55 transitions. [2018-11-10 09:50:20,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 53 transitions. [2018-11-10 09:50:20,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:20,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:20,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2018-11-10 09:50:20,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:20,276 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-10 09:50:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2018-11-10 09:50:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-10 09:50:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 09:50:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-10 09:50:20,278 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-10 09:50:20,278 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-10 09:50:20,278 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 09:50:20,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 51 transitions. [2018-11-10 09:50:20,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:20,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:20,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 14, 1, 1, 1] [2018-11-10 09:50:20,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:20,280 INFO L793 eck$LassoCheckResult]: Stem: 2726#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2723#L10-2 assume true; 2727#L9-1 assume !!(main_~i~0 < 100); 2724#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2725#L10-2 assume true; 2728#L9-1 assume !!(main_~i~0 < 100); 2729#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2770#L10-2 assume true; 2769#L9-1 assume !!(main_~i~0 < 100); 2768#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2767#L10-2 assume true; 2766#L9-1 assume !!(main_~i~0 < 100); 2765#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2764#L10-2 assume true; 2763#L9-1 assume !!(main_~i~0 < 100); 2762#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2761#L10-2 assume true; 2760#L9-1 assume !!(main_~i~0 < 100); 2759#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2758#L10-2 assume true; 2757#L9-1 assume !!(main_~i~0 < 100); 2756#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2755#L10-2 assume true; 2754#L9-1 assume !!(main_~i~0 < 100); 2753#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2752#L10-2 assume true; 2751#L9-1 assume !!(main_~i~0 < 100); 2750#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2749#L10-2 assume true; 2748#L9-1 assume !!(main_~i~0 < 100); 2747#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2746#L10-2 assume true; 2745#L9-1 assume !!(main_~i~0 < 100); 2744#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2743#L10-2 assume true; 2742#L9-1 assume !!(main_~i~0 < 100); 2741#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2740#L10-2 assume true; 2739#L9-1 assume !!(main_~i~0 < 100); 2738#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2737#L10-2 assume true; 2735#L9-1 assume !!(main_~i~0 < 100); 2736#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2734#L10-2 assume true; 2732#L9-1 assume !!(main_~i~0 < 100); 2733#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2730#L10-2 assume true; 2731#L9-1 [2018-11-10 09:50:20,280 INFO L795 eck$LassoCheckResult]: Loop: 2731#L9-1 assume !!(main_~i~0 < 100); 2736#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2734#L10-2 assume true; 2732#L9-1 assume !!(main_~i~0 < 100); 2733#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2730#L10-2 assume true; 2731#L9-1 [2018-11-10 09:50:20,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2082210946, now seen corresponding path program 14 times [2018-11-10 09:50:20,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 15 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:20,394 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:20,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:20,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:20,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:20,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 15 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:20,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-10 09:50:20,437 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:20,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 11 times [2018-11-10 09:50:20,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:20,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 09:50:20,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-10 09:50:20,460 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. cyclomatic complexity: 3 Second operand 17 states. [2018-11-10 09:50:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:20,492 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-10 09:50:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 09:50:20,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 58 transitions. [2018-11-10 09:50:20,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 56 transitions. [2018-11-10 09:50:20,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:20,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:20,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 56 transitions. [2018-11-10 09:50:20,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:20,494 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-10 09:50:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 56 transitions. [2018-11-10 09:50:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-10 09:50:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 09:50:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-10 09:50:20,504 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-10 09:50:20,504 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-10 09:50:20,504 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 09:50:20,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 54 transitions. [2018-11-10 09:50:20,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:20,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:20,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 15, 1, 1, 1] [2018-11-10 09:50:20,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:20,505 INFO L793 eck$LassoCheckResult]: Stem: 2992#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2989#L10-2 assume true; 2993#L9-1 assume !!(main_~i~0 < 100); 2994#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3039#L10-2 assume true; 2995#L9-1 assume !!(main_~i~0 < 100); 2990#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 2991#L10-2 assume true; 2996#L9-1 assume !!(main_~i~0 < 100); 3038#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3037#L10-2 assume true; 3036#L9-1 assume !!(main_~i~0 < 100); 3035#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3034#L10-2 assume true; 3033#L9-1 assume !!(main_~i~0 < 100); 3032#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3031#L10-2 assume true; 3030#L9-1 assume !!(main_~i~0 < 100); 3029#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3028#L10-2 assume true; 3027#L9-1 assume !!(main_~i~0 < 100); 3026#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3025#L10-2 assume true; 3024#L9-1 assume !!(main_~i~0 < 100); 3023#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3022#L10-2 assume true; 3021#L9-1 assume !!(main_~i~0 < 100); 3020#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3019#L10-2 assume true; 3018#L9-1 assume !!(main_~i~0 < 100); 3017#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3016#L10-2 assume true; 3015#L9-1 assume !!(main_~i~0 < 100); 3014#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3013#L10-2 assume true; 3012#L9-1 assume !!(main_~i~0 < 100); 3011#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3010#L10-2 assume true; 3009#L9-1 assume !!(main_~i~0 < 100); 3008#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3007#L10-2 assume true; 3006#L9-1 assume !!(main_~i~0 < 100); 3005#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3004#L10-2 assume true; 3002#L9-1 assume !!(main_~i~0 < 100); 3003#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3001#L10-2 assume true; 2999#L9-1 assume !!(main_~i~0 < 100); 3000#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2997#L10-2 assume true; 2998#L9-1 [2018-11-10 09:50:20,506 INFO L795 eck$LassoCheckResult]: Loop: 2998#L9-1 assume !!(main_~i~0 < 100); 3003#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3001#L10-2 assume true; 2999#L9-1 assume !!(main_~i~0 < 100); 3000#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2997#L10-2 assume true; 2998#L9-1 [2018-11-10 09:50:20,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1064528865, now seen corresponding path program 15 times [2018-11-10 09:50:20,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:20,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 16 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:20,627 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:20,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:20,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-10 09:50:20,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:20,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 16 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:20,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-10 09:50:20,677 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:20,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 12 times [2018-11-10 09:50:20,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 09:50:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-10 09:50:20,695 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. cyclomatic complexity: 3 Second operand 18 states. [2018-11-10 09:50:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:20,722 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-10 09:50:20,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 09:50:20,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 61 transitions. [2018-11-10 09:50:20,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 59 transitions. [2018-11-10 09:50:20,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:20,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:20,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 59 transitions. [2018-11-10 09:50:20,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:20,724 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-10 09:50:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 59 transitions. [2018-11-10 09:50:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-10 09:50:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 09:50:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-10 09:50:20,725 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-10 09:50:20,725 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-10 09:50:20,725 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 09:50:20,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2018-11-10 09:50:20,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:20,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:20,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 16, 1, 1, 1] [2018-11-10 09:50:20,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:20,726 INFO L793 eck$LassoCheckResult]: Stem: 3274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 3271#L10-2 assume true; 3275#L9-1 assume !!(main_~i~0 < 100); 3277#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3324#L10-2 assume true; 3278#L9-1 assume !!(main_~i~0 < 100); 3272#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3273#L10-2 assume true; 3276#L9-1 assume !!(main_~i~0 < 100); 3323#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3322#L10-2 assume true; 3321#L9-1 assume !!(main_~i~0 < 100); 3320#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3319#L10-2 assume true; 3318#L9-1 assume !!(main_~i~0 < 100); 3317#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3316#L10-2 assume true; 3315#L9-1 assume !!(main_~i~0 < 100); 3314#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3313#L10-2 assume true; 3312#L9-1 assume !!(main_~i~0 < 100); 3311#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3310#L10-2 assume true; 3309#L9-1 assume !!(main_~i~0 < 100); 3308#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3307#L10-2 assume true; 3306#L9-1 assume !!(main_~i~0 < 100); 3305#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3304#L10-2 assume true; 3303#L9-1 assume !!(main_~i~0 < 100); 3302#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3301#L10-2 assume true; 3300#L9-1 assume !!(main_~i~0 < 100); 3299#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3298#L10-2 assume true; 3297#L9-1 assume !!(main_~i~0 < 100); 3296#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3295#L10-2 assume true; 3294#L9-1 assume !!(main_~i~0 < 100); 3293#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3292#L10-2 assume true; 3291#L9-1 assume !!(main_~i~0 < 100); 3290#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3289#L10-2 assume true; 3288#L9-1 assume !!(main_~i~0 < 100); 3287#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3286#L10-2 assume true; 3284#L9-1 assume !!(main_~i~0 < 100); 3285#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3283#L10-2 assume true; 3281#L9-1 assume !!(main_~i~0 < 100); 3282#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3279#L10-2 assume true; 3280#L9-1 [2018-11-10 09:50:20,726 INFO L795 eck$LassoCheckResult]: Loop: 3280#L9-1 assume !!(main_~i~0 < 100); 3285#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3283#L10-2 assume true; 3281#L9-1 assume !!(main_~i~0 < 100); 3282#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3279#L10-2 assume true; 3280#L9-1 [2018-11-10 09:50:20,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -660931426, now seen corresponding path program 16 times [2018-11-10 09:50:20,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 17 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:20,837 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:20,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:20,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:20,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:20,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 17 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:20,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:20,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-10 09:50:20,873 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:20,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 13 times [2018-11-10 09:50:20,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:20,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 09:50:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-10 09:50:20,903 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 3 Second operand 19 states. [2018-11-10 09:50:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:20,930 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-10 09:50:20,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 09:50:20,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 64 transitions. [2018-11-10 09:50:20,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 60 states and 62 transitions. [2018-11-10 09:50:20,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:20,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:20,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 62 transitions. [2018-11-10 09:50:20,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:20,932 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-10 09:50:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 62 transitions. [2018-11-10 09:50:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-10 09:50:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 09:50:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-10 09:50:20,933 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-10 09:50:20,933 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-10 09:50:20,933 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 09:50:20,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 60 transitions. [2018-11-10 09:50:20,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:20,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:20,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:20,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 17, 1, 1, 1] [2018-11-10 09:50:20,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:20,934 INFO L793 eck$LassoCheckResult]: Stem: 3572#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3568#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 3569#L10-2 assume true; 3573#L9-1 assume !!(main_~i~0 < 100); 3575#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3625#L10-2 assume true; 3576#L9-1 assume !!(main_~i~0 < 100); 3570#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3571#L10-2 assume true; 3574#L9-1 assume !!(main_~i~0 < 100); 3624#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3623#L10-2 assume true; 3622#L9-1 assume !!(main_~i~0 < 100); 3621#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3620#L10-2 assume true; 3619#L9-1 assume !!(main_~i~0 < 100); 3618#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3617#L10-2 assume true; 3616#L9-1 assume !!(main_~i~0 < 100); 3615#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3614#L10-2 assume true; 3613#L9-1 assume !!(main_~i~0 < 100); 3612#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3611#L10-2 assume true; 3610#L9-1 assume !!(main_~i~0 < 100); 3609#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3608#L10-2 assume true; 3607#L9-1 assume !!(main_~i~0 < 100); 3606#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3605#L10-2 assume true; 3604#L9-1 assume !!(main_~i~0 < 100); 3603#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3602#L10-2 assume true; 3601#L9-1 assume !!(main_~i~0 < 100); 3600#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3599#L10-2 assume true; 3598#L9-1 assume !!(main_~i~0 < 100); 3597#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3596#L10-2 assume true; 3595#L9-1 assume !!(main_~i~0 < 100); 3594#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3593#L10-2 assume true; 3592#L9-1 assume !!(main_~i~0 < 100); 3591#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3590#L10-2 assume true; 3589#L9-1 assume !!(main_~i~0 < 100); 3588#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3587#L10-2 assume true; 3586#L9-1 assume !!(main_~i~0 < 100); 3585#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3584#L10-2 assume true; 3582#L9-1 assume !!(main_~i~0 < 100); 3583#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3581#L10-2 assume true; 3579#L9-1 assume !!(main_~i~0 < 100); 3580#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3577#L10-2 assume true; 3578#L9-1 [2018-11-10 09:50:20,934 INFO L795 eck$LassoCheckResult]: Loop: 3578#L9-1 assume !!(main_~i~0 < 100); 3583#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3581#L10-2 assume true; 3579#L9-1 assume !!(main_~i~0 < 100); 3580#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3577#L10-2 assume true; 3578#L9-1 [2018-11-10 09:50:20,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1679862079, now seen corresponding path program 17 times [2018-11-10 09:50:20,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:20,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 18 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:21,068 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:21,086 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-10 09:50:21,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:21,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 18 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:21,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-10 09:50:21,111 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:21,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 14 times [2018-11-10 09:50:21,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:21,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:21,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:21,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:21,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 09:50:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-10 09:50:21,126 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. cyclomatic complexity: 3 Second operand 20 states. [2018-11-10 09:50:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:21,158 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-10 09:50:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 09:50:21,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 67 transitions. [2018-11-10 09:50:21,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:21,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 63 states and 65 transitions. [2018-11-10 09:50:21,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:21,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:21,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 65 transitions. [2018-11-10 09:50:21,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:21,160 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-10 09:50:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 65 transitions. [2018-11-10 09:50:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-10 09:50:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 09:50:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-10 09:50:21,162 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-10 09:50:21,162 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-10 09:50:21,162 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 09:50:21,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 63 transitions. [2018-11-10 09:50:21,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:21,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:21,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:21,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 18, 1, 1, 1] [2018-11-10 09:50:21,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:21,163 INFO L793 eck$LassoCheckResult]: Stem: 3886#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 3883#L10-2 assume true; 3887#L9-1 assume !!(main_~i~0 < 100); 3889#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3942#L10-2 assume true; 3890#L9-1 assume !!(main_~i~0 < 100); 3884#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3885#L10-2 assume true; 3888#L9-1 assume !!(main_~i~0 < 100); 3941#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3940#L10-2 assume true; 3939#L9-1 assume !!(main_~i~0 < 100); 3938#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3937#L10-2 assume true; 3936#L9-1 assume !!(main_~i~0 < 100); 3935#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3934#L10-2 assume true; 3933#L9-1 assume !!(main_~i~0 < 100); 3932#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3931#L10-2 assume true; 3930#L9-1 assume !!(main_~i~0 < 100); 3929#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3928#L10-2 assume true; 3927#L9-1 assume !!(main_~i~0 < 100); 3926#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3925#L10-2 assume true; 3924#L9-1 assume !!(main_~i~0 < 100); 3923#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3922#L10-2 assume true; 3921#L9-1 assume !!(main_~i~0 < 100); 3920#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3919#L10-2 assume true; 3918#L9-1 assume !!(main_~i~0 < 100); 3917#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3916#L10-2 assume true; 3915#L9-1 assume !!(main_~i~0 < 100); 3914#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3913#L10-2 assume true; 3912#L9-1 assume !!(main_~i~0 < 100); 3911#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3910#L10-2 assume true; 3909#L9-1 assume !!(main_~i~0 < 100); 3908#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3907#L10-2 assume true; 3906#L9-1 assume !!(main_~i~0 < 100); 3905#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3904#L10-2 assume true; 3903#L9-1 assume !!(main_~i~0 < 100); 3902#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3901#L10-2 assume true; 3900#L9-1 assume !!(main_~i~0 < 100); 3899#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3898#L10-2 assume true; 3896#L9-1 assume !!(main_~i~0 < 100); 3897#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3895#L10-2 assume true; 3893#L9-1 assume !!(main_~i~0 < 100); 3894#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3891#L10-2 assume true; 3892#L9-1 [2018-11-10 09:50:21,164 INFO L795 eck$LassoCheckResult]: Loop: 3892#L9-1 assume !!(main_~i~0 < 100); 3897#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 3895#L10-2 assume true; 3893#L9-1 assume !!(main_~i~0 < 100); 3894#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3891#L10-2 assume true; 3892#L9-1 [2018-11-10 09:50:21,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash 185902526, now seen corresponding path program 18 times [2018-11-10 09:50:21,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:21,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 19 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:21,296 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:21,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:21,316 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-11-10 09:50:21,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:21,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 19 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:21,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-10 09:50:21,343 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:21,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 15 times [2018-11-10 09:50:21,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 09:50:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-10 09:50:21,361 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. cyclomatic complexity: 3 Second operand 21 states. [2018-11-10 09:50:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:21,401 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-10 09:50:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 09:50:21,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 70 transitions. [2018-11-10 09:50:21,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:21,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 68 transitions. [2018-11-10 09:50:21,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:21,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:21,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 68 transitions. [2018-11-10 09:50:21,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:21,404 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-10 09:50:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 68 transitions. [2018-11-10 09:50:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-10 09:50:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 09:50:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-10 09:50:21,406 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-10 09:50:21,406 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-10 09:50:21,406 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 09:50:21,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 66 transitions. [2018-11-10 09:50:21,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:21,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:21,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:21,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 19, 1, 1, 1] [2018-11-10 09:50:21,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:21,415 INFO L793 eck$LassoCheckResult]: Stem: 4216#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 4213#L10-2 assume true; 4217#L9-1 assume !!(main_~i~0 < 100); 4214#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4215#L10-2 assume true; 4218#L9-1 assume !!(main_~i~0 < 100); 4219#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4275#L10-2 assume true; 4274#L9-1 assume !!(main_~i~0 < 100); 4273#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4272#L10-2 assume true; 4271#L9-1 assume !!(main_~i~0 < 100); 4270#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4269#L10-2 assume true; 4268#L9-1 assume !!(main_~i~0 < 100); 4267#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4266#L10-2 assume true; 4265#L9-1 assume !!(main_~i~0 < 100); 4264#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4263#L10-2 assume true; 4262#L9-1 assume !!(main_~i~0 < 100); 4261#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4260#L10-2 assume true; 4259#L9-1 assume !!(main_~i~0 < 100); 4258#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4257#L10-2 assume true; 4256#L9-1 assume !!(main_~i~0 < 100); 4255#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4254#L10-2 assume true; 4253#L9-1 assume !!(main_~i~0 < 100); 4252#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4251#L10-2 assume true; 4250#L9-1 assume !!(main_~i~0 < 100); 4249#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4248#L10-2 assume true; 4247#L9-1 assume !!(main_~i~0 < 100); 4246#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4245#L10-2 assume true; 4244#L9-1 assume !!(main_~i~0 < 100); 4243#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4242#L10-2 assume true; 4241#L9-1 assume !!(main_~i~0 < 100); 4240#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4239#L10-2 assume true; 4238#L9-1 assume !!(main_~i~0 < 100); 4237#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4236#L10-2 assume true; 4235#L9-1 assume !!(main_~i~0 < 100); 4234#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4233#L10-2 assume true; 4232#L9-1 assume !!(main_~i~0 < 100); 4231#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4230#L10-2 assume true; 4229#L9-1 assume !!(main_~i~0 < 100); 4228#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4227#L10-2 assume true; 4225#L9-1 assume !!(main_~i~0 < 100); 4226#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4224#L10-2 assume true; 4222#L9-1 assume !!(main_~i~0 < 100); 4223#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4220#L10-2 assume true; 4221#L9-1 [2018-11-10 09:50:21,415 INFO L795 eck$LassoCheckResult]: Loop: 4221#L9-1 assume !!(main_~i~0 < 100); 4226#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4224#L10-2 assume true; 4222#L9-1 assume !!(main_~i~0 < 100); 4223#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4220#L10-2 assume true; 4221#L9-1 [2018-11-10 09:50:21,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:21,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2007472545, now seen corresponding path program 19 times [2018-11-10 09:50:21,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:21,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:21,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:21,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 20 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:21,602 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:21,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:21,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 20 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:21,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-10 09:50:21,661 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:21,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 16 times [2018-11-10 09:50:21,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:21,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 09:50:21,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-10 09:50:21,687 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. cyclomatic complexity: 3 Second operand 22 states. [2018-11-10 09:50:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:21,723 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-10 09:50:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 09:50:21,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 73 transitions. [2018-11-10 09:50:21,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:21,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 71 transitions. [2018-11-10 09:50:21,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:21,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:21,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 71 transitions. [2018-11-10 09:50:21,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:21,727 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-11-10 09:50:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 71 transitions. [2018-11-10 09:50:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-10 09:50:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 09:50:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-10 09:50:21,729 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-10 09:50:21,729 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-10 09:50:21,729 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 09:50:21,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 69 transitions. [2018-11-10 09:50:21,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:21,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:21,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:21,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 20, 1, 1, 1] [2018-11-10 09:50:21,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:21,730 INFO L793 eck$LassoCheckResult]: Stem: 4562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 4559#L10-2 assume true; 4563#L9-1 assume !!(main_~i~0 < 100); 4565#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4624#L10-2 assume true; 4566#L9-1 assume !!(main_~i~0 < 100); 4560#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4561#L10-2 assume true; 4564#L9-1 assume !!(main_~i~0 < 100); 4623#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4622#L10-2 assume true; 4621#L9-1 assume !!(main_~i~0 < 100); 4620#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4619#L10-2 assume true; 4618#L9-1 assume !!(main_~i~0 < 100); 4617#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4616#L10-2 assume true; 4615#L9-1 assume !!(main_~i~0 < 100); 4614#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4613#L10-2 assume true; 4612#L9-1 assume !!(main_~i~0 < 100); 4611#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4610#L10-2 assume true; 4609#L9-1 assume !!(main_~i~0 < 100); 4608#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4607#L10-2 assume true; 4606#L9-1 assume !!(main_~i~0 < 100); 4605#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4604#L10-2 assume true; 4603#L9-1 assume !!(main_~i~0 < 100); 4602#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4601#L10-2 assume true; 4600#L9-1 assume !!(main_~i~0 < 100); 4599#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4598#L10-2 assume true; 4597#L9-1 assume !!(main_~i~0 < 100); 4596#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4595#L10-2 assume true; 4594#L9-1 assume !!(main_~i~0 < 100); 4593#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4592#L10-2 assume true; 4591#L9-1 assume !!(main_~i~0 < 100); 4590#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4589#L10-2 assume true; 4588#L9-1 assume !!(main_~i~0 < 100); 4587#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4586#L10-2 assume true; 4585#L9-1 assume !!(main_~i~0 < 100); 4584#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4583#L10-2 assume true; 4582#L9-1 assume !!(main_~i~0 < 100); 4581#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4580#L10-2 assume true; 4579#L9-1 assume !!(main_~i~0 < 100); 4578#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4577#L10-2 assume true; 4576#L9-1 assume !!(main_~i~0 < 100); 4575#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4574#L10-2 assume true; 4572#L9-1 assume !!(main_~i~0 < 100); 4573#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4571#L10-2 assume true; 4569#L9-1 assume !!(main_~i~0 < 100); 4570#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4567#L10-2 assume true; 4568#L9-1 [2018-11-10 09:50:21,730 INFO L795 eck$LassoCheckResult]: Loop: 4568#L9-1 assume !!(main_~i~0 < 100); 4573#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4571#L10-2 assume true; 4569#L9-1 assume !!(main_~i~0 < 100); 4570#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4567#L10-2 assume true; 4568#L9-1 [2018-11-10 09:50:21,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1488123614, now seen corresponding path program 20 times [2018-11-10 09:50:21,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:21,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:21,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 21 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:21,918 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:21,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:21,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:21,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:21,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 21 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:21,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:21,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-10 09:50:21,976 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:21,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 17 times [2018-11-10 09:50:21,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:21,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:21,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 09:50:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-10 09:50:22,004 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. cyclomatic complexity: 3 Second operand 23 states. [2018-11-10 09:50:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:22,041 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-10 09:50:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 09:50:22,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2018-11-10 09:50:22,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:22,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 72 states and 74 transitions. [2018-11-10 09:50:22,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:22,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:22,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 74 transitions. [2018-11-10 09:50:22,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:22,042 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-10 09:50:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 74 transitions. [2018-11-10 09:50:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-10 09:50:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 09:50:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-10 09:50:22,043 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-10 09:50:22,044 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-10 09:50:22,044 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 09:50:22,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 72 transitions. [2018-11-10 09:50:22,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:22,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:22,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:22,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 21, 1, 1, 1] [2018-11-10 09:50:22,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:22,045 INFO L793 eck$LassoCheckResult]: Stem: 4924#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4920#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 4921#L10-2 assume true; 4925#L9-1 assume !!(main_~i~0 < 100); 4926#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4989#L10-2 assume true; 4927#L9-1 assume !!(main_~i~0 < 100); 4922#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4923#L10-2 assume true; 4928#L9-1 assume !!(main_~i~0 < 100); 4988#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4987#L10-2 assume true; 4986#L9-1 assume !!(main_~i~0 < 100); 4985#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4984#L10-2 assume true; 4983#L9-1 assume !!(main_~i~0 < 100); 4982#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4981#L10-2 assume true; 4980#L9-1 assume !!(main_~i~0 < 100); 4979#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4978#L10-2 assume true; 4977#L9-1 assume !!(main_~i~0 < 100); 4976#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4975#L10-2 assume true; 4974#L9-1 assume !!(main_~i~0 < 100); 4973#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4972#L10-2 assume true; 4971#L9-1 assume !!(main_~i~0 < 100); 4970#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4969#L10-2 assume true; 4968#L9-1 assume !!(main_~i~0 < 100); 4967#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4966#L10-2 assume true; 4965#L9-1 assume !!(main_~i~0 < 100); 4964#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4963#L10-2 assume true; 4962#L9-1 assume !!(main_~i~0 < 100); 4961#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4960#L10-2 assume true; 4959#L9-1 assume !!(main_~i~0 < 100); 4958#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4957#L10-2 assume true; 4956#L9-1 assume !!(main_~i~0 < 100); 4955#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4954#L10-2 assume true; 4953#L9-1 assume !!(main_~i~0 < 100); 4952#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4951#L10-2 assume true; 4950#L9-1 assume !!(main_~i~0 < 100); 4949#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4948#L10-2 assume true; 4947#L9-1 assume !!(main_~i~0 < 100); 4946#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4945#L10-2 assume true; 4944#L9-1 assume !!(main_~i~0 < 100); 4943#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4942#L10-2 assume true; 4941#L9-1 assume !!(main_~i~0 < 100); 4940#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4939#L10-2 assume true; 4938#L9-1 assume !!(main_~i~0 < 100); 4937#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4936#L10-2 assume true; 4934#L9-1 assume !!(main_~i~0 < 100); 4935#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4933#L10-2 assume true; 4931#L9-1 assume !!(main_~i~0 < 100); 4932#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4929#L10-2 assume true; 4930#L9-1 [2018-11-10 09:50:22,045 INFO L795 eck$LassoCheckResult]: Loop: 4930#L9-1 assume !!(main_~i~0 < 100); 4935#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 4933#L10-2 assume true; 4931#L9-1 assume !!(main_~i~0 < 100); 4932#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4929#L10-2 assume true; 4930#L9-1 [2018-11-10 09:50:22,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash 36320385, now seen corresponding path program 21 times [2018-11-10 09:50:22,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:22,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:22,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 22 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:22,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:22,237 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:22,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:22,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-10 09:50:22,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:22,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 22 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:22,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:22,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-10 09:50:22,296 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:22,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 18 times [2018-11-10 09:50:22,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:22,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:22,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 09:50:22,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-10 09:50:22,315 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. cyclomatic complexity: 3 Second operand 24 states. [2018-11-10 09:50:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:22,363 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-10 09:50:22,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 09:50:22,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 79 transitions. [2018-11-10 09:50:22,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:22,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 75 states and 77 transitions. [2018-11-10 09:50:22,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:22,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:22,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 77 transitions. [2018-11-10 09:50:22,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:22,364 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-10 09:50:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 77 transitions. [2018-11-10 09:50:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-10 09:50:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 09:50:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-11-10 09:50:22,365 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-11-10 09:50:22,365 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-11-10 09:50:22,365 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-10 09:50:22,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2018-11-10 09:50:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:22,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:22,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:22,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 22, 1, 1, 1] [2018-11-10 09:50:22,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:22,366 INFO L793 eck$LassoCheckResult]: Stem: 5302#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 5299#L10-2 assume true; 5303#L9-1 assume !!(main_~i~0 < 100); 5300#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5301#L10-2 assume true; 5304#L9-1 assume !!(main_~i~0 < 100); 5305#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5370#L10-2 assume true; 5369#L9-1 assume !!(main_~i~0 < 100); 5368#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5367#L10-2 assume true; 5366#L9-1 assume !!(main_~i~0 < 100); 5365#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5364#L10-2 assume true; 5363#L9-1 assume !!(main_~i~0 < 100); 5362#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5361#L10-2 assume true; 5360#L9-1 assume !!(main_~i~0 < 100); 5359#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5358#L10-2 assume true; 5357#L9-1 assume !!(main_~i~0 < 100); 5356#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5355#L10-2 assume true; 5354#L9-1 assume !!(main_~i~0 < 100); 5353#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5352#L10-2 assume true; 5351#L9-1 assume !!(main_~i~0 < 100); 5350#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5349#L10-2 assume true; 5348#L9-1 assume !!(main_~i~0 < 100); 5347#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5346#L10-2 assume true; 5345#L9-1 assume !!(main_~i~0 < 100); 5344#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5343#L10-2 assume true; 5342#L9-1 assume !!(main_~i~0 < 100); 5341#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5340#L10-2 assume true; 5339#L9-1 assume !!(main_~i~0 < 100); 5338#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5337#L10-2 assume true; 5336#L9-1 assume !!(main_~i~0 < 100); 5335#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5334#L10-2 assume true; 5333#L9-1 assume !!(main_~i~0 < 100); 5332#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5331#L10-2 assume true; 5330#L9-1 assume !!(main_~i~0 < 100); 5329#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5328#L10-2 assume true; 5327#L9-1 assume !!(main_~i~0 < 100); 5326#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5325#L10-2 assume true; 5324#L9-1 assume !!(main_~i~0 < 100); 5323#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5322#L10-2 assume true; 5321#L9-1 assume !!(main_~i~0 < 100); 5320#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5319#L10-2 assume true; 5318#L9-1 assume !!(main_~i~0 < 100); 5317#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5316#L10-2 assume true; 5315#L9-1 assume !!(main_~i~0 < 100); 5314#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5313#L10-2 assume true; 5311#L9-1 assume !!(main_~i~0 < 100); 5312#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5310#L10-2 assume true; 5308#L9-1 assume !!(main_~i~0 < 100); 5309#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 5306#L10-2 assume true; 5307#L9-1 [2018-11-10 09:50:22,366 INFO L795 eck$LassoCheckResult]: Loop: 5307#L9-1 assume !!(main_~i~0 < 100); 5312#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5310#L10-2 assume true; 5308#L9-1 assume !!(main_~i~0 < 100); 5309#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 5306#L10-2 assume true; 5307#L9-1 [2018-11-10 09:50:22,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash -313004034, now seen corresponding path program 22 times [2018-11-10 09:50:22,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 23 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:22,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:22,640 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:22,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:22,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:22,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 23 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:22,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-10 09:50:22,688 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:22,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 19 times [2018-11-10 09:50:22,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:22,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 09:50:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-10 09:50:22,703 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. cyclomatic complexity: 3 Second operand 25 states. [2018-11-10 09:50:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:22,737 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-11-10 09:50:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 09:50:22,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 82 transitions. [2018-11-10 09:50:22,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:22,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 78 states and 80 transitions. [2018-11-10 09:50:22,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:22,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:22,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 80 transitions. [2018-11-10 09:50:22,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:22,739 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-10 09:50:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 80 transitions. [2018-11-10 09:50:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-10 09:50:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 09:50:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-10 09:50:22,740 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-10 09:50:22,740 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-10 09:50:22,740 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-10 09:50:22,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 78 transitions. [2018-11-10 09:50:22,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:22,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:22,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:22,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [25, 24, 23, 1, 1, 1] [2018-11-10 09:50:22,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:22,741 INFO L793 eck$LassoCheckResult]: Stem: 5696#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5692#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 5693#L10-2 assume true; 5697#L9-1 assume !!(main_~i~0 < 100); 5699#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5767#L10-2 assume true; 5700#L9-1 assume !!(main_~i~0 < 100); 5694#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5695#L10-2 assume true; 5698#L9-1 assume !!(main_~i~0 < 100); 5766#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5765#L10-2 assume true; 5764#L9-1 assume !!(main_~i~0 < 100); 5763#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5762#L10-2 assume true; 5761#L9-1 assume !!(main_~i~0 < 100); 5760#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5759#L10-2 assume true; 5758#L9-1 assume !!(main_~i~0 < 100); 5757#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5756#L10-2 assume true; 5755#L9-1 assume !!(main_~i~0 < 100); 5754#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5753#L10-2 assume true; 5752#L9-1 assume !!(main_~i~0 < 100); 5751#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5750#L10-2 assume true; 5749#L9-1 assume !!(main_~i~0 < 100); 5748#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5747#L10-2 assume true; 5746#L9-1 assume !!(main_~i~0 < 100); 5745#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5744#L10-2 assume true; 5743#L9-1 assume !!(main_~i~0 < 100); 5742#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5741#L10-2 assume true; 5740#L9-1 assume !!(main_~i~0 < 100); 5739#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5738#L10-2 assume true; 5737#L9-1 assume !!(main_~i~0 < 100); 5736#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5735#L10-2 assume true; 5734#L9-1 assume !!(main_~i~0 < 100); 5733#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5732#L10-2 assume true; 5731#L9-1 assume !!(main_~i~0 < 100); 5730#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5729#L10-2 assume true; 5728#L9-1 assume !!(main_~i~0 < 100); 5727#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5726#L10-2 assume true; 5725#L9-1 assume !!(main_~i~0 < 100); 5724#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5723#L10-2 assume true; 5722#L9-1 assume !!(main_~i~0 < 100); 5721#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5720#L10-2 assume true; 5719#L9-1 assume !!(main_~i~0 < 100); 5718#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5717#L10-2 assume true; 5716#L9-1 assume !!(main_~i~0 < 100); 5715#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5714#L10-2 assume true; 5713#L9-1 assume !!(main_~i~0 < 100); 5712#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5711#L10-2 assume true; 5710#L9-1 assume !!(main_~i~0 < 100); 5709#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5708#L10-2 assume true; 5706#L9-1 assume !!(main_~i~0 < 100); 5707#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5705#L10-2 assume true; 5703#L9-1 assume !!(main_~i~0 < 100); 5704#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 5701#L10-2 assume true; 5702#L9-1 [2018-11-10 09:50:22,742 INFO L795 eck$LassoCheckResult]: Loop: 5702#L9-1 assume !!(main_~i~0 < 100); 5707#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 5705#L10-2 assume true; 5703#L9-1 assume !!(main_~i~0 < 100); 5704#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 5701#L10-2 assume true; 5702#L9-1 [2018-11-10 09:50:22,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash -331012255, now seen corresponding path program 23 times [2018-11-10 09:50:22,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:22,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 24 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:22,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:22,935 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:22,943 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:22,962 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-11-10 09:50:22,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:22,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 24 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:22,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:22,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-10 09:50:22,987 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:22,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 20 times [2018-11-10 09:50:22,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:22,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:22,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 09:50:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-10 09:50:23,006 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. cyclomatic complexity: 3 Second operand 26 states. [2018-11-10 09:50:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:23,044 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-10 09:50:23,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 09:50:23,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 85 transitions. [2018-11-10 09:50:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:23,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 81 states and 83 transitions. [2018-11-10 09:50:23,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:23,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:23,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 83 transitions. [2018-11-10 09:50:23,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:23,046 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-10 09:50:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 83 transitions. [2018-11-10 09:50:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-10 09:50:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 09:50:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-10 09:50:23,047 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-10 09:50:23,047 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-10 09:50:23,047 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-10 09:50:23,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 81 transitions. [2018-11-10 09:50:23,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:23,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:23,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:23,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [26, 25, 24, 1, 1, 1] [2018-11-10 09:50:23,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:23,049 INFO L793 eck$LassoCheckResult]: Stem: 6106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6102#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 6103#L10-2 assume true; 6107#L9-1 assume !!(main_~i~0 < 100); 6109#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6180#L10-2 assume true; 6110#L9-1 assume !!(main_~i~0 < 100); 6104#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6105#L10-2 assume true; 6108#L9-1 assume !!(main_~i~0 < 100); 6179#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6178#L10-2 assume true; 6177#L9-1 assume !!(main_~i~0 < 100); 6176#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6175#L10-2 assume true; 6174#L9-1 assume !!(main_~i~0 < 100); 6173#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6172#L10-2 assume true; 6171#L9-1 assume !!(main_~i~0 < 100); 6170#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6169#L10-2 assume true; 6168#L9-1 assume !!(main_~i~0 < 100); 6167#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6166#L10-2 assume true; 6165#L9-1 assume !!(main_~i~0 < 100); 6164#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6163#L10-2 assume true; 6162#L9-1 assume !!(main_~i~0 < 100); 6161#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6160#L10-2 assume true; 6159#L9-1 assume !!(main_~i~0 < 100); 6158#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6157#L10-2 assume true; 6156#L9-1 assume !!(main_~i~0 < 100); 6155#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6154#L10-2 assume true; 6153#L9-1 assume !!(main_~i~0 < 100); 6152#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6151#L10-2 assume true; 6150#L9-1 assume !!(main_~i~0 < 100); 6149#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6148#L10-2 assume true; 6147#L9-1 assume !!(main_~i~0 < 100); 6146#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6145#L10-2 assume true; 6144#L9-1 assume !!(main_~i~0 < 100); 6143#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6142#L10-2 assume true; 6141#L9-1 assume !!(main_~i~0 < 100); 6140#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6139#L10-2 assume true; 6138#L9-1 assume !!(main_~i~0 < 100); 6137#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6136#L10-2 assume true; 6135#L9-1 assume !!(main_~i~0 < 100); 6134#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6133#L10-2 assume true; 6132#L9-1 assume !!(main_~i~0 < 100); 6131#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6130#L10-2 assume true; 6129#L9-1 assume !!(main_~i~0 < 100); 6128#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6127#L10-2 assume true; 6126#L9-1 assume !!(main_~i~0 < 100); 6125#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6124#L10-2 assume true; 6123#L9-1 assume !!(main_~i~0 < 100); 6122#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6121#L10-2 assume true; 6120#L9-1 assume !!(main_~i~0 < 100); 6119#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6118#L10-2 assume true; 6116#L9-1 assume !!(main_~i~0 < 100); 6117#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6115#L10-2 assume true; 6113#L9-1 assume !!(main_~i~0 < 100); 6114#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6111#L10-2 assume true; 6112#L9-1 [2018-11-10 09:50:23,049 INFO L795 eck$LassoCheckResult]: Loop: 6112#L9-1 assume !!(main_~i~0 < 100); 6117#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6115#L10-2 assume true; 6113#L9-1 assume !!(main_~i~0 < 100); 6114#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6111#L10-2 assume true; 6112#L9-1 [2018-11-10 09:50:23,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 56987934, now seen corresponding path program 24 times [2018-11-10 09:50:23,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:23,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:23,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:23,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 25 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:23,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:23,247 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:23,253 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:23,268 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-11-10 09:50:23,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:23,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 25 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:23,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:23,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-10 09:50:23,303 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:23,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 21 times [2018-11-10 09:50:23,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:23,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:23,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:23,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:23,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 09:50:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-10 09:50:23,321 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. cyclomatic complexity: 3 Second operand 27 states. [2018-11-10 09:50:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:23,364 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-10 09:50:23,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 09:50:23,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 88 transitions. [2018-11-10 09:50:23,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:23,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 86 transitions. [2018-11-10 09:50:23,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:23,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:23,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 86 transitions. [2018-11-10 09:50:23,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:23,366 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-11-10 09:50:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 86 transitions. [2018-11-10 09:50:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-10 09:50:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 09:50:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-10 09:50:23,368 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-10 09:50:23,368 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-10 09:50:23,368 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-10 09:50:23,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 84 transitions. [2018-11-10 09:50:23,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:23,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:23,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:23,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 26, 25, 1, 1, 1] [2018-11-10 09:50:23,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:23,369 INFO L793 eck$LassoCheckResult]: Stem: 6532#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 6529#L10-2 assume true; 6533#L9-1 assume !!(main_~i~0 < 100); 6535#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6609#L10-2 assume true; 6536#L9-1 assume !!(main_~i~0 < 100); 6530#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6531#L10-2 assume true; 6534#L9-1 assume !!(main_~i~0 < 100); 6608#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6607#L10-2 assume true; 6606#L9-1 assume !!(main_~i~0 < 100); 6605#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6604#L10-2 assume true; 6603#L9-1 assume !!(main_~i~0 < 100); 6602#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6601#L10-2 assume true; 6600#L9-1 assume !!(main_~i~0 < 100); 6599#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6598#L10-2 assume true; 6597#L9-1 assume !!(main_~i~0 < 100); 6596#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6595#L10-2 assume true; 6594#L9-1 assume !!(main_~i~0 < 100); 6593#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6592#L10-2 assume true; 6591#L9-1 assume !!(main_~i~0 < 100); 6590#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6589#L10-2 assume true; 6588#L9-1 assume !!(main_~i~0 < 100); 6587#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6586#L10-2 assume true; 6585#L9-1 assume !!(main_~i~0 < 100); 6584#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6583#L10-2 assume true; 6582#L9-1 assume !!(main_~i~0 < 100); 6581#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6580#L10-2 assume true; 6579#L9-1 assume !!(main_~i~0 < 100); 6578#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6577#L10-2 assume true; 6576#L9-1 assume !!(main_~i~0 < 100); 6575#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6574#L10-2 assume true; 6573#L9-1 assume !!(main_~i~0 < 100); 6572#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6571#L10-2 assume true; 6570#L9-1 assume !!(main_~i~0 < 100); 6569#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6568#L10-2 assume true; 6567#L9-1 assume !!(main_~i~0 < 100); 6566#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6565#L10-2 assume true; 6564#L9-1 assume !!(main_~i~0 < 100); 6563#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6562#L10-2 assume true; 6561#L9-1 assume !!(main_~i~0 < 100); 6560#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6559#L10-2 assume true; 6558#L9-1 assume !!(main_~i~0 < 100); 6557#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6556#L10-2 assume true; 6555#L9-1 assume !!(main_~i~0 < 100); 6554#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6553#L10-2 assume true; 6552#L9-1 assume !!(main_~i~0 < 100); 6551#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6550#L10-2 assume true; 6549#L9-1 assume !!(main_~i~0 < 100); 6548#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6547#L10-2 assume true; 6546#L9-1 assume !!(main_~i~0 < 100); 6545#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6544#L10-2 assume true; 6542#L9-1 assume !!(main_~i~0 < 100); 6543#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6541#L10-2 assume true; 6539#L9-1 assume !!(main_~i~0 < 100); 6540#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6537#L10-2 assume true; 6538#L9-1 [2018-11-10 09:50:23,369 INFO L795 eck$LassoCheckResult]: Loop: 6538#L9-1 assume !!(main_~i~0 < 100); 6543#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6541#L10-2 assume true; 6539#L9-1 assume !!(main_~i~0 < 100); 6540#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6537#L10-2 assume true; 6538#L9-1 [2018-11-10 09:50:23,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1213624897, now seen corresponding path program 25 times [2018-11-10 09:50:23,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:23,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:23,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 26 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:23,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:23,622 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:23,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:23,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 26 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:23,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:23,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-10 09:50:23,672 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:23,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 22 times [2018-11-10 09:50:23,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:23,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 09:50:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-10 09:50:23,692 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. cyclomatic complexity: 3 Second operand 28 states. [2018-11-10 09:50:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:23,733 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-11-10 09:50:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 09:50:23,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 91 transitions. [2018-11-10 09:50:23,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:23,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 87 states and 89 transitions. [2018-11-10 09:50:23,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:23,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:23,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 89 transitions. [2018-11-10 09:50:23,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:23,736 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-10 09:50:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 89 transitions. [2018-11-10 09:50:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-10 09:50:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 09:50:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-11-10 09:50:23,738 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-11-10 09:50:23,738 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-11-10 09:50:23,738 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-10 09:50:23,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 87 transitions. [2018-11-10 09:50:23,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:23,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:23,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:23,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [28, 27, 26, 1, 1, 1] [2018-11-10 09:50:23,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:23,739 INFO L793 eck$LassoCheckResult]: Stem: 6974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6970#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 6971#L10-2 assume true; 6975#L9-1 assume !!(main_~i~0 < 100); 6977#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7054#L10-2 assume true; 6978#L9-1 assume !!(main_~i~0 < 100); 6972#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6973#L10-2 assume true; 6976#L9-1 assume !!(main_~i~0 < 100); 7053#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7052#L10-2 assume true; 7051#L9-1 assume !!(main_~i~0 < 100); 7050#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7049#L10-2 assume true; 7048#L9-1 assume !!(main_~i~0 < 100); 7047#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7046#L10-2 assume true; 7045#L9-1 assume !!(main_~i~0 < 100); 7044#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7043#L10-2 assume true; 7042#L9-1 assume !!(main_~i~0 < 100); 7041#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7040#L10-2 assume true; 7039#L9-1 assume !!(main_~i~0 < 100); 7038#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7037#L10-2 assume true; 7036#L9-1 assume !!(main_~i~0 < 100); 7035#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7034#L10-2 assume true; 7033#L9-1 assume !!(main_~i~0 < 100); 7032#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7031#L10-2 assume true; 7030#L9-1 assume !!(main_~i~0 < 100); 7029#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7028#L10-2 assume true; 7027#L9-1 assume !!(main_~i~0 < 100); 7026#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7025#L10-2 assume true; 7024#L9-1 assume !!(main_~i~0 < 100); 7023#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7022#L10-2 assume true; 7021#L9-1 assume !!(main_~i~0 < 100); 7020#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7019#L10-2 assume true; 7018#L9-1 assume !!(main_~i~0 < 100); 7017#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7016#L10-2 assume true; 7015#L9-1 assume !!(main_~i~0 < 100); 7014#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7013#L10-2 assume true; 7012#L9-1 assume !!(main_~i~0 < 100); 7011#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7010#L10-2 assume true; 7009#L9-1 assume !!(main_~i~0 < 100); 7008#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7007#L10-2 assume true; 7006#L9-1 assume !!(main_~i~0 < 100); 7005#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7004#L10-2 assume true; 7003#L9-1 assume !!(main_~i~0 < 100); 7002#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7001#L10-2 assume true; 7000#L9-1 assume !!(main_~i~0 < 100); 6999#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6998#L10-2 assume true; 6997#L9-1 assume !!(main_~i~0 < 100); 6996#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6995#L10-2 assume true; 6994#L9-1 assume !!(main_~i~0 < 100); 6993#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6992#L10-2 assume true; 6991#L9-1 assume !!(main_~i~0 < 100); 6990#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6989#L10-2 assume true; 6988#L9-1 assume !!(main_~i~0 < 100); 6987#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6986#L10-2 assume true; 6984#L9-1 assume !!(main_~i~0 < 100); 6985#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6983#L10-2 assume true; 6981#L9-1 assume !!(main_~i~0 < 100); 6982#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6979#L10-2 assume true; 6980#L9-1 [2018-11-10 09:50:23,739 INFO L795 eck$LassoCheckResult]: Loop: 6980#L9-1 assume !!(main_~i~0 < 100); 6985#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 6983#L10-2 assume true; 6981#L9-1 assume !!(main_~i~0 < 100); 6982#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6979#L10-2 assume true; 6980#L9-1 [2018-11-10 09:50:23,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 62773822, now seen corresponding path program 26 times [2018-11-10 09:50:23,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:23,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 27 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:23,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:23,965 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:23,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:23,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:23,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:23,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 27 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:24,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:24,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-10 09:50:24,008 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:24,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 23 times [2018-11-10 09:50:24,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:24,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 09:50:24,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-10 09:50:24,026 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. cyclomatic complexity: 3 Second operand 29 states. [2018-11-10 09:50:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:24,065 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-10 09:50:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 09:50:24,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 94 transitions. [2018-11-10 09:50:24,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:24,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 90 states and 92 transitions. [2018-11-10 09:50:24,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:24,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:24,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 92 transitions. [2018-11-10 09:50:24,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:24,067 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-11-10 09:50:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 92 transitions. [2018-11-10 09:50:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-10 09:50:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 09:50:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-11-10 09:50:24,068 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-10 09:50:24,068 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-10 09:50:24,069 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-10 09:50:24,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 90 transitions. [2018-11-10 09:50:24,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:24,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:24,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:24,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [29, 28, 27, 1, 1, 1] [2018-11-10 09:50:24,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:24,070 INFO L793 eck$LassoCheckResult]: Stem: 7432#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7429#L10-2 assume true; 7433#L9-1 assume !!(main_~i~0 < 100); 7430#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7431#L10-2 assume true; 7434#L9-1 assume !!(main_~i~0 < 100); 7435#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7515#L10-2 assume true; 7514#L9-1 assume !!(main_~i~0 < 100); 7513#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7512#L10-2 assume true; 7511#L9-1 assume !!(main_~i~0 < 100); 7510#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7509#L10-2 assume true; 7508#L9-1 assume !!(main_~i~0 < 100); 7507#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7506#L10-2 assume true; 7505#L9-1 assume !!(main_~i~0 < 100); 7504#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7503#L10-2 assume true; 7502#L9-1 assume !!(main_~i~0 < 100); 7501#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7500#L10-2 assume true; 7499#L9-1 assume !!(main_~i~0 < 100); 7498#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7497#L10-2 assume true; 7496#L9-1 assume !!(main_~i~0 < 100); 7495#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7494#L10-2 assume true; 7493#L9-1 assume !!(main_~i~0 < 100); 7492#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7491#L10-2 assume true; 7490#L9-1 assume !!(main_~i~0 < 100); 7489#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7488#L10-2 assume true; 7487#L9-1 assume !!(main_~i~0 < 100); 7486#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7485#L10-2 assume true; 7484#L9-1 assume !!(main_~i~0 < 100); 7483#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7482#L10-2 assume true; 7481#L9-1 assume !!(main_~i~0 < 100); 7480#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7479#L10-2 assume true; 7478#L9-1 assume !!(main_~i~0 < 100); 7477#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7476#L10-2 assume true; 7475#L9-1 assume !!(main_~i~0 < 100); 7474#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7473#L10-2 assume true; 7472#L9-1 assume !!(main_~i~0 < 100); 7471#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7470#L10-2 assume true; 7469#L9-1 assume !!(main_~i~0 < 100); 7468#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7467#L10-2 assume true; 7466#L9-1 assume !!(main_~i~0 < 100); 7465#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7464#L10-2 assume true; 7463#L9-1 assume !!(main_~i~0 < 100); 7462#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7461#L10-2 assume true; 7460#L9-1 assume !!(main_~i~0 < 100); 7459#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7458#L10-2 assume true; 7457#L9-1 assume !!(main_~i~0 < 100); 7456#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7455#L10-2 assume true; 7454#L9-1 assume !!(main_~i~0 < 100); 7453#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7452#L10-2 assume true; 7451#L9-1 assume !!(main_~i~0 < 100); 7450#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7449#L10-2 assume true; 7448#L9-1 assume !!(main_~i~0 < 100); 7447#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7446#L10-2 assume true; 7445#L9-1 assume !!(main_~i~0 < 100); 7444#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7443#L10-2 assume true; 7441#L9-1 assume !!(main_~i~0 < 100); 7442#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7440#L10-2 assume true; 7438#L9-1 assume !!(main_~i~0 < 100); 7439#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 7436#L10-2 assume true; 7437#L9-1 [2018-11-10 09:50:24,070 INFO L795 eck$LassoCheckResult]: Loop: 7437#L9-1 assume !!(main_~i~0 < 100); 7442#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7440#L10-2 assume true; 7438#L9-1 assume !!(main_~i~0 < 100); 7439#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 7436#L10-2 assume true; 7437#L9-1 [2018-11-10 09:50:24,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1782322465, now seen corresponding path program 27 times [2018-11-10 09:50:24,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:24,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 28 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:24,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:24,315 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:24,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:24,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-10 09:50:24,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:24,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 28 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:24,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:24,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-10 09:50:24,375 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:24,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 24 times [2018-11-10 09:50:24,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:24,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:24,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 09:50:24,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-10 09:50:24,406 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. cyclomatic complexity: 3 Second operand 30 states. [2018-11-10 09:50:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:24,455 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-10 09:50:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 09:50:24,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 97 transitions. [2018-11-10 09:50:24,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:24,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 93 states and 95 transitions. [2018-11-10 09:50:24,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:24,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:24,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 95 transitions. [2018-11-10 09:50:24,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:24,458 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-11-10 09:50:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 95 transitions. [2018-11-10 09:50:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-10 09:50:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 09:50:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-11-10 09:50:24,460 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-10 09:50:24,460 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-10 09:50:24,460 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-10 09:50:24,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 93 transitions. [2018-11-10 09:50:24,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:24,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:24,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:24,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [30, 29, 28, 1, 1, 1] [2018-11-10 09:50:24,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:24,461 INFO L793 eck$LassoCheckResult]: Stem: 7906#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7902#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7903#L10-2 assume true; 7907#L9-1 assume !!(main_~i~0 < 100); 7909#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7992#L10-2 assume true; 7910#L9-1 assume !!(main_~i~0 < 100); 7904#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7905#L10-2 assume true; 7908#L9-1 assume !!(main_~i~0 < 100); 7991#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7990#L10-2 assume true; 7989#L9-1 assume !!(main_~i~0 < 100); 7988#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7987#L10-2 assume true; 7986#L9-1 assume !!(main_~i~0 < 100); 7985#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7984#L10-2 assume true; 7983#L9-1 assume !!(main_~i~0 < 100); 7982#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7981#L10-2 assume true; 7980#L9-1 assume !!(main_~i~0 < 100); 7979#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7978#L10-2 assume true; 7977#L9-1 assume !!(main_~i~0 < 100); 7976#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7975#L10-2 assume true; 7974#L9-1 assume !!(main_~i~0 < 100); 7973#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7972#L10-2 assume true; 7971#L9-1 assume !!(main_~i~0 < 100); 7970#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7969#L10-2 assume true; 7968#L9-1 assume !!(main_~i~0 < 100); 7967#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7966#L10-2 assume true; 7965#L9-1 assume !!(main_~i~0 < 100); 7964#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7963#L10-2 assume true; 7962#L9-1 assume !!(main_~i~0 < 100); 7961#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7960#L10-2 assume true; 7959#L9-1 assume !!(main_~i~0 < 100); 7958#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7957#L10-2 assume true; 7956#L9-1 assume !!(main_~i~0 < 100); 7955#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7954#L10-2 assume true; 7953#L9-1 assume !!(main_~i~0 < 100); 7952#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7951#L10-2 assume true; 7950#L9-1 assume !!(main_~i~0 < 100); 7949#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7948#L10-2 assume true; 7947#L9-1 assume !!(main_~i~0 < 100); 7946#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7945#L10-2 assume true; 7944#L9-1 assume !!(main_~i~0 < 100); 7943#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7942#L10-2 assume true; 7941#L9-1 assume !!(main_~i~0 < 100); 7940#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7939#L10-2 assume true; 7938#L9-1 assume !!(main_~i~0 < 100); 7937#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7936#L10-2 assume true; 7935#L9-1 assume !!(main_~i~0 < 100); 7934#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7933#L10-2 assume true; 7932#L9-1 assume !!(main_~i~0 < 100); 7931#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7930#L10-2 assume true; 7929#L9-1 assume !!(main_~i~0 < 100); 7928#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7927#L10-2 assume true; 7926#L9-1 assume !!(main_~i~0 < 100); 7925#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7924#L10-2 assume true; 7923#L9-1 assume !!(main_~i~0 < 100); 7922#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7921#L10-2 assume true; 7920#L9-1 assume !!(main_~i~0 < 100); 7919#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7918#L10-2 assume true; 7916#L9-1 assume !!(main_~i~0 < 100); 7917#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7915#L10-2 assume true; 7913#L9-1 assume !!(main_~i~0 < 100); 7914#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 7911#L10-2 assume true; 7912#L9-1 [2018-11-10 09:50:24,461 INFO L795 eck$LassoCheckResult]: Loop: 7912#L9-1 assume !!(main_~i~0 < 100); 7917#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 7915#L10-2 assume true; 7913#L9-1 assume !!(main_~i~0 < 100); 7914#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 7911#L10-2 assume true; 7912#L9-1 [2018-11-10 09:50:24,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1513960610, now seen corresponding path program 28 times [2018-11-10 09:50:24,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:24,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 29 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:24,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:24,707 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:24,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:24,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:24,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:24,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 29 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:24,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:24,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-10 09:50:24,746 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:24,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 25 times [2018-11-10 09:50:24,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:24,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 09:50:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-10 09:50:24,761 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. cyclomatic complexity: 3 Second operand 31 states. [2018-11-10 09:50:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:24,802 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-10 09:50:24,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 09:50:24,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 100 transitions. [2018-11-10 09:50:24,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:24,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 96 states and 98 transitions. [2018-11-10 09:50:24,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:24,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:24,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 98 transitions. [2018-11-10 09:50:24,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:24,804 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-11-10 09:50:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 98 transitions. [2018-11-10 09:50:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-10 09:50:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 09:50:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-10 09:50:24,805 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-10 09:50:24,806 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-10 09:50:24,806 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-10 09:50:24,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 96 transitions. [2018-11-10 09:50:24,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:24,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:24,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:24,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [31, 30, 29, 1, 1, 1] [2018-11-10 09:50:24,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:24,807 INFO L793 eck$LassoCheckResult]: Stem: 8396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8392#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 8393#L10-2 assume true; 8397#L9-1 assume !!(main_~i~0 < 100); 8399#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8485#L10-2 assume true; 8400#L9-1 assume !!(main_~i~0 < 100); 8394#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8395#L10-2 assume true; 8398#L9-1 assume !!(main_~i~0 < 100); 8484#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8483#L10-2 assume true; 8482#L9-1 assume !!(main_~i~0 < 100); 8481#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8480#L10-2 assume true; 8479#L9-1 assume !!(main_~i~0 < 100); 8478#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8477#L10-2 assume true; 8476#L9-1 assume !!(main_~i~0 < 100); 8475#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8474#L10-2 assume true; 8473#L9-1 assume !!(main_~i~0 < 100); 8472#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8471#L10-2 assume true; 8470#L9-1 assume !!(main_~i~0 < 100); 8469#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8468#L10-2 assume true; 8467#L9-1 assume !!(main_~i~0 < 100); 8466#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8465#L10-2 assume true; 8464#L9-1 assume !!(main_~i~0 < 100); 8463#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8462#L10-2 assume true; 8461#L9-1 assume !!(main_~i~0 < 100); 8460#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8459#L10-2 assume true; 8458#L9-1 assume !!(main_~i~0 < 100); 8457#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8456#L10-2 assume true; 8455#L9-1 assume !!(main_~i~0 < 100); 8454#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8453#L10-2 assume true; 8452#L9-1 assume !!(main_~i~0 < 100); 8451#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8450#L10-2 assume true; 8449#L9-1 assume !!(main_~i~0 < 100); 8448#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8447#L10-2 assume true; 8446#L9-1 assume !!(main_~i~0 < 100); 8445#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8444#L10-2 assume true; 8443#L9-1 assume !!(main_~i~0 < 100); 8442#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8441#L10-2 assume true; 8440#L9-1 assume !!(main_~i~0 < 100); 8439#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8438#L10-2 assume true; 8437#L9-1 assume !!(main_~i~0 < 100); 8436#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8435#L10-2 assume true; 8434#L9-1 assume !!(main_~i~0 < 100); 8433#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8432#L10-2 assume true; 8431#L9-1 assume !!(main_~i~0 < 100); 8430#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8429#L10-2 assume true; 8428#L9-1 assume !!(main_~i~0 < 100); 8427#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8426#L10-2 assume true; 8425#L9-1 assume !!(main_~i~0 < 100); 8424#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8423#L10-2 assume true; 8422#L9-1 assume !!(main_~i~0 < 100); 8421#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8420#L10-2 assume true; 8419#L9-1 assume !!(main_~i~0 < 100); 8418#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8417#L10-2 assume true; 8416#L9-1 assume !!(main_~i~0 < 100); 8415#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8414#L10-2 assume true; 8413#L9-1 assume !!(main_~i~0 < 100); 8412#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8411#L10-2 assume true; 8410#L9-1 assume !!(main_~i~0 < 100); 8409#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8408#L10-2 assume true; 8406#L9-1 assume !!(main_~i~0 < 100); 8407#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8405#L10-2 assume true; 8403#L9-1 assume !!(main_~i~0 < 100); 8404#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 8401#L10-2 assume true; 8402#L9-1 [2018-11-10 09:50:24,807 INFO L795 eck$LassoCheckResult]: Loop: 8402#L9-1 assume !!(main_~i~0 < 100); 8407#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8405#L10-2 assume true; 8403#L9-1 assume !!(main_~i~0 < 100); 8404#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 8401#L10-2 assume true; 8402#L9-1 [2018-11-10 09:50:24,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:24,807 INFO L82 PathProgramCache]: Analyzing trace with hash -950792191, now seen corresponding path program 29 times [2018-11-10 09:50:24,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:24,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:24,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 30 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:25,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:25,125 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:25,132 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:25,156 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-11-10 09:50:25,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:25,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 30 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:25,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:25,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-10 09:50:25,182 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:25,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 26 times [2018-11-10 09:50:25,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:25,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 09:50:25,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-10 09:50:25,197 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. cyclomatic complexity: 3 Second operand 32 states. [2018-11-10 09:50:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:25,244 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-10 09:50:25,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 09:50:25,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 103 transitions. [2018-11-10 09:50:25,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:25,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 99 states and 101 transitions. [2018-11-10 09:50:25,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:25,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:25,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2018-11-10 09:50:25,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:25,245 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-10 09:50:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2018-11-10 09:50:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-10 09:50:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 09:50:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-11-10 09:50:25,246 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-11-10 09:50:25,246 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-11-10 09:50:25,246 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-10 09:50:25,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 99 transitions. [2018-11-10 09:50:25,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:25,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:25,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:25,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 30, 1, 1, 1] [2018-11-10 09:50:25,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:25,247 INFO L793 eck$LassoCheckResult]: Stem: 8902#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8898#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 8899#L10-2 assume true; 8903#L9-1 assume !!(main_~i~0 < 100); 8900#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8901#L10-2 assume true; 8904#L9-1 assume !!(main_~i~0 < 100); 8905#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8994#L10-2 assume true; 8993#L9-1 assume !!(main_~i~0 < 100); 8992#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8991#L10-2 assume true; 8990#L9-1 assume !!(main_~i~0 < 100); 8989#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8988#L10-2 assume true; 8987#L9-1 assume !!(main_~i~0 < 100); 8986#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8985#L10-2 assume true; 8984#L9-1 assume !!(main_~i~0 < 100); 8983#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8982#L10-2 assume true; 8981#L9-1 assume !!(main_~i~0 < 100); 8980#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8979#L10-2 assume true; 8978#L9-1 assume !!(main_~i~0 < 100); 8977#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8976#L10-2 assume true; 8975#L9-1 assume !!(main_~i~0 < 100); 8974#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8973#L10-2 assume true; 8972#L9-1 assume !!(main_~i~0 < 100); 8971#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8970#L10-2 assume true; 8969#L9-1 assume !!(main_~i~0 < 100); 8968#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8967#L10-2 assume true; 8966#L9-1 assume !!(main_~i~0 < 100); 8965#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8964#L10-2 assume true; 8963#L9-1 assume !!(main_~i~0 < 100); 8962#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8961#L10-2 assume true; 8960#L9-1 assume !!(main_~i~0 < 100); 8959#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8958#L10-2 assume true; 8957#L9-1 assume !!(main_~i~0 < 100); 8956#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8955#L10-2 assume true; 8954#L9-1 assume !!(main_~i~0 < 100); 8953#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8952#L10-2 assume true; 8951#L9-1 assume !!(main_~i~0 < 100); 8950#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8949#L10-2 assume true; 8948#L9-1 assume !!(main_~i~0 < 100); 8947#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8946#L10-2 assume true; 8945#L9-1 assume !!(main_~i~0 < 100); 8944#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8943#L10-2 assume true; 8942#L9-1 assume !!(main_~i~0 < 100); 8941#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8940#L10-2 assume true; 8939#L9-1 assume !!(main_~i~0 < 100); 8938#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8937#L10-2 assume true; 8936#L9-1 assume !!(main_~i~0 < 100); 8935#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8934#L10-2 assume true; 8933#L9-1 assume !!(main_~i~0 < 100); 8932#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8931#L10-2 assume true; 8930#L9-1 assume !!(main_~i~0 < 100); 8929#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8928#L10-2 assume true; 8927#L9-1 assume !!(main_~i~0 < 100); 8926#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8925#L10-2 assume true; 8924#L9-1 assume !!(main_~i~0 < 100); 8923#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8922#L10-2 assume true; 8921#L9-1 assume !!(main_~i~0 < 100); 8920#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8919#L10-2 assume true; 8918#L9-1 assume !!(main_~i~0 < 100); 8917#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8916#L10-2 assume true; 8915#L9-1 assume !!(main_~i~0 < 100); 8914#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8913#L10-2 assume true; 8911#L9-1 assume !!(main_~i~0 < 100); 8912#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8910#L10-2 assume true; 8908#L9-1 assume !!(main_~i~0 < 100); 8909#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 8906#L10-2 assume true; 8907#L9-1 [2018-11-10 09:50:25,247 INFO L795 eck$LassoCheckResult]: Loop: 8907#L9-1 assume !!(main_~i~0 < 100); 8912#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 8910#L10-2 assume true; 8908#L9-1 assume !!(main_~i~0 < 100); 8909#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 8906#L10-2 assume true; 8907#L9-1 [2018-11-10 09:50:25,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:25,248 INFO L82 PathProgramCache]: Analyzing trace with hash 257320062, now seen corresponding path program 30 times [2018-11-10 09:50:25,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:25,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 31 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:25,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:25,505 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:25,510 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:25,529 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-11-10 09:50:25,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:25,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 31 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:25,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:25,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-10 09:50:25,560 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:25,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 27 times [2018-11-10 09:50:25,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:25,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 09:50:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 09:50:25,577 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. cyclomatic complexity: 3 Second operand 33 states. [2018-11-10 09:50:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:25,631 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-11-10 09:50:25,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 09:50:25,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 106 transitions. [2018-11-10 09:50:25,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:25,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 102 states and 104 transitions. [2018-11-10 09:50:25,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:25,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:25,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 104 transitions. [2018-11-10 09:50:25,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:25,632 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-11-10 09:50:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 104 transitions. [2018-11-10 09:50:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-10 09:50:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 09:50:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-11-10 09:50:25,633 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-11-10 09:50:25,633 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-11-10 09:50:25,633 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-10 09:50:25,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 102 transitions. [2018-11-10 09:50:25,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:25,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:25,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:25,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [33, 32, 31, 1, 1, 1] [2018-11-10 09:50:25,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:25,634 INFO L793 eck$LassoCheckResult]: Stem: 9424#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 9421#L10-2 assume true; 9425#L9-1 assume !!(main_~i~0 < 100); 9427#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9519#L10-2 assume true; 9428#L9-1 assume !!(main_~i~0 < 100); 9422#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9423#L10-2 assume true; 9426#L9-1 assume !!(main_~i~0 < 100); 9518#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9517#L10-2 assume true; 9516#L9-1 assume !!(main_~i~0 < 100); 9515#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9514#L10-2 assume true; 9513#L9-1 assume !!(main_~i~0 < 100); 9512#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9511#L10-2 assume true; 9510#L9-1 assume !!(main_~i~0 < 100); 9509#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9508#L10-2 assume true; 9507#L9-1 assume !!(main_~i~0 < 100); 9506#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9505#L10-2 assume true; 9504#L9-1 assume !!(main_~i~0 < 100); 9503#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9502#L10-2 assume true; 9501#L9-1 assume !!(main_~i~0 < 100); 9500#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9499#L10-2 assume true; 9498#L9-1 assume !!(main_~i~0 < 100); 9497#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9496#L10-2 assume true; 9495#L9-1 assume !!(main_~i~0 < 100); 9494#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9493#L10-2 assume true; 9492#L9-1 assume !!(main_~i~0 < 100); 9491#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9490#L10-2 assume true; 9489#L9-1 assume !!(main_~i~0 < 100); 9488#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9487#L10-2 assume true; 9486#L9-1 assume !!(main_~i~0 < 100); 9485#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9484#L10-2 assume true; 9483#L9-1 assume !!(main_~i~0 < 100); 9482#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9481#L10-2 assume true; 9480#L9-1 assume !!(main_~i~0 < 100); 9479#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9478#L10-2 assume true; 9477#L9-1 assume !!(main_~i~0 < 100); 9476#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9475#L10-2 assume true; 9474#L9-1 assume !!(main_~i~0 < 100); 9473#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9472#L10-2 assume true; 9471#L9-1 assume !!(main_~i~0 < 100); 9470#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9469#L10-2 assume true; 9468#L9-1 assume !!(main_~i~0 < 100); 9467#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9466#L10-2 assume true; 9465#L9-1 assume !!(main_~i~0 < 100); 9464#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9463#L10-2 assume true; 9462#L9-1 assume !!(main_~i~0 < 100); 9461#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9460#L10-2 assume true; 9459#L9-1 assume !!(main_~i~0 < 100); 9458#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9457#L10-2 assume true; 9456#L9-1 assume !!(main_~i~0 < 100); 9455#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9454#L10-2 assume true; 9453#L9-1 assume !!(main_~i~0 < 100); 9452#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9451#L10-2 assume true; 9450#L9-1 assume !!(main_~i~0 < 100); 9449#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9448#L10-2 assume true; 9447#L9-1 assume !!(main_~i~0 < 100); 9446#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9445#L10-2 assume true; 9444#L9-1 assume !!(main_~i~0 < 100); 9443#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9442#L10-2 assume true; 9441#L9-1 assume !!(main_~i~0 < 100); 9440#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9439#L10-2 assume true; 9438#L9-1 assume !!(main_~i~0 < 100); 9437#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9436#L10-2 assume true; 9434#L9-1 assume !!(main_~i~0 < 100); 9435#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9433#L10-2 assume true; 9431#L9-1 assume !!(main_~i~0 < 100); 9432#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 9429#L10-2 assume true; 9430#L9-1 [2018-11-10 09:50:25,634 INFO L795 eck$LassoCheckResult]: Loop: 9430#L9-1 assume !!(main_~i~0 < 100); 9435#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9433#L10-2 assume true; 9431#L9-1 assume !!(main_~i~0 < 100); 9432#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 9429#L10-2 assume true; 9430#L9-1 [2018-11-10 09:50:25,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash -696491295, now seen corresponding path program 31 times [2018-11-10 09:50:25,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:25,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 32 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:25,936 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:25,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:25,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 32 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:25,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:25,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-10 09:50:25,979 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:25,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 28 times [2018-11-10 09:50:25,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:25,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:26,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 09:50:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 09:50:26,000 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. cyclomatic complexity: 3 Second operand 34 states. [2018-11-10 09:50:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:26,051 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-10 09:50:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 09:50:26,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 109 transitions. [2018-11-10 09:50:26,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:26,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 105 states and 107 transitions. [2018-11-10 09:50:26,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:26,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:26,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2018-11-10 09:50:26,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:26,052 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-11-10 09:50:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2018-11-10 09:50:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-10 09:50:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 09:50:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-11-10 09:50:26,053 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-10 09:50:26,053 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-10 09:50:26,053 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-10 09:50:26,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 105 transitions. [2018-11-10 09:50:26,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:26,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:26,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:26,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [34, 33, 32, 1, 1, 1] [2018-11-10 09:50:26,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:26,054 INFO L793 eck$LassoCheckResult]: Stem: 9962#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 9959#L10-2 assume true; 9963#L9-1 assume !!(main_~i~0 < 100); 9965#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10060#L10-2 assume true; 9966#L9-1 assume !!(main_~i~0 < 100); 9960#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9961#L10-2 assume true; 9964#L9-1 assume !!(main_~i~0 < 100); 10059#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10058#L10-2 assume true; 10057#L9-1 assume !!(main_~i~0 < 100); 10056#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10055#L10-2 assume true; 10054#L9-1 assume !!(main_~i~0 < 100); 10053#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10052#L10-2 assume true; 10051#L9-1 assume !!(main_~i~0 < 100); 10050#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10049#L10-2 assume true; 10048#L9-1 assume !!(main_~i~0 < 100); 10047#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10046#L10-2 assume true; 10045#L9-1 assume !!(main_~i~0 < 100); 10044#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10043#L10-2 assume true; 10042#L9-1 assume !!(main_~i~0 < 100); 10041#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10040#L10-2 assume true; 10039#L9-1 assume !!(main_~i~0 < 100); 10038#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10037#L10-2 assume true; 10036#L9-1 assume !!(main_~i~0 < 100); 10035#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10034#L10-2 assume true; 10033#L9-1 assume !!(main_~i~0 < 100); 10032#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10031#L10-2 assume true; 10030#L9-1 assume !!(main_~i~0 < 100); 10029#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10028#L10-2 assume true; 10027#L9-1 assume !!(main_~i~0 < 100); 10026#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10025#L10-2 assume true; 10024#L9-1 assume !!(main_~i~0 < 100); 10023#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10022#L10-2 assume true; 10021#L9-1 assume !!(main_~i~0 < 100); 10020#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10019#L10-2 assume true; 10018#L9-1 assume !!(main_~i~0 < 100); 10017#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10016#L10-2 assume true; 10015#L9-1 assume !!(main_~i~0 < 100); 10014#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10013#L10-2 assume true; 10012#L9-1 assume !!(main_~i~0 < 100); 10011#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10010#L10-2 assume true; 10009#L9-1 assume !!(main_~i~0 < 100); 10008#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10007#L10-2 assume true; 10006#L9-1 assume !!(main_~i~0 < 100); 10005#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10004#L10-2 assume true; 10003#L9-1 assume !!(main_~i~0 < 100); 10002#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10001#L10-2 assume true; 10000#L9-1 assume !!(main_~i~0 < 100); 9999#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9998#L10-2 assume true; 9997#L9-1 assume !!(main_~i~0 < 100); 9996#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9995#L10-2 assume true; 9994#L9-1 assume !!(main_~i~0 < 100); 9993#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9992#L10-2 assume true; 9991#L9-1 assume !!(main_~i~0 < 100); 9990#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9989#L10-2 assume true; 9988#L9-1 assume !!(main_~i~0 < 100); 9987#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9986#L10-2 assume true; 9985#L9-1 assume !!(main_~i~0 < 100); 9984#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9983#L10-2 assume true; 9982#L9-1 assume !!(main_~i~0 < 100); 9981#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9980#L10-2 assume true; 9979#L9-1 assume !!(main_~i~0 < 100); 9978#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9977#L10-2 assume true; 9976#L9-1 assume !!(main_~i~0 < 100); 9975#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9974#L10-2 assume true; 9972#L9-1 assume !!(main_~i~0 < 100); 9973#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9971#L10-2 assume true; 9969#L9-1 assume !!(main_~i~0 < 100); 9970#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 9967#L10-2 assume true; 9968#L9-1 [2018-11-10 09:50:26,054 INFO L795 eck$LassoCheckResult]: Loop: 9968#L9-1 assume !!(main_~i~0 < 100); 9973#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 9971#L10-2 assume true; 9969#L9-1 assume !!(main_~i~0 < 100); 9970#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 9967#L10-2 assume true; 9968#L9-1 [2018-11-10 09:50:26,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash -186997346, now seen corresponding path program 32 times [2018-11-10 09:50:26,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:26,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 33 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:26,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:26,348 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:26,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:26,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:26,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:26,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 33 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:26,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:26,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-10 09:50:26,403 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:26,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 29 times [2018-11-10 09:50:26,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:26,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 09:50:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 09:50:26,424 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. cyclomatic complexity: 3 Second operand 35 states. [2018-11-10 09:50:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:26,475 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-11-10 09:50:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 09:50:26,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 112 transitions. [2018-11-10 09:50:26,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:26,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 108 states and 110 transitions. [2018-11-10 09:50:26,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:26,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:26,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 110 transitions. [2018-11-10 09:50:26,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:26,476 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-11-10 09:50:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 110 transitions. [2018-11-10 09:50:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-10 09:50:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 09:50:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-11-10 09:50:26,478 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-11-10 09:50:26,478 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-11-10 09:50:26,478 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-11-10 09:50:26,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2018-11-10 09:50:26,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:26,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:26,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:26,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [35, 34, 33, 1, 1, 1] [2018-11-10 09:50:26,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:26,479 INFO L793 eck$LassoCheckResult]: Stem: 10516#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 10513#L10-2 assume true; 10517#L9-1 assume !!(main_~i~0 < 100); 10519#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10617#L10-2 assume true; 10520#L9-1 assume !!(main_~i~0 < 100); 10514#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10515#L10-2 assume true; 10518#L9-1 assume !!(main_~i~0 < 100); 10616#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10615#L10-2 assume true; 10614#L9-1 assume !!(main_~i~0 < 100); 10613#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10612#L10-2 assume true; 10611#L9-1 assume !!(main_~i~0 < 100); 10610#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10609#L10-2 assume true; 10608#L9-1 assume !!(main_~i~0 < 100); 10607#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10606#L10-2 assume true; 10605#L9-1 assume !!(main_~i~0 < 100); 10604#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10603#L10-2 assume true; 10602#L9-1 assume !!(main_~i~0 < 100); 10601#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10600#L10-2 assume true; 10599#L9-1 assume !!(main_~i~0 < 100); 10598#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10597#L10-2 assume true; 10596#L9-1 assume !!(main_~i~0 < 100); 10595#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10594#L10-2 assume true; 10593#L9-1 assume !!(main_~i~0 < 100); 10592#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10591#L10-2 assume true; 10590#L9-1 assume !!(main_~i~0 < 100); 10589#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10588#L10-2 assume true; 10587#L9-1 assume !!(main_~i~0 < 100); 10586#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10585#L10-2 assume true; 10584#L9-1 assume !!(main_~i~0 < 100); 10583#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10582#L10-2 assume true; 10581#L9-1 assume !!(main_~i~0 < 100); 10580#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10579#L10-2 assume true; 10578#L9-1 assume !!(main_~i~0 < 100); 10577#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10576#L10-2 assume true; 10575#L9-1 assume !!(main_~i~0 < 100); 10574#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10573#L10-2 assume true; 10572#L9-1 assume !!(main_~i~0 < 100); 10571#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10570#L10-2 assume true; 10569#L9-1 assume !!(main_~i~0 < 100); 10568#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10567#L10-2 assume true; 10566#L9-1 assume !!(main_~i~0 < 100); 10565#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10564#L10-2 assume true; 10563#L9-1 assume !!(main_~i~0 < 100); 10562#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10561#L10-2 assume true; 10560#L9-1 assume !!(main_~i~0 < 100); 10559#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10558#L10-2 assume true; 10557#L9-1 assume !!(main_~i~0 < 100); 10556#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10555#L10-2 assume true; 10554#L9-1 assume !!(main_~i~0 < 100); 10553#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10552#L10-2 assume true; 10551#L9-1 assume !!(main_~i~0 < 100); 10550#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10549#L10-2 assume true; 10548#L9-1 assume !!(main_~i~0 < 100); 10547#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10546#L10-2 assume true; 10545#L9-1 assume !!(main_~i~0 < 100); 10544#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10543#L10-2 assume true; 10542#L9-1 assume !!(main_~i~0 < 100); 10541#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10540#L10-2 assume true; 10539#L9-1 assume !!(main_~i~0 < 100); 10538#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10537#L10-2 assume true; 10536#L9-1 assume !!(main_~i~0 < 100); 10535#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10534#L10-2 assume true; 10533#L9-1 assume !!(main_~i~0 < 100); 10532#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10531#L10-2 assume true; 10530#L9-1 assume !!(main_~i~0 < 100); 10529#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10528#L10-2 assume true; 10526#L9-1 assume !!(main_~i~0 < 100); 10527#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10525#L10-2 assume true; 10523#L9-1 assume !!(main_~i~0 < 100); 10524#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 10521#L10-2 assume true; 10522#L9-1 [2018-11-10 09:50:26,479 INFO L795 eck$LassoCheckResult]: Loop: 10522#L9-1 assume !!(main_~i~0 < 100); 10527#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 10525#L10-2 assume true; 10523#L9-1 assume !!(main_~i~0 < 100); 10524#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 10521#L10-2 assume true; 10522#L9-1 [2018-11-10 09:50:26,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash -267186751, now seen corresponding path program 33 times [2018-11-10 09:50:26,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:26,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:26,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 34 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:26,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:26,835 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:26,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:26,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-10 09:50:26,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:26,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 34 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:26,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:26,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-10 09:50:26,889 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:26,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:26,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 30 times [2018-11-10 09:50:26,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:26,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 09:50:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 09:50:26,905 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. cyclomatic complexity: 3 Second operand 36 states. [2018-11-10 09:50:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:26,958 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-11-10 09:50:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 09:50:26,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 115 transitions. [2018-11-10 09:50:26,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:26,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 111 states and 113 transitions. [2018-11-10 09:50:26,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:26,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:26,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 113 transitions. [2018-11-10 09:50:26,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:26,959 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-11-10 09:50:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 113 transitions. [2018-11-10 09:50:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-10 09:50:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 09:50:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-11-10 09:50:26,960 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-11-10 09:50:26,960 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-11-10 09:50:26,960 INFO L442 BuchiCegarLoop]: ======== Iteration 36============ [2018-11-10 09:50:26,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 111 transitions. [2018-11-10 09:50:26,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:26,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:26,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:26,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [36, 35, 34, 1, 1, 1] [2018-11-10 09:50:26,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:26,962 INFO L793 eck$LassoCheckResult]: Stem: 11086#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11082#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 11083#L10-2 assume true; 11087#L9-1 assume !!(main_~i~0 < 100); 11088#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11190#L10-2 assume true; 11089#L9-1 assume !!(main_~i~0 < 100); 11084#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11085#L10-2 assume true; 11090#L9-1 assume !!(main_~i~0 < 100); 11189#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11188#L10-2 assume true; 11187#L9-1 assume !!(main_~i~0 < 100); 11186#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11185#L10-2 assume true; 11184#L9-1 assume !!(main_~i~0 < 100); 11183#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11182#L10-2 assume true; 11181#L9-1 assume !!(main_~i~0 < 100); 11180#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11179#L10-2 assume true; 11178#L9-1 assume !!(main_~i~0 < 100); 11177#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11176#L10-2 assume true; 11175#L9-1 assume !!(main_~i~0 < 100); 11174#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11173#L10-2 assume true; 11172#L9-1 assume !!(main_~i~0 < 100); 11171#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11170#L10-2 assume true; 11169#L9-1 assume !!(main_~i~0 < 100); 11168#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11167#L10-2 assume true; 11166#L9-1 assume !!(main_~i~0 < 100); 11165#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11164#L10-2 assume true; 11163#L9-1 assume !!(main_~i~0 < 100); 11162#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11161#L10-2 assume true; 11160#L9-1 assume !!(main_~i~0 < 100); 11159#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11158#L10-2 assume true; 11157#L9-1 assume !!(main_~i~0 < 100); 11156#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11155#L10-2 assume true; 11154#L9-1 assume !!(main_~i~0 < 100); 11153#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11152#L10-2 assume true; 11151#L9-1 assume !!(main_~i~0 < 100); 11150#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11149#L10-2 assume true; 11148#L9-1 assume !!(main_~i~0 < 100); 11147#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11146#L10-2 assume true; 11145#L9-1 assume !!(main_~i~0 < 100); 11144#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11143#L10-2 assume true; 11142#L9-1 assume !!(main_~i~0 < 100); 11141#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11140#L10-2 assume true; 11139#L9-1 assume !!(main_~i~0 < 100); 11138#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11137#L10-2 assume true; 11136#L9-1 assume !!(main_~i~0 < 100); 11135#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11134#L10-2 assume true; 11133#L9-1 assume !!(main_~i~0 < 100); 11132#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11131#L10-2 assume true; 11130#L9-1 assume !!(main_~i~0 < 100); 11129#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11128#L10-2 assume true; 11127#L9-1 assume !!(main_~i~0 < 100); 11126#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11125#L10-2 assume true; 11124#L9-1 assume !!(main_~i~0 < 100); 11123#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11122#L10-2 assume true; 11121#L9-1 assume !!(main_~i~0 < 100); 11120#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11119#L10-2 assume true; 11118#L9-1 assume !!(main_~i~0 < 100); 11117#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11116#L10-2 assume true; 11115#L9-1 assume !!(main_~i~0 < 100); 11114#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11113#L10-2 assume true; 11112#L9-1 assume !!(main_~i~0 < 100); 11111#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11110#L10-2 assume true; 11109#L9-1 assume !!(main_~i~0 < 100); 11108#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11107#L10-2 assume true; 11106#L9-1 assume !!(main_~i~0 < 100); 11105#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11104#L10-2 assume true; 11103#L9-1 assume !!(main_~i~0 < 100); 11102#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11101#L10-2 assume true; 11100#L9-1 assume !!(main_~i~0 < 100); 11099#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11098#L10-2 assume true; 11096#L9-1 assume !!(main_~i~0 < 100); 11097#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11095#L10-2 assume true; 11093#L9-1 assume !!(main_~i~0 < 100); 11094#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 11091#L10-2 assume true; 11092#L9-1 [2018-11-10 09:50:26,962 INFO L795 eck$LassoCheckResult]: Loop: 11092#L9-1 assume !!(main_~i~0 < 100); 11097#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11095#L10-2 assume true; 11093#L9-1 assume !!(main_~i~0 < 100); 11094#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 11091#L10-2 assume true; 11092#L9-1 [2018-11-10 09:50:26,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:26,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1187934530, now seen corresponding path program 34 times [2018-11-10 09:50:26,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:26,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:26,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:26,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 35 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:27,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:27,290 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:27,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:27,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:27,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:27,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 35 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:27,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:27,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-10 09:50:27,334 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:27,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 31 times [2018-11-10 09:50:27,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:27,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:27,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:27,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:27,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 09:50:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 09:50:27,349 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. cyclomatic complexity: 3 Second operand 37 states. [2018-11-10 09:50:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:27,400 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-11-10 09:50:27,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 09:50:27,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 118 transitions. [2018-11-10 09:50:27,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:27,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 114 states and 116 transitions. [2018-11-10 09:50:27,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:27,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:27,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 116 transitions. [2018-11-10 09:50:27,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:27,402 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-11-10 09:50:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 116 transitions. [2018-11-10 09:50:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-10 09:50:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 09:50:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-11-10 09:50:27,404 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-11-10 09:50:27,404 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-11-10 09:50:27,404 INFO L442 BuchiCegarLoop]: ======== Iteration 37============ [2018-11-10 09:50:27,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 114 transitions. [2018-11-10 09:50:27,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:27,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:27,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:27,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 36, 35, 1, 1, 1] [2018-11-10 09:50:27,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:27,405 INFO L793 eck$LassoCheckResult]: Stem: 11672#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 11669#L10-2 assume true; 11673#L9-1 assume !!(main_~i~0 < 100); 11670#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11671#L10-2 assume true; 11674#L9-1 assume !!(main_~i~0 < 100); 11675#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11779#L10-2 assume true; 11778#L9-1 assume !!(main_~i~0 < 100); 11777#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11776#L10-2 assume true; 11775#L9-1 assume !!(main_~i~0 < 100); 11774#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11773#L10-2 assume true; 11772#L9-1 assume !!(main_~i~0 < 100); 11771#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11770#L10-2 assume true; 11769#L9-1 assume !!(main_~i~0 < 100); 11768#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11767#L10-2 assume true; 11766#L9-1 assume !!(main_~i~0 < 100); 11765#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11764#L10-2 assume true; 11763#L9-1 assume !!(main_~i~0 < 100); 11762#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11761#L10-2 assume true; 11760#L9-1 assume !!(main_~i~0 < 100); 11759#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11758#L10-2 assume true; 11757#L9-1 assume !!(main_~i~0 < 100); 11756#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11755#L10-2 assume true; 11754#L9-1 assume !!(main_~i~0 < 100); 11753#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11752#L10-2 assume true; 11751#L9-1 assume !!(main_~i~0 < 100); 11750#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11749#L10-2 assume true; 11748#L9-1 assume !!(main_~i~0 < 100); 11747#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11746#L10-2 assume true; 11745#L9-1 assume !!(main_~i~0 < 100); 11744#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11743#L10-2 assume true; 11742#L9-1 assume !!(main_~i~0 < 100); 11741#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11740#L10-2 assume true; 11739#L9-1 assume !!(main_~i~0 < 100); 11738#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11737#L10-2 assume true; 11736#L9-1 assume !!(main_~i~0 < 100); 11735#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11734#L10-2 assume true; 11733#L9-1 assume !!(main_~i~0 < 100); 11732#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11731#L10-2 assume true; 11730#L9-1 assume !!(main_~i~0 < 100); 11729#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11728#L10-2 assume true; 11727#L9-1 assume !!(main_~i~0 < 100); 11726#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11725#L10-2 assume true; 11724#L9-1 assume !!(main_~i~0 < 100); 11723#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11722#L10-2 assume true; 11721#L9-1 assume !!(main_~i~0 < 100); 11720#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11719#L10-2 assume true; 11718#L9-1 assume !!(main_~i~0 < 100); 11717#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11716#L10-2 assume true; 11715#L9-1 assume !!(main_~i~0 < 100); 11714#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11713#L10-2 assume true; 11712#L9-1 assume !!(main_~i~0 < 100); 11711#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11710#L10-2 assume true; 11709#L9-1 assume !!(main_~i~0 < 100); 11708#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11707#L10-2 assume true; 11706#L9-1 assume !!(main_~i~0 < 100); 11705#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11704#L10-2 assume true; 11703#L9-1 assume !!(main_~i~0 < 100); 11702#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11701#L10-2 assume true; 11700#L9-1 assume !!(main_~i~0 < 100); 11699#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11698#L10-2 assume true; 11697#L9-1 assume !!(main_~i~0 < 100); 11696#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11695#L10-2 assume true; 11694#L9-1 assume !!(main_~i~0 < 100); 11693#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11692#L10-2 assume true; 11691#L9-1 assume !!(main_~i~0 < 100); 11690#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11689#L10-2 assume true; 11688#L9-1 assume !!(main_~i~0 < 100); 11687#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11686#L10-2 assume true; 11685#L9-1 assume !!(main_~i~0 < 100); 11684#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11683#L10-2 assume true; 11681#L9-1 assume !!(main_~i~0 < 100); 11682#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11680#L10-2 assume true; 11678#L9-1 assume !!(main_~i~0 < 100); 11679#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 11676#L10-2 assume true; 11677#L9-1 [2018-11-10 09:50:27,405 INFO L795 eck$LassoCheckResult]: Loop: 11677#L9-1 assume !!(main_~i~0 < 100); 11682#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 11680#L10-2 assume true; 11678#L9-1 assume !!(main_~i~0 < 100); 11679#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 11676#L10-2 assume true; 11677#L9-1 [2018-11-10 09:50:27,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 771100833, now seen corresponding path program 35 times [2018-11-10 09:50:27,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:27,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:27,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:27,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:27,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 36 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:27,801 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:27,808 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:27,831 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-11-10 09:50:27,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:27,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 36 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:27,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:27,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-11-10 09:50:27,884 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:27,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 32 times [2018-11-10 09:50:27,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:27,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:27,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-10 09:50:27,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 09:50:27,911 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. cyclomatic complexity: 3 Second operand 38 states. [2018-11-10 09:50:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:27,996 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-10 09:50:27,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 09:50:27,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 121 transitions. [2018-11-10 09:50:27,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:27,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 119 transitions. [2018-11-10 09:50:27,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:27,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:27,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 119 transitions. [2018-11-10 09:50:27,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:27,997 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-11-10 09:50:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 119 transitions. [2018-11-10 09:50:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-10 09:50:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 09:50:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-11-10 09:50:27,999 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-11-10 09:50:27,999 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-11-10 09:50:27,999 INFO L442 BuchiCegarLoop]: ======== Iteration 38============ [2018-11-10 09:50:27,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 117 transitions. [2018-11-10 09:50:28,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:28,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:28,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:28,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [38, 37, 36, 1, 1, 1] [2018-11-10 09:50:28,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:28,001 INFO L793 eck$LassoCheckResult]: Stem: 12274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 12271#L10-2 assume true; 12275#L9-1 assume !!(main_~i~0 < 100); 12277#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12384#L10-2 assume true; 12278#L9-1 assume !!(main_~i~0 < 100); 12272#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12273#L10-2 assume true; 12276#L9-1 assume !!(main_~i~0 < 100); 12383#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12382#L10-2 assume true; 12381#L9-1 assume !!(main_~i~0 < 100); 12380#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12379#L10-2 assume true; 12378#L9-1 assume !!(main_~i~0 < 100); 12377#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12376#L10-2 assume true; 12375#L9-1 assume !!(main_~i~0 < 100); 12374#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12373#L10-2 assume true; 12372#L9-1 assume !!(main_~i~0 < 100); 12371#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12370#L10-2 assume true; 12369#L9-1 assume !!(main_~i~0 < 100); 12368#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12367#L10-2 assume true; 12366#L9-1 assume !!(main_~i~0 < 100); 12365#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12364#L10-2 assume true; 12363#L9-1 assume !!(main_~i~0 < 100); 12362#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12361#L10-2 assume true; 12360#L9-1 assume !!(main_~i~0 < 100); 12359#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12358#L10-2 assume true; 12357#L9-1 assume !!(main_~i~0 < 100); 12356#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12355#L10-2 assume true; 12354#L9-1 assume !!(main_~i~0 < 100); 12353#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12352#L10-2 assume true; 12351#L9-1 assume !!(main_~i~0 < 100); 12350#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12349#L10-2 assume true; 12348#L9-1 assume !!(main_~i~0 < 100); 12347#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12346#L10-2 assume true; 12345#L9-1 assume !!(main_~i~0 < 100); 12344#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12343#L10-2 assume true; 12342#L9-1 assume !!(main_~i~0 < 100); 12341#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12340#L10-2 assume true; 12339#L9-1 assume !!(main_~i~0 < 100); 12338#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12337#L10-2 assume true; 12336#L9-1 assume !!(main_~i~0 < 100); 12335#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12334#L10-2 assume true; 12333#L9-1 assume !!(main_~i~0 < 100); 12332#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12331#L10-2 assume true; 12330#L9-1 assume !!(main_~i~0 < 100); 12329#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12328#L10-2 assume true; 12327#L9-1 assume !!(main_~i~0 < 100); 12326#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12325#L10-2 assume true; 12324#L9-1 assume !!(main_~i~0 < 100); 12323#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12322#L10-2 assume true; 12321#L9-1 assume !!(main_~i~0 < 100); 12320#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12319#L10-2 assume true; 12318#L9-1 assume !!(main_~i~0 < 100); 12317#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12316#L10-2 assume true; 12315#L9-1 assume !!(main_~i~0 < 100); 12314#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12313#L10-2 assume true; 12312#L9-1 assume !!(main_~i~0 < 100); 12311#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12310#L10-2 assume true; 12309#L9-1 assume !!(main_~i~0 < 100); 12308#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12307#L10-2 assume true; 12306#L9-1 assume !!(main_~i~0 < 100); 12305#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12304#L10-2 assume true; 12303#L9-1 assume !!(main_~i~0 < 100); 12302#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12301#L10-2 assume true; 12300#L9-1 assume !!(main_~i~0 < 100); 12299#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12298#L10-2 assume true; 12297#L9-1 assume !!(main_~i~0 < 100); 12296#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12295#L10-2 assume true; 12294#L9-1 assume !!(main_~i~0 < 100); 12293#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12292#L10-2 assume true; 12291#L9-1 assume !!(main_~i~0 < 100); 12290#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12289#L10-2 assume true; 12288#L9-1 assume !!(main_~i~0 < 100); 12287#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12286#L10-2 assume true; 12284#L9-1 assume !!(main_~i~0 < 100); 12285#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12283#L10-2 assume true; 12281#L9-1 assume !!(main_~i~0 < 100); 12282#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 12279#L10-2 assume true; 12280#L9-1 [2018-11-10 09:50:28,001 INFO L795 eck$LassoCheckResult]: Loop: 12280#L9-1 assume !!(main_~i~0 < 100); 12285#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12283#L10-2 assume true; 12281#L9-1 assume !!(main_~i~0 < 100); 12282#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 12279#L10-2 assume true; 12280#L9-1 [2018-11-10 09:50:28,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1916985378, now seen corresponding path program 36 times [2018-11-10 09:50:28,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:28,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 37 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:28,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:28,369 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:28,377 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:28,401 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-11-10 09:50:28,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:28,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 37 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:28,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:28,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-11-10 09:50:28,436 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:28,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 33 times [2018-11-10 09:50:28,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:28,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:28,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 09:50:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 09:50:28,455 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. cyclomatic complexity: 3 Second operand 39 states. [2018-11-10 09:50:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:28,508 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-11-10 09:50:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 09:50:28,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 124 transitions. [2018-11-10 09:50:28,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:28,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 120 states and 122 transitions. [2018-11-10 09:50:28,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:28,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:28,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 122 transitions. [2018-11-10 09:50:28,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:28,509 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-11-10 09:50:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 122 transitions. [2018-11-10 09:50:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-10 09:50:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 09:50:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-11-10 09:50:28,510 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-11-10 09:50:28,510 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-11-10 09:50:28,510 INFO L442 BuchiCegarLoop]: ======== Iteration 39============ [2018-11-10 09:50:28,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 120 transitions. [2018-11-10 09:50:28,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:28,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:28,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:28,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [39, 38, 37, 1, 1, 1] [2018-11-10 09:50:28,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:28,511 INFO L793 eck$LassoCheckResult]: Stem: 12892#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12888#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 12889#L10-2 assume true; 12893#L9-1 assume !!(main_~i~0 < 100); 12895#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13005#L10-2 assume true; 12896#L9-1 assume !!(main_~i~0 < 100); 12890#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12891#L10-2 assume true; 12894#L9-1 assume !!(main_~i~0 < 100); 13004#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13003#L10-2 assume true; 13002#L9-1 assume !!(main_~i~0 < 100); 13001#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13000#L10-2 assume true; 12999#L9-1 assume !!(main_~i~0 < 100); 12998#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12997#L10-2 assume true; 12996#L9-1 assume !!(main_~i~0 < 100); 12995#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12994#L10-2 assume true; 12993#L9-1 assume !!(main_~i~0 < 100); 12992#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12991#L10-2 assume true; 12990#L9-1 assume !!(main_~i~0 < 100); 12989#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12988#L10-2 assume true; 12987#L9-1 assume !!(main_~i~0 < 100); 12986#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12985#L10-2 assume true; 12984#L9-1 assume !!(main_~i~0 < 100); 12983#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12982#L10-2 assume true; 12981#L9-1 assume !!(main_~i~0 < 100); 12980#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12979#L10-2 assume true; 12978#L9-1 assume !!(main_~i~0 < 100); 12977#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12976#L10-2 assume true; 12975#L9-1 assume !!(main_~i~0 < 100); 12974#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12973#L10-2 assume true; 12972#L9-1 assume !!(main_~i~0 < 100); 12971#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12970#L10-2 assume true; 12969#L9-1 assume !!(main_~i~0 < 100); 12968#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12967#L10-2 assume true; 12966#L9-1 assume !!(main_~i~0 < 100); 12965#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12964#L10-2 assume true; 12963#L9-1 assume !!(main_~i~0 < 100); 12962#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12961#L10-2 assume true; 12960#L9-1 assume !!(main_~i~0 < 100); 12959#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12958#L10-2 assume true; 12957#L9-1 assume !!(main_~i~0 < 100); 12956#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12955#L10-2 assume true; 12954#L9-1 assume !!(main_~i~0 < 100); 12953#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12952#L10-2 assume true; 12951#L9-1 assume !!(main_~i~0 < 100); 12950#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12949#L10-2 assume true; 12948#L9-1 assume !!(main_~i~0 < 100); 12947#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12946#L10-2 assume true; 12945#L9-1 assume !!(main_~i~0 < 100); 12944#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12943#L10-2 assume true; 12942#L9-1 assume !!(main_~i~0 < 100); 12941#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12940#L10-2 assume true; 12939#L9-1 assume !!(main_~i~0 < 100); 12938#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12937#L10-2 assume true; 12936#L9-1 assume !!(main_~i~0 < 100); 12935#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12934#L10-2 assume true; 12933#L9-1 assume !!(main_~i~0 < 100); 12932#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12931#L10-2 assume true; 12930#L9-1 assume !!(main_~i~0 < 100); 12929#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12928#L10-2 assume true; 12927#L9-1 assume !!(main_~i~0 < 100); 12926#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12925#L10-2 assume true; 12924#L9-1 assume !!(main_~i~0 < 100); 12923#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12922#L10-2 assume true; 12921#L9-1 assume !!(main_~i~0 < 100); 12920#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12919#L10-2 assume true; 12918#L9-1 assume !!(main_~i~0 < 100); 12917#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12916#L10-2 assume true; 12915#L9-1 assume !!(main_~i~0 < 100); 12914#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12913#L10-2 assume true; 12912#L9-1 assume !!(main_~i~0 < 100); 12911#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12910#L10-2 assume true; 12909#L9-1 assume !!(main_~i~0 < 100); 12908#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12907#L10-2 assume true; 12906#L9-1 assume !!(main_~i~0 < 100); 12905#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12904#L10-2 assume true; 12902#L9-1 assume !!(main_~i~0 < 100); 12903#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12901#L10-2 assume true; 12899#L9-1 assume !!(main_~i~0 < 100); 12900#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 12897#L10-2 assume true; 12898#L9-1 [2018-11-10 09:50:28,511 INFO L795 eck$LassoCheckResult]: Loop: 12898#L9-1 assume !!(main_~i~0 < 100); 12903#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 12901#L10-2 assume true; 12899#L9-1 assume !!(main_~i~0 < 100); 12900#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 12897#L10-2 assume true; 12898#L9-1 [2018-11-10 09:50:28,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1266903937, now seen corresponding path program 37 times [2018-11-10 09:50:28,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:28,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:28,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 38 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:28,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:28,932 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:28,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:28,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 38 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:29,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:29,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-11-10 09:50:29,005 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:29,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 34 times [2018-11-10 09:50:29,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:29,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:29,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:29,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 09:50:29,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 09:50:29,025 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. cyclomatic complexity: 3 Second operand 40 states. [2018-11-10 09:50:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:29,093 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-11-10 09:50:29,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 09:50:29,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 127 transitions. [2018-11-10 09:50:29,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:29,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 123 states and 125 transitions. [2018-11-10 09:50:29,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:29,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:29,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 125 transitions. [2018-11-10 09:50:29,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:29,094 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-11-10 09:50:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 125 transitions. [2018-11-10 09:50:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-10 09:50:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-10 09:50:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-11-10 09:50:29,095 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-11-10 09:50:29,095 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-11-10 09:50:29,095 INFO L442 BuchiCegarLoop]: ======== Iteration 40============ [2018-11-10 09:50:29,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 123 transitions. [2018-11-10 09:50:29,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:29,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:29,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:29,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [40, 39, 38, 1, 1, 1] [2018-11-10 09:50:29,096 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:29,096 INFO L793 eck$LassoCheckResult]: Stem: 13526#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 13523#L10-2 assume true; 13527#L9-1 assume !!(main_~i~0 < 100); 13524#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13525#L10-2 assume true; 13528#L9-1 assume !!(main_~i~0 < 100); 13529#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13642#L10-2 assume true; 13641#L9-1 assume !!(main_~i~0 < 100); 13640#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13639#L10-2 assume true; 13638#L9-1 assume !!(main_~i~0 < 100); 13637#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13636#L10-2 assume true; 13635#L9-1 assume !!(main_~i~0 < 100); 13634#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13633#L10-2 assume true; 13632#L9-1 assume !!(main_~i~0 < 100); 13631#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13630#L10-2 assume true; 13629#L9-1 assume !!(main_~i~0 < 100); 13628#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13627#L10-2 assume true; 13626#L9-1 assume !!(main_~i~0 < 100); 13625#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13624#L10-2 assume true; 13623#L9-1 assume !!(main_~i~0 < 100); 13622#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13621#L10-2 assume true; 13620#L9-1 assume !!(main_~i~0 < 100); 13619#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13618#L10-2 assume true; 13617#L9-1 assume !!(main_~i~0 < 100); 13616#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13615#L10-2 assume true; 13614#L9-1 assume !!(main_~i~0 < 100); 13613#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13612#L10-2 assume true; 13611#L9-1 assume !!(main_~i~0 < 100); 13610#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13609#L10-2 assume true; 13608#L9-1 assume !!(main_~i~0 < 100); 13607#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13606#L10-2 assume true; 13605#L9-1 assume !!(main_~i~0 < 100); 13604#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13603#L10-2 assume true; 13602#L9-1 assume !!(main_~i~0 < 100); 13601#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13600#L10-2 assume true; 13599#L9-1 assume !!(main_~i~0 < 100); 13598#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13597#L10-2 assume true; 13596#L9-1 assume !!(main_~i~0 < 100); 13595#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13594#L10-2 assume true; 13593#L9-1 assume !!(main_~i~0 < 100); 13592#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13591#L10-2 assume true; 13590#L9-1 assume !!(main_~i~0 < 100); 13589#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13588#L10-2 assume true; 13587#L9-1 assume !!(main_~i~0 < 100); 13586#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13585#L10-2 assume true; 13584#L9-1 assume !!(main_~i~0 < 100); 13583#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13582#L10-2 assume true; 13581#L9-1 assume !!(main_~i~0 < 100); 13580#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13579#L10-2 assume true; 13578#L9-1 assume !!(main_~i~0 < 100); 13577#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13576#L10-2 assume true; 13575#L9-1 assume !!(main_~i~0 < 100); 13574#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13573#L10-2 assume true; 13572#L9-1 assume !!(main_~i~0 < 100); 13571#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13570#L10-2 assume true; 13569#L9-1 assume !!(main_~i~0 < 100); 13568#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13567#L10-2 assume true; 13566#L9-1 assume !!(main_~i~0 < 100); 13565#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13564#L10-2 assume true; 13563#L9-1 assume !!(main_~i~0 < 100); 13562#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13561#L10-2 assume true; 13560#L9-1 assume !!(main_~i~0 < 100); 13559#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13558#L10-2 assume true; 13557#L9-1 assume !!(main_~i~0 < 100); 13556#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13555#L10-2 assume true; 13554#L9-1 assume !!(main_~i~0 < 100); 13553#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13552#L10-2 assume true; 13551#L9-1 assume !!(main_~i~0 < 100); 13550#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13549#L10-2 assume true; 13548#L9-1 assume !!(main_~i~0 < 100); 13547#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13546#L10-2 assume true; 13545#L9-1 assume !!(main_~i~0 < 100); 13544#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13543#L10-2 assume true; 13542#L9-1 assume !!(main_~i~0 < 100); 13541#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13540#L10-2 assume true; 13539#L9-1 assume !!(main_~i~0 < 100); 13538#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13537#L10-2 assume true; 13535#L9-1 assume !!(main_~i~0 < 100); 13536#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13534#L10-2 assume true; 13532#L9-1 assume !!(main_~i~0 < 100); 13533#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 13530#L10-2 assume true; 13531#L9-1 [2018-11-10 09:50:29,096 INFO L795 eck$LassoCheckResult]: Loop: 13531#L9-1 assume !!(main_~i~0 < 100); 13536#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 13534#L10-2 assume true; 13532#L9-1 assume !!(main_~i~0 < 100); 13533#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 13530#L10-2 assume true; 13531#L9-1 [2018-11-10 09:50:29,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1839245058, now seen corresponding path program 38 times [2018-11-10 09:50:29,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:29,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:29,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:29,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 39 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:29,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:29,537 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:29,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:29,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:29,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:29,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 39 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-11-10 09:50:29,604 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:29,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 35 times [2018-11-10 09:50:29,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:29,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:29,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:29,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 09:50:29,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 09:50:29,625 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. cyclomatic complexity: 3 Second operand 41 states. [2018-11-10 09:50:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:29,695 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-11-10 09:50:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 09:50:29,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 130 transitions. [2018-11-10 09:50:29,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:29,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 126 states and 128 transitions. [2018-11-10 09:50:29,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:29,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:29,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 128 transitions. [2018-11-10 09:50:29,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:29,697 INFO L705 BuchiCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-11-10 09:50:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 128 transitions. [2018-11-10 09:50:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-10 09:50:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-10 09:50:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-11-10 09:50:29,698 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-11-10 09:50:29,698 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-11-10 09:50:29,698 INFO L442 BuchiCegarLoop]: ======== Iteration 41============ [2018-11-10 09:50:29,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 126 transitions. [2018-11-10 09:50:29,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:29,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:29,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:29,698 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [41, 40, 39, 1, 1, 1] [2018-11-10 09:50:29,698 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:29,699 INFO L793 eck$LassoCheckResult]: Stem: 14176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14172#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 14173#L10-2 assume true; 14177#L9-1 assume !!(main_~i~0 < 100); 14178#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14295#L10-2 assume true; 14179#L9-1 assume !!(main_~i~0 < 100); 14174#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14175#L10-2 assume true; 14180#L9-1 assume !!(main_~i~0 < 100); 14294#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14293#L10-2 assume true; 14292#L9-1 assume !!(main_~i~0 < 100); 14291#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14290#L10-2 assume true; 14289#L9-1 assume !!(main_~i~0 < 100); 14288#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14287#L10-2 assume true; 14286#L9-1 assume !!(main_~i~0 < 100); 14285#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14284#L10-2 assume true; 14283#L9-1 assume !!(main_~i~0 < 100); 14282#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14281#L10-2 assume true; 14280#L9-1 assume !!(main_~i~0 < 100); 14279#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14278#L10-2 assume true; 14277#L9-1 assume !!(main_~i~0 < 100); 14276#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14275#L10-2 assume true; 14274#L9-1 assume !!(main_~i~0 < 100); 14273#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14272#L10-2 assume true; 14271#L9-1 assume !!(main_~i~0 < 100); 14270#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14269#L10-2 assume true; 14268#L9-1 assume !!(main_~i~0 < 100); 14267#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14266#L10-2 assume true; 14265#L9-1 assume !!(main_~i~0 < 100); 14264#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14263#L10-2 assume true; 14262#L9-1 assume !!(main_~i~0 < 100); 14261#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14260#L10-2 assume true; 14259#L9-1 assume !!(main_~i~0 < 100); 14258#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14257#L10-2 assume true; 14256#L9-1 assume !!(main_~i~0 < 100); 14255#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14254#L10-2 assume true; 14253#L9-1 assume !!(main_~i~0 < 100); 14252#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14251#L10-2 assume true; 14250#L9-1 assume !!(main_~i~0 < 100); 14249#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14248#L10-2 assume true; 14247#L9-1 assume !!(main_~i~0 < 100); 14246#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14245#L10-2 assume true; 14244#L9-1 assume !!(main_~i~0 < 100); 14243#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14242#L10-2 assume true; 14241#L9-1 assume !!(main_~i~0 < 100); 14240#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14239#L10-2 assume true; 14238#L9-1 assume !!(main_~i~0 < 100); 14237#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14236#L10-2 assume true; 14235#L9-1 assume !!(main_~i~0 < 100); 14234#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14233#L10-2 assume true; 14232#L9-1 assume !!(main_~i~0 < 100); 14231#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14230#L10-2 assume true; 14229#L9-1 assume !!(main_~i~0 < 100); 14228#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14227#L10-2 assume true; 14226#L9-1 assume !!(main_~i~0 < 100); 14225#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14224#L10-2 assume true; 14223#L9-1 assume !!(main_~i~0 < 100); 14222#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14221#L10-2 assume true; 14220#L9-1 assume !!(main_~i~0 < 100); 14219#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14218#L10-2 assume true; 14217#L9-1 assume !!(main_~i~0 < 100); 14216#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14215#L10-2 assume true; 14214#L9-1 assume !!(main_~i~0 < 100); 14213#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14212#L10-2 assume true; 14211#L9-1 assume !!(main_~i~0 < 100); 14210#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14209#L10-2 assume true; 14208#L9-1 assume !!(main_~i~0 < 100); 14207#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14206#L10-2 assume true; 14205#L9-1 assume !!(main_~i~0 < 100); 14204#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14203#L10-2 assume true; 14202#L9-1 assume !!(main_~i~0 < 100); 14201#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14200#L10-2 assume true; 14199#L9-1 assume !!(main_~i~0 < 100); 14198#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14197#L10-2 assume true; 14196#L9-1 assume !!(main_~i~0 < 100); 14195#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14194#L10-2 assume true; 14193#L9-1 assume !!(main_~i~0 < 100); 14192#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14191#L10-2 assume true; 14190#L9-1 assume !!(main_~i~0 < 100); 14189#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14188#L10-2 assume true; 14186#L9-1 assume !!(main_~i~0 < 100); 14187#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14185#L10-2 assume true; 14183#L9-1 assume !!(main_~i~0 < 100); 14184#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 14181#L10-2 assume true; 14182#L9-1 [2018-11-10 09:50:29,699 INFO L795 eck$LassoCheckResult]: Loop: 14182#L9-1 assume !!(main_~i~0 < 100); 14187#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14185#L10-2 assume true; 14183#L9-1 assume !!(main_~i~0 < 100); 14184#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 14181#L10-2 assume true; 14182#L9-1 [2018-11-10 09:50:29,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2053562783, now seen corresponding path program 39 times [2018-11-10 09:50:29,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:29,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 40 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:30,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:30,124 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:30,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:30,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-10 09:50:30,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:30,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 40 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:30,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:30,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-11-10 09:50:30,184 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:30,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 36 times [2018-11-10 09:50:30,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:30,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:30,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 09:50:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 09:50:30,205 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. cyclomatic complexity: 3 Second operand 42 states. [2018-11-10 09:50:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:30,261 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-11-10 09:50:30,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 09:50:30,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 133 transitions. [2018-11-10 09:50:30,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:30,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 129 states and 131 transitions. [2018-11-10 09:50:30,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:30,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:30,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 131 transitions. [2018-11-10 09:50:30,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:30,263 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-11-10 09:50:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 131 transitions. [2018-11-10 09:50:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-10 09:50:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 09:50:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-11-10 09:50:30,265 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-11-10 09:50:30,265 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-11-10 09:50:30,265 INFO L442 BuchiCegarLoop]: ======== Iteration 42============ [2018-11-10 09:50:30,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 129 transitions. [2018-11-10 09:50:30,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:30,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:30,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:30,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [42, 41, 40, 1, 1, 1] [2018-11-10 09:50:30,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:30,267 INFO L793 eck$LassoCheckResult]: Stem: 14842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14838#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 14839#L10-2 assume true; 14843#L9-1 assume !!(main_~i~0 < 100); 14845#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14964#L10-2 assume true; 14846#L9-1 assume !!(main_~i~0 < 100); 14840#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14841#L10-2 assume true; 14844#L9-1 assume !!(main_~i~0 < 100); 14963#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14962#L10-2 assume true; 14961#L9-1 assume !!(main_~i~0 < 100); 14960#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14959#L10-2 assume true; 14958#L9-1 assume !!(main_~i~0 < 100); 14957#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14956#L10-2 assume true; 14955#L9-1 assume !!(main_~i~0 < 100); 14954#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14953#L10-2 assume true; 14952#L9-1 assume !!(main_~i~0 < 100); 14951#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14950#L10-2 assume true; 14949#L9-1 assume !!(main_~i~0 < 100); 14948#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14947#L10-2 assume true; 14946#L9-1 assume !!(main_~i~0 < 100); 14945#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14944#L10-2 assume true; 14943#L9-1 assume !!(main_~i~0 < 100); 14942#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14941#L10-2 assume true; 14940#L9-1 assume !!(main_~i~0 < 100); 14939#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14938#L10-2 assume true; 14937#L9-1 assume !!(main_~i~0 < 100); 14936#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14935#L10-2 assume true; 14934#L9-1 assume !!(main_~i~0 < 100); 14933#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14932#L10-2 assume true; 14931#L9-1 assume !!(main_~i~0 < 100); 14930#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14929#L10-2 assume true; 14928#L9-1 assume !!(main_~i~0 < 100); 14927#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14926#L10-2 assume true; 14925#L9-1 assume !!(main_~i~0 < 100); 14924#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14923#L10-2 assume true; 14922#L9-1 assume !!(main_~i~0 < 100); 14921#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14920#L10-2 assume true; 14919#L9-1 assume !!(main_~i~0 < 100); 14918#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14917#L10-2 assume true; 14916#L9-1 assume !!(main_~i~0 < 100); 14915#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14914#L10-2 assume true; 14913#L9-1 assume !!(main_~i~0 < 100); 14912#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14911#L10-2 assume true; 14910#L9-1 assume !!(main_~i~0 < 100); 14909#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14908#L10-2 assume true; 14907#L9-1 assume !!(main_~i~0 < 100); 14906#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14905#L10-2 assume true; 14904#L9-1 assume !!(main_~i~0 < 100); 14903#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14902#L10-2 assume true; 14901#L9-1 assume !!(main_~i~0 < 100); 14900#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14899#L10-2 assume true; 14898#L9-1 assume !!(main_~i~0 < 100); 14897#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14896#L10-2 assume true; 14895#L9-1 assume !!(main_~i~0 < 100); 14894#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14893#L10-2 assume true; 14892#L9-1 assume !!(main_~i~0 < 100); 14891#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14890#L10-2 assume true; 14889#L9-1 assume !!(main_~i~0 < 100); 14888#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14887#L10-2 assume true; 14886#L9-1 assume !!(main_~i~0 < 100); 14885#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14884#L10-2 assume true; 14883#L9-1 assume !!(main_~i~0 < 100); 14882#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14881#L10-2 assume true; 14880#L9-1 assume !!(main_~i~0 < 100); 14879#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14878#L10-2 assume true; 14877#L9-1 assume !!(main_~i~0 < 100); 14876#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14875#L10-2 assume true; 14874#L9-1 assume !!(main_~i~0 < 100); 14873#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14872#L10-2 assume true; 14871#L9-1 assume !!(main_~i~0 < 100); 14870#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14869#L10-2 assume true; 14868#L9-1 assume !!(main_~i~0 < 100); 14867#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14866#L10-2 assume true; 14865#L9-1 assume !!(main_~i~0 < 100); 14864#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14863#L10-2 assume true; 14862#L9-1 assume !!(main_~i~0 < 100); 14861#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14860#L10-2 assume true; 14859#L9-1 assume !!(main_~i~0 < 100); 14858#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14857#L10-2 assume true; 14856#L9-1 assume !!(main_~i~0 < 100); 14855#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14854#L10-2 assume true; 14852#L9-1 assume !!(main_~i~0 < 100); 14853#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14851#L10-2 assume true; 14849#L9-1 assume !!(main_~i~0 < 100); 14850#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 14847#L10-2 assume true; 14848#L9-1 [2018-11-10 09:50:30,267 INFO L795 eck$LassoCheckResult]: Loop: 14848#L9-1 assume !!(main_~i~0 < 100); 14853#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 14851#L10-2 assume true; 14849#L9-1 assume !!(main_~i~0 < 100); 14850#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 14847#L10-2 assume true; 14848#L9-1 [2018-11-10 09:50:30,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:30,267 INFO L82 PathProgramCache]: Analyzing trace with hash -176539106, now seen corresponding path program 40 times [2018-11-10 09:50:30,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:30,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:30,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:30,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 41 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:30,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:30,721 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:30,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:30,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:30,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:30,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 41 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:30,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:30,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-10 09:50:30,776 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:30,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 37 times [2018-11-10 09:50:30,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 09:50:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 09:50:30,802 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. cyclomatic complexity: 3 Second operand 43 states. [2018-11-10 09:50:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:30,859 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-11-10 09:50:30,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-10 09:50:30,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 136 transitions. [2018-11-10 09:50:30,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:30,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 132 states and 134 transitions. [2018-11-10 09:50:30,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:30,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:30,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 134 transitions. [2018-11-10 09:50:30,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:30,861 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-11-10 09:50:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 134 transitions. [2018-11-10 09:50:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-10 09:50:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 09:50:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-11-10 09:50:30,862 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-11-10 09:50:30,862 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-11-10 09:50:30,862 INFO L442 BuchiCegarLoop]: ======== Iteration 43============ [2018-11-10 09:50:30,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 132 transitions. [2018-11-10 09:50:30,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:30,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:30,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:30,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [43, 42, 41, 1, 1, 1] [2018-11-10 09:50:30,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:30,864 INFO L793 eck$LassoCheckResult]: Stem: 15524#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15520#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 15521#L10-2 assume true; 15525#L9-1 assume !!(main_~i~0 < 100); 15527#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15649#L10-2 assume true; 15528#L9-1 assume !!(main_~i~0 < 100); 15522#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15523#L10-2 assume true; 15526#L9-1 assume !!(main_~i~0 < 100); 15648#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15647#L10-2 assume true; 15646#L9-1 assume !!(main_~i~0 < 100); 15645#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15644#L10-2 assume true; 15643#L9-1 assume !!(main_~i~0 < 100); 15642#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15641#L10-2 assume true; 15640#L9-1 assume !!(main_~i~0 < 100); 15639#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15638#L10-2 assume true; 15637#L9-1 assume !!(main_~i~0 < 100); 15636#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15635#L10-2 assume true; 15634#L9-1 assume !!(main_~i~0 < 100); 15633#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15632#L10-2 assume true; 15631#L9-1 assume !!(main_~i~0 < 100); 15630#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15629#L10-2 assume true; 15628#L9-1 assume !!(main_~i~0 < 100); 15627#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15626#L10-2 assume true; 15625#L9-1 assume !!(main_~i~0 < 100); 15624#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15623#L10-2 assume true; 15622#L9-1 assume !!(main_~i~0 < 100); 15621#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15620#L10-2 assume true; 15619#L9-1 assume !!(main_~i~0 < 100); 15618#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15617#L10-2 assume true; 15616#L9-1 assume !!(main_~i~0 < 100); 15615#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15614#L10-2 assume true; 15613#L9-1 assume !!(main_~i~0 < 100); 15612#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15611#L10-2 assume true; 15610#L9-1 assume !!(main_~i~0 < 100); 15609#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15608#L10-2 assume true; 15607#L9-1 assume !!(main_~i~0 < 100); 15606#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15605#L10-2 assume true; 15604#L9-1 assume !!(main_~i~0 < 100); 15603#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15602#L10-2 assume true; 15601#L9-1 assume !!(main_~i~0 < 100); 15600#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15599#L10-2 assume true; 15598#L9-1 assume !!(main_~i~0 < 100); 15597#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15596#L10-2 assume true; 15595#L9-1 assume !!(main_~i~0 < 100); 15594#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15593#L10-2 assume true; 15592#L9-1 assume !!(main_~i~0 < 100); 15591#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15590#L10-2 assume true; 15589#L9-1 assume !!(main_~i~0 < 100); 15588#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15587#L10-2 assume true; 15586#L9-1 assume !!(main_~i~0 < 100); 15585#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15584#L10-2 assume true; 15583#L9-1 assume !!(main_~i~0 < 100); 15582#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15581#L10-2 assume true; 15580#L9-1 assume !!(main_~i~0 < 100); 15579#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15578#L10-2 assume true; 15577#L9-1 assume !!(main_~i~0 < 100); 15576#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15575#L10-2 assume true; 15574#L9-1 assume !!(main_~i~0 < 100); 15573#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15572#L10-2 assume true; 15571#L9-1 assume !!(main_~i~0 < 100); 15570#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15569#L10-2 assume true; 15568#L9-1 assume !!(main_~i~0 < 100); 15567#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15566#L10-2 assume true; 15565#L9-1 assume !!(main_~i~0 < 100); 15564#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15563#L10-2 assume true; 15562#L9-1 assume !!(main_~i~0 < 100); 15561#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15560#L10-2 assume true; 15559#L9-1 assume !!(main_~i~0 < 100); 15558#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15557#L10-2 assume true; 15556#L9-1 assume !!(main_~i~0 < 100); 15555#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15554#L10-2 assume true; 15553#L9-1 assume !!(main_~i~0 < 100); 15552#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15551#L10-2 assume true; 15550#L9-1 assume !!(main_~i~0 < 100); 15549#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15548#L10-2 assume true; 15547#L9-1 assume !!(main_~i~0 < 100); 15546#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15545#L10-2 assume true; 15544#L9-1 assume !!(main_~i~0 < 100); 15543#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15542#L10-2 assume true; 15541#L9-1 assume !!(main_~i~0 < 100); 15540#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15539#L10-2 assume true; 15538#L9-1 assume !!(main_~i~0 < 100); 15537#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15536#L10-2 assume true; 15534#L9-1 assume !!(main_~i~0 < 100); 15535#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15533#L10-2 assume true; 15531#L9-1 assume !!(main_~i~0 < 100); 15532#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 15529#L10-2 assume true; 15530#L9-1 [2018-11-10 09:50:30,864 INFO L795 eck$LassoCheckResult]: Loop: 15530#L9-1 assume !!(main_~i~0 < 100); 15535#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 15533#L10-2 assume true; 15531#L9-1 assume !!(main_~i~0 < 100); 15532#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 15529#L10-2 assume true; 15530#L9-1 [2018-11-10 09:50:30,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2056595777, now seen corresponding path program 41 times [2018-11-10 09:50:30,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 42 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:31,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:31,454 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:31,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:31,488 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-11-10 09:50:31,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:31,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 42 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:31,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:31,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-11-10 09:50:31,522 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:31,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 38 times [2018-11-10 09:50:31,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:31,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:31,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:31,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:31,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:31,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 09:50:31,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 09:50:31,547 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. cyclomatic complexity: 3 Second operand 44 states. [2018-11-10 09:50:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:31,599 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-11-10 09:50:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 09:50:31,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 139 transitions. [2018-11-10 09:50:31,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:31,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 135 states and 137 transitions. [2018-11-10 09:50:31,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:31,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:31,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 137 transitions. [2018-11-10 09:50:31,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:31,601 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-11-10 09:50:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 137 transitions. [2018-11-10 09:50:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-11-10 09:50:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 09:50:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-11-10 09:50:31,603 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-11-10 09:50:31,603 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-11-10 09:50:31,603 INFO L442 BuchiCegarLoop]: ======== Iteration 44============ [2018-11-10 09:50:31,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 135 transitions. [2018-11-10 09:50:31,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:31,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:31,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:31,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [44, 43, 42, 1, 1, 1] [2018-11-10 09:50:31,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:31,604 INFO L793 eck$LassoCheckResult]: Stem: 16222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 16219#L10-2 assume true; 16223#L9-1 assume !!(main_~i~0 < 100); 16225#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16350#L10-2 assume true; 16226#L9-1 assume !!(main_~i~0 < 100); 16220#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16221#L10-2 assume true; 16224#L9-1 assume !!(main_~i~0 < 100); 16349#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16348#L10-2 assume true; 16347#L9-1 assume !!(main_~i~0 < 100); 16346#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16345#L10-2 assume true; 16344#L9-1 assume !!(main_~i~0 < 100); 16343#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16342#L10-2 assume true; 16341#L9-1 assume !!(main_~i~0 < 100); 16340#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16339#L10-2 assume true; 16338#L9-1 assume !!(main_~i~0 < 100); 16337#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16336#L10-2 assume true; 16335#L9-1 assume !!(main_~i~0 < 100); 16334#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16333#L10-2 assume true; 16332#L9-1 assume !!(main_~i~0 < 100); 16331#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16330#L10-2 assume true; 16329#L9-1 assume !!(main_~i~0 < 100); 16328#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16327#L10-2 assume true; 16326#L9-1 assume !!(main_~i~0 < 100); 16325#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16324#L10-2 assume true; 16323#L9-1 assume !!(main_~i~0 < 100); 16322#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16321#L10-2 assume true; 16320#L9-1 assume !!(main_~i~0 < 100); 16319#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16318#L10-2 assume true; 16317#L9-1 assume !!(main_~i~0 < 100); 16316#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16315#L10-2 assume true; 16314#L9-1 assume !!(main_~i~0 < 100); 16313#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16312#L10-2 assume true; 16311#L9-1 assume !!(main_~i~0 < 100); 16310#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16309#L10-2 assume true; 16308#L9-1 assume !!(main_~i~0 < 100); 16307#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16306#L10-2 assume true; 16305#L9-1 assume !!(main_~i~0 < 100); 16304#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16303#L10-2 assume true; 16302#L9-1 assume !!(main_~i~0 < 100); 16301#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16300#L10-2 assume true; 16299#L9-1 assume !!(main_~i~0 < 100); 16298#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16297#L10-2 assume true; 16296#L9-1 assume !!(main_~i~0 < 100); 16295#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16294#L10-2 assume true; 16293#L9-1 assume !!(main_~i~0 < 100); 16292#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16291#L10-2 assume true; 16290#L9-1 assume !!(main_~i~0 < 100); 16289#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16288#L10-2 assume true; 16287#L9-1 assume !!(main_~i~0 < 100); 16286#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16285#L10-2 assume true; 16284#L9-1 assume !!(main_~i~0 < 100); 16283#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16282#L10-2 assume true; 16281#L9-1 assume !!(main_~i~0 < 100); 16280#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16279#L10-2 assume true; 16278#L9-1 assume !!(main_~i~0 < 100); 16277#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16276#L10-2 assume true; 16275#L9-1 assume !!(main_~i~0 < 100); 16274#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16273#L10-2 assume true; 16272#L9-1 assume !!(main_~i~0 < 100); 16271#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16270#L10-2 assume true; 16269#L9-1 assume !!(main_~i~0 < 100); 16268#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16267#L10-2 assume true; 16266#L9-1 assume !!(main_~i~0 < 100); 16265#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16264#L10-2 assume true; 16263#L9-1 assume !!(main_~i~0 < 100); 16262#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16261#L10-2 assume true; 16260#L9-1 assume !!(main_~i~0 < 100); 16259#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16258#L10-2 assume true; 16257#L9-1 assume !!(main_~i~0 < 100); 16256#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16255#L10-2 assume true; 16254#L9-1 assume !!(main_~i~0 < 100); 16253#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16252#L10-2 assume true; 16251#L9-1 assume !!(main_~i~0 < 100); 16250#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16249#L10-2 assume true; 16248#L9-1 assume !!(main_~i~0 < 100); 16247#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16246#L10-2 assume true; 16245#L9-1 assume !!(main_~i~0 < 100); 16244#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16243#L10-2 assume true; 16242#L9-1 assume !!(main_~i~0 < 100); 16241#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16240#L10-2 assume true; 16239#L9-1 assume !!(main_~i~0 < 100); 16238#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16237#L10-2 assume true; 16236#L9-1 assume !!(main_~i~0 < 100); 16235#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16234#L10-2 assume true; 16232#L9-1 assume !!(main_~i~0 < 100); 16233#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16231#L10-2 assume true; 16229#L9-1 assume !!(main_~i~0 < 100); 16230#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 16227#L10-2 assume true; 16228#L9-1 [2018-11-10 09:50:31,604 INFO L795 eck$LassoCheckResult]: Loop: 16228#L9-1 assume !!(main_~i~0 < 100); 16233#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16231#L10-2 assume true; 16229#L9-1 assume !!(main_~i~0 < 100); 16230#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 16227#L10-2 assume true; 16228#L9-1 [2018-11-10 09:50:31,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash 334480190, now seen corresponding path program 42 times [2018-11-10 09:50:31,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:31,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:31,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 43 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:32,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:32,069 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:32,077 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:32,104 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-11-10 09:50:32,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:32,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 43 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:32,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:32,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-11-10 09:50:32,134 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:32,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 39 times [2018-11-10 09:50:32,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:32,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:32,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:32,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 09:50:32,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 09:50:32,149 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. cyclomatic complexity: 3 Second operand 45 states. [2018-11-10 09:50:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:32,209 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-11-10 09:50:32,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 09:50:32,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 142 transitions. [2018-11-10 09:50:32,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:32,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 138 states and 140 transitions. [2018-11-10 09:50:32,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:32,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:32,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 140 transitions. [2018-11-10 09:50:32,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:32,210 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-11-10 09:50:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 140 transitions. [2018-11-10 09:50:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-10 09:50:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 09:50:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-11-10 09:50:32,211 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-11-10 09:50:32,211 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-11-10 09:50:32,211 INFO L442 BuchiCegarLoop]: ======== Iteration 45============ [2018-11-10 09:50:32,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 138 transitions. [2018-11-10 09:50:32,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:32,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:32,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:32,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [45, 44, 43, 1, 1, 1] [2018-11-10 09:50:32,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:32,213 INFO L793 eck$LassoCheckResult]: Stem: 16936#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 16933#L10-2 assume true; 16937#L9-1 assume !!(main_~i~0 < 100); 16934#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16935#L10-2 assume true; 16938#L9-1 assume !!(main_~i~0 < 100); 16939#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17067#L10-2 assume true; 17066#L9-1 assume !!(main_~i~0 < 100); 17065#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17064#L10-2 assume true; 17063#L9-1 assume !!(main_~i~0 < 100); 17062#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17061#L10-2 assume true; 17060#L9-1 assume !!(main_~i~0 < 100); 17059#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17058#L10-2 assume true; 17057#L9-1 assume !!(main_~i~0 < 100); 17056#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17055#L10-2 assume true; 17054#L9-1 assume !!(main_~i~0 < 100); 17053#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17052#L10-2 assume true; 17051#L9-1 assume !!(main_~i~0 < 100); 17050#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17049#L10-2 assume true; 17048#L9-1 assume !!(main_~i~0 < 100); 17047#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17046#L10-2 assume true; 17045#L9-1 assume !!(main_~i~0 < 100); 17044#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17043#L10-2 assume true; 17042#L9-1 assume !!(main_~i~0 < 100); 17041#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17040#L10-2 assume true; 17039#L9-1 assume !!(main_~i~0 < 100); 17038#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17037#L10-2 assume true; 17036#L9-1 assume !!(main_~i~0 < 100); 17035#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17034#L10-2 assume true; 17033#L9-1 assume !!(main_~i~0 < 100); 17032#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17031#L10-2 assume true; 17030#L9-1 assume !!(main_~i~0 < 100); 17029#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17028#L10-2 assume true; 17027#L9-1 assume !!(main_~i~0 < 100); 17026#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17025#L10-2 assume true; 17024#L9-1 assume !!(main_~i~0 < 100); 17023#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17022#L10-2 assume true; 17021#L9-1 assume !!(main_~i~0 < 100); 17020#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17019#L10-2 assume true; 17018#L9-1 assume !!(main_~i~0 < 100); 17017#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17016#L10-2 assume true; 17015#L9-1 assume !!(main_~i~0 < 100); 17014#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17013#L10-2 assume true; 17012#L9-1 assume !!(main_~i~0 < 100); 17011#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17010#L10-2 assume true; 17009#L9-1 assume !!(main_~i~0 < 100); 17008#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17007#L10-2 assume true; 17006#L9-1 assume !!(main_~i~0 < 100); 17005#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17004#L10-2 assume true; 17003#L9-1 assume !!(main_~i~0 < 100); 17002#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17001#L10-2 assume true; 17000#L9-1 assume !!(main_~i~0 < 100); 16999#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16998#L10-2 assume true; 16997#L9-1 assume !!(main_~i~0 < 100); 16996#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16995#L10-2 assume true; 16994#L9-1 assume !!(main_~i~0 < 100); 16993#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16992#L10-2 assume true; 16991#L9-1 assume !!(main_~i~0 < 100); 16990#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16989#L10-2 assume true; 16988#L9-1 assume !!(main_~i~0 < 100); 16987#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16986#L10-2 assume true; 16985#L9-1 assume !!(main_~i~0 < 100); 16984#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16983#L10-2 assume true; 16982#L9-1 assume !!(main_~i~0 < 100); 16981#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16980#L10-2 assume true; 16979#L9-1 assume !!(main_~i~0 < 100); 16978#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16977#L10-2 assume true; 16976#L9-1 assume !!(main_~i~0 < 100); 16975#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16974#L10-2 assume true; 16973#L9-1 assume !!(main_~i~0 < 100); 16972#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16971#L10-2 assume true; 16970#L9-1 assume !!(main_~i~0 < 100); 16969#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16968#L10-2 assume true; 16967#L9-1 assume !!(main_~i~0 < 100); 16966#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16965#L10-2 assume true; 16964#L9-1 assume !!(main_~i~0 < 100); 16963#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16962#L10-2 assume true; 16961#L9-1 assume !!(main_~i~0 < 100); 16960#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16959#L10-2 assume true; 16958#L9-1 assume !!(main_~i~0 < 100); 16957#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16956#L10-2 assume true; 16955#L9-1 assume !!(main_~i~0 < 100); 16954#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16953#L10-2 assume true; 16952#L9-1 assume !!(main_~i~0 < 100); 16951#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16950#L10-2 assume true; 16949#L9-1 assume !!(main_~i~0 < 100); 16948#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16947#L10-2 assume true; 16945#L9-1 assume !!(main_~i~0 < 100); 16946#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16944#L10-2 assume true; 16942#L9-1 assume !!(main_~i~0 < 100); 16943#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 16940#L10-2 assume true; 16941#L9-1 [2018-11-10 09:50:32,213 INFO L795 eck$LassoCheckResult]: Loop: 16941#L9-1 assume !!(main_~i~0 < 100); 16946#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 16944#L10-2 assume true; 16942#L9-1 assume !!(main_~i~0 < 100); 16943#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 16940#L10-2 assume true; 16941#L9-1 [2018-11-10 09:50:32,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 173378593, now seen corresponding path program 43 times [2018-11-10 09:50:32,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:32,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 44 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:32,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:32,726 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:32,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:32,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 44 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:32,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:32,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-11-10 09:50:32,793 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:32,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 40 times [2018-11-10 09:50:32,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:32,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:32,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:32,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:32,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-10 09:50:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 09:50:32,813 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. cyclomatic complexity: 3 Second operand 46 states. [2018-11-10 09:50:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:32,893 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-11-10 09:50:32,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-10 09:50:32,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 145 transitions. [2018-11-10 09:50:32,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:32,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 141 states and 143 transitions. [2018-11-10 09:50:32,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:32,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:32,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 143 transitions. [2018-11-10 09:50:32,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:32,894 INFO L705 BuchiCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-11-10 09:50:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 143 transitions. [2018-11-10 09:50:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-10 09:50:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 09:50:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-11-10 09:50:32,895 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-11-10 09:50:32,895 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-11-10 09:50:32,895 INFO L442 BuchiCegarLoop]: ======== Iteration 46============ [2018-11-10 09:50:32,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 141 transitions. [2018-11-10 09:50:32,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:32,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:32,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:32,897 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [46, 45, 44, 1, 1, 1] [2018-11-10 09:50:32,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:32,897 INFO L793 eck$LassoCheckResult]: Stem: 17666#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 17663#L10-2 assume true; 17667#L9-1 assume !!(main_~i~0 < 100); 17669#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17800#L10-2 assume true; 17670#L9-1 assume !!(main_~i~0 < 100); 17664#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17665#L10-2 assume true; 17668#L9-1 assume !!(main_~i~0 < 100); 17799#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17798#L10-2 assume true; 17797#L9-1 assume !!(main_~i~0 < 100); 17796#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17795#L10-2 assume true; 17794#L9-1 assume !!(main_~i~0 < 100); 17793#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17792#L10-2 assume true; 17791#L9-1 assume !!(main_~i~0 < 100); 17790#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17789#L10-2 assume true; 17788#L9-1 assume !!(main_~i~0 < 100); 17787#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17786#L10-2 assume true; 17785#L9-1 assume !!(main_~i~0 < 100); 17784#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17783#L10-2 assume true; 17782#L9-1 assume !!(main_~i~0 < 100); 17781#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17780#L10-2 assume true; 17779#L9-1 assume !!(main_~i~0 < 100); 17778#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17777#L10-2 assume true; 17776#L9-1 assume !!(main_~i~0 < 100); 17775#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17774#L10-2 assume true; 17773#L9-1 assume !!(main_~i~0 < 100); 17772#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17771#L10-2 assume true; 17770#L9-1 assume !!(main_~i~0 < 100); 17769#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17768#L10-2 assume true; 17767#L9-1 assume !!(main_~i~0 < 100); 17766#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17765#L10-2 assume true; 17764#L9-1 assume !!(main_~i~0 < 100); 17763#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17762#L10-2 assume true; 17761#L9-1 assume !!(main_~i~0 < 100); 17760#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17759#L10-2 assume true; 17758#L9-1 assume !!(main_~i~0 < 100); 17757#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17756#L10-2 assume true; 17755#L9-1 assume !!(main_~i~0 < 100); 17754#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17753#L10-2 assume true; 17752#L9-1 assume !!(main_~i~0 < 100); 17751#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17750#L10-2 assume true; 17749#L9-1 assume !!(main_~i~0 < 100); 17748#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17747#L10-2 assume true; 17746#L9-1 assume !!(main_~i~0 < 100); 17745#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17744#L10-2 assume true; 17743#L9-1 assume !!(main_~i~0 < 100); 17742#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17741#L10-2 assume true; 17740#L9-1 assume !!(main_~i~0 < 100); 17739#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17738#L10-2 assume true; 17737#L9-1 assume !!(main_~i~0 < 100); 17736#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17735#L10-2 assume true; 17734#L9-1 assume !!(main_~i~0 < 100); 17733#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17732#L10-2 assume true; 17731#L9-1 assume !!(main_~i~0 < 100); 17730#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17729#L10-2 assume true; 17728#L9-1 assume !!(main_~i~0 < 100); 17727#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17726#L10-2 assume true; 17725#L9-1 assume !!(main_~i~0 < 100); 17724#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17723#L10-2 assume true; 17722#L9-1 assume !!(main_~i~0 < 100); 17721#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17720#L10-2 assume true; 17719#L9-1 assume !!(main_~i~0 < 100); 17718#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17717#L10-2 assume true; 17716#L9-1 assume !!(main_~i~0 < 100); 17715#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17714#L10-2 assume true; 17713#L9-1 assume !!(main_~i~0 < 100); 17712#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17711#L10-2 assume true; 17710#L9-1 assume !!(main_~i~0 < 100); 17709#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17708#L10-2 assume true; 17707#L9-1 assume !!(main_~i~0 < 100); 17706#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17705#L10-2 assume true; 17704#L9-1 assume !!(main_~i~0 < 100); 17703#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17702#L10-2 assume true; 17701#L9-1 assume !!(main_~i~0 < 100); 17700#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17699#L10-2 assume true; 17698#L9-1 assume !!(main_~i~0 < 100); 17697#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17696#L10-2 assume true; 17695#L9-1 assume !!(main_~i~0 < 100); 17694#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17693#L10-2 assume true; 17692#L9-1 assume !!(main_~i~0 < 100); 17691#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17690#L10-2 assume true; 17689#L9-1 assume !!(main_~i~0 < 100); 17688#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17687#L10-2 assume true; 17686#L9-1 assume !!(main_~i~0 < 100); 17685#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17684#L10-2 assume true; 17683#L9-1 assume !!(main_~i~0 < 100); 17682#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17681#L10-2 assume true; 17680#L9-1 assume !!(main_~i~0 < 100); 17679#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17678#L10-2 assume true; 17676#L9-1 assume !!(main_~i~0 < 100); 17677#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17675#L10-2 assume true; 17673#L9-1 assume !!(main_~i~0 < 100); 17674#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 17671#L10-2 assume true; 17672#L9-1 [2018-11-10 09:50:32,897 INFO L795 eck$LassoCheckResult]: Loop: 17672#L9-1 assume !!(main_~i~0 < 100); 17677#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 17675#L10-2 assume true; 17673#L9-1 assume !!(main_~i~0 < 100); 17674#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 17671#L10-2 assume true; 17672#L9-1 [2018-11-10 09:50:32,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:32,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1725828002, now seen corresponding path program 44 times [2018-11-10 09:50:32,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:32,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:32,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:32,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 45 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:33,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:33,489 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:33,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:50:33,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:50:33,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:33,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 45 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:33,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:33,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-11-10 09:50:33,558 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:33,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:33,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 41 times [2018-11-10 09:50:33,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:33,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:33,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-10 09:50:33,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 09:50:33,601 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. cyclomatic complexity: 3 Second operand 47 states. [2018-11-10 09:50:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:33,688 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-11-10 09:50:33,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-10 09:50:33,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 148 transitions. [2018-11-10 09:50:33,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:33,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 144 states and 146 transitions. [2018-11-10 09:50:33,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:33,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:33,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 146 transitions. [2018-11-10 09:50:33,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:33,690 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-11-10 09:50:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 146 transitions. [2018-11-10 09:50:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-11-10 09:50:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-10 09:50:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-11-10 09:50:33,691 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-11-10 09:50:33,691 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-11-10 09:50:33,691 INFO L442 BuchiCegarLoop]: ======== Iteration 47============ [2018-11-10 09:50:33,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 144 transitions. [2018-11-10 09:50:33,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:33,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:33,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:33,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [47, 46, 45, 1, 1, 1] [2018-11-10 09:50:33,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:33,692 INFO L793 eck$LassoCheckResult]: Stem: 18412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 18409#L10-2 assume true; 18413#L9-1 assume !!(main_~i~0 < 100); 18415#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18549#L10-2 assume true; 18416#L9-1 assume !!(main_~i~0 < 100); 18410#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18411#L10-2 assume true; 18414#L9-1 assume !!(main_~i~0 < 100); 18548#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18547#L10-2 assume true; 18546#L9-1 assume !!(main_~i~0 < 100); 18545#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18544#L10-2 assume true; 18543#L9-1 assume !!(main_~i~0 < 100); 18542#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18541#L10-2 assume true; 18540#L9-1 assume !!(main_~i~0 < 100); 18539#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18538#L10-2 assume true; 18537#L9-1 assume !!(main_~i~0 < 100); 18536#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18535#L10-2 assume true; 18534#L9-1 assume !!(main_~i~0 < 100); 18533#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18532#L10-2 assume true; 18531#L9-1 assume !!(main_~i~0 < 100); 18530#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18529#L10-2 assume true; 18528#L9-1 assume !!(main_~i~0 < 100); 18527#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18526#L10-2 assume true; 18525#L9-1 assume !!(main_~i~0 < 100); 18524#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18523#L10-2 assume true; 18522#L9-1 assume !!(main_~i~0 < 100); 18521#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18520#L10-2 assume true; 18519#L9-1 assume !!(main_~i~0 < 100); 18518#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18517#L10-2 assume true; 18516#L9-1 assume !!(main_~i~0 < 100); 18515#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18514#L10-2 assume true; 18513#L9-1 assume !!(main_~i~0 < 100); 18512#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18511#L10-2 assume true; 18510#L9-1 assume !!(main_~i~0 < 100); 18509#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18508#L10-2 assume true; 18507#L9-1 assume !!(main_~i~0 < 100); 18506#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18505#L10-2 assume true; 18504#L9-1 assume !!(main_~i~0 < 100); 18503#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18502#L10-2 assume true; 18501#L9-1 assume !!(main_~i~0 < 100); 18500#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18499#L10-2 assume true; 18498#L9-1 assume !!(main_~i~0 < 100); 18497#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18496#L10-2 assume true; 18495#L9-1 assume !!(main_~i~0 < 100); 18494#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18493#L10-2 assume true; 18492#L9-1 assume !!(main_~i~0 < 100); 18491#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18490#L10-2 assume true; 18489#L9-1 assume !!(main_~i~0 < 100); 18488#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18487#L10-2 assume true; 18486#L9-1 assume !!(main_~i~0 < 100); 18485#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18484#L10-2 assume true; 18483#L9-1 assume !!(main_~i~0 < 100); 18482#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18481#L10-2 assume true; 18480#L9-1 assume !!(main_~i~0 < 100); 18479#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18478#L10-2 assume true; 18477#L9-1 assume !!(main_~i~0 < 100); 18476#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18475#L10-2 assume true; 18474#L9-1 assume !!(main_~i~0 < 100); 18473#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18472#L10-2 assume true; 18471#L9-1 assume !!(main_~i~0 < 100); 18470#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18469#L10-2 assume true; 18468#L9-1 assume !!(main_~i~0 < 100); 18467#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18466#L10-2 assume true; 18465#L9-1 assume !!(main_~i~0 < 100); 18464#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18463#L10-2 assume true; 18462#L9-1 assume !!(main_~i~0 < 100); 18461#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18460#L10-2 assume true; 18459#L9-1 assume !!(main_~i~0 < 100); 18458#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18457#L10-2 assume true; 18456#L9-1 assume !!(main_~i~0 < 100); 18455#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18454#L10-2 assume true; 18453#L9-1 assume !!(main_~i~0 < 100); 18452#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18451#L10-2 assume true; 18450#L9-1 assume !!(main_~i~0 < 100); 18449#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18448#L10-2 assume true; 18447#L9-1 assume !!(main_~i~0 < 100); 18446#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18445#L10-2 assume true; 18444#L9-1 assume !!(main_~i~0 < 100); 18443#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18442#L10-2 assume true; 18441#L9-1 assume !!(main_~i~0 < 100); 18440#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18439#L10-2 assume true; 18438#L9-1 assume !!(main_~i~0 < 100); 18437#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18436#L10-2 assume true; 18435#L9-1 assume !!(main_~i~0 < 100); 18434#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18433#L10-2 assume true; 18432#L9-1 assume !!(main_~i~0 < 100); 18431#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18430#L10-2 assume true; 18429#L9-1 assume !!(main_~i~0 < 100); 18428#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18427#L10-2 assume true; 18426#L9-1 assume !!(main_~i~0 < 100); 18425#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18424#L10-2 assume true; 18422#L9-1 assume !!(main_~i~0 < 100); 18423#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18421#L10-2 assume true; 18419#L9-1 assume !!(main_~i~0 < 100); 18420#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 18417#L10-2 assume true; 18418#L9-1 [2018-11-10 09:50:33,692 INFO L795 eck$LassoCheckResult]: Loop: 18418#L9-1 assume !!(main_~i~0 < 100); 18423#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 18421#L10-2 assume true; 18419#L9-1 assume !!(main_~i~0 < 100); 18420#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 18417#L10-2 assume true; 18418#L9-1 [2018-11-10 09:50:33,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash 909657857, now seen corresponding path program 45 times [2018-11-10 09:50:33,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:33,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:33,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:33,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 46 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:34,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:34,232 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:34,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:34,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-11-10 09:50:34,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:34,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 46 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:34,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-11-10 09:50:34,316 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:34,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 42 times [2018-11-10 09:50:34,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:34,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-10 09:50:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 09:50:34,337 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. cyclomatic complexity: 3 Second operand 48 states. [2018-11-10 09:50:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:34,412 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-11-10 09:50:34,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 09:50:34,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 151 transitions. [2018-11-10 09:50:34,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:34,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 147 states and 149 transitions. [2018-11-10 09:50:34,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:34,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:34,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 149 transitions. [2018-11-10 09:50:34,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:34,414 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-11-10 09:50:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 149 transitions. [2018-11-10 09:50:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-10 09:50:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 09:50:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-11-10 09:50:34,415 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-11-10 09:50:34,415 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-11-10 09:50:34,415 INFO L442 BuchiCegarLoop]: ======== Iteration 48============ [2018-11-10 09:50:34,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 147 transitions. [2018-11-10 09:50:34,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:34,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:34,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:34,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [48, 47, 46, 1, 1, 1] [2018-11-10 09:50:34,417 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:34,417 INFO L793 eck$LassoCheckResult]: Stem: 19174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 19170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 19171#L10-2 assume true; 19175#L9-1 assume !!(main_~i~0 < 100); 19172#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19173#L10-2 assume true; 19176#L9-1 assume !!(main_~i~0 < 100); 19177#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19314#L10-2 assume true; 19313#L9-1 assume !!(main_~i~0 < 100); 19312#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19311#L10-2 assume true; 19310#L9-1 assume !!(main_~i~0 < 100); 19309#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19308#L10-2 assume true; 19307#L9-1 assume !!(main_~i~0 < 100); 19306#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19305#L10-2 assume true; 19304#L9-1 assume !!(main_~i~0 < 100); 19303#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19302#L10-2 assume true; 19301#L9-1 assume !!(main_~i~0 < 100); 19300#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19299#L10-2 assume true; 19298#L9-1 assume !!(main_~i~0 < 100); 19297#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19296#L10-2 assume true; 19295#L9-1 assume !!(main_~i~0 < 100); 19294#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19293#L10-2 assume true; 19292#L9-1 assume !!(main_~i~0 < 100); 19291#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19290#L10-2 assume true; 19289#L9-1 assume !!(main_~i~0 < 100); 19288#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19287#L10-2 assume true; 19286#L9-1 assume !!(main_~i~0 < 100); 19285#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19284#L10-2 assume true; 19283#L9-1 assume !!(main_~i~0 < 100); 19282#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19281#L10-2 assume true; 19280#L9-1 assume !!(main_~i~0 < 100); 19279#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19278#L10-2 assume true; 19277#L9-1 assume !!(main_~i~0 < 100); 19276#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19275#L10-2 assume true; 19274#L9-1 assume !!(main_~i~0 < 100); 19273#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19272#L10-2 assume true; 19271#L9-1 assume !!(main_~i~0 < 100); 19270#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19269#L10-2 assume true; 19268#L9-1 assume !!(main_~i~0 < 100); 19267#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19266#L10-2 assume true; 19265#L9-1 assume !!(main_~i~0 < 100); 19264#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19263#L10-2 assume true; 19262#L9-1 assume !!(main_~i~0 < 100); 19261#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19260#L10-2 assume true; 19259#L9-1 assume !!(main_~i~0 < 100); 19258#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19257#L10-2 assume true; 19256#L9-1 assume !!(main_~i~0 < 100); 19255#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19254#L10-2 assume true; 19253#L9-1 assume !!(main_~i~0 < 100); 19252#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19251#L10-2 assume true; 19250#L9-1 assume !!(main_~i~0 < 100); 19249#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19248#L10-2 assume true; 19247#L9-1 assume !!(main_~i~0 < 100); 19246#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19245#L10-2 assume true; 19244#L9-1 assume !!(main_~i~0 < 100); 19243#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19242#L10-2 assume true; 19241#L9-1 assume !!(main_~i~0 < 100); 19240#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19239#L10-2 assume true; 19238#L9-1 assume !!(main_~i~0 < 100); 19237#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19236#L10-2 assume true; 19235#L9-1 assume !!(main_~i~0 < 100); 19234#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19233#L10-2 assume true; 19232#L9-1 assume !!(main_~i~0 < 100); 19231#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19230#L10-2 assume true; 19229#L9-1 assume !!(main_~i~0 < 100); 19228#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19227#L10-2 assume true; 19226#L9-1 assume !!(main_~i~0 < 100); 19225#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19224#L10-2 assume true; 19223#L9-1 assume !!(main_~i~0 < 100); 19222#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19221#L10-2 assume true; 19220#L9-1 assume !!(main_~i~0 < 100); 19219#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19218#L10-2 assume true; 19217#L9-1 assume !!(main_~i~0 < 100); 19216#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19215#L10-2 assume true; 19214#L9-1 assume !!(main_~i~0 < 100); 19213#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19212#L10-2 assume true; 19211#L9-1 assume !!(main_~i~0 < 100); 19210#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19209#L10-2 assume true; 19208#L9-1 assume !!(main_~i~0 < 100); 19207#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19206#L10-2 assume true; 19205#L9-1 assume !!(main_~i~0 < 100); 19204#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19203#L10-2 assume true; 19202#L9-1 assume !!(main_~i~0 < 100); 19201#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19200#L10-2 assume true; 19199#L9-1 assume !!(main_~i~0 < 100); 19198#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19197#L10-2 assume true; 19196#L9-1 assume !!(main_~i~0 < 100); 19195#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19194#L10-2 assume true; 19193#L9-1 assume !!(main_~i~0 < 100); 19192#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19191#L10-2 assume true; 19190#L9-1 assume !!(main_~i~0 < 100); 19189#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19188#L10-2 assume true; 19187#L9-1 assume !!(main_~i~0 < 100); 19186#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19185#L10-2 assume true; 19183#L9-1 assume !!(main_~i~0 < 100); 19184#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19182#L10-2 assume true; 19180#L9-1 assume !!(main_~i~0 < 100); 19181#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 19178#L10-2 assume true; 19179#L9-1 [2018-11-10 09:50:34,417 INFO L795 eck$LassoCheckResult]: Loop: 19179#L9-1 assume !!(main_~i~0 < 100); 19184#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19182#L10-2 assume true; 19180#L9-1 assume !!(main_~i~0 < 100); 19181#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 19178#L10-2 assume true; 19179#L9-1 [2018-11-10 09:50:34,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:34,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1628254850, now seen corresponding path program 46 times [2018-11-10 09:50:34,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:34,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:34,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:34,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:34,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 47 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:35,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:35,003 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:35,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:50:35,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:50:35,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:35,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 47 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:35,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:35,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-11-10 09:50:35,071 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:35,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 43 times [2018-11-10 09:50:35,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:35,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:35,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-10 09:50:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 09:50:35,096 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. cyclomatic complexity: 3 Second operand 49 states. [2018-11-10 09:50:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:35,178 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-11-10 09:50:35,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-10 09:50:35,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 154 transitions. [2018-11-10 09:50:35,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:35,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 150 states and 152 transitions. [2018-11-10 09:50:35,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:35,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:35,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 152 transitions. [2018-11-10 09:50:35,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:35,180 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-11-10 09:50:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 152 transitions. [2018-11-10 09:50:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-10 09:50:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-10 09:50:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-11-10 09:50:35,182 INFO L728 BuchiCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-11-10 09:50:35,182 INFO L608 BuchiCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-11-10 09:50:35,182 INFO L442 BuchiCegarLoop]: ======== Iteration 49============ [2018-11-10 09:50:35,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 150 transitions. [2018-11-10 09:50:35,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:35,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:35,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:35,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [49, 48, 47, 1, 1, 1] [2018-11-10 09:50:35,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:35,184 INFO L793 eck$LassoCheckResult]: Stem: 19952#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 19948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 19949#L10-2 assume true; 19953#L9-1 assume !!(main_~i~0 < 100); 19955#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20095#L10-2 assume true; 19956#L9-1 assume !!(main_~i~0 < 100); 19950#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19951#L10-2 assume true; 19954#L9-1 assume !!(main_~i~0 < 100); 20094#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20093#L10-2 assume true; 20092#L9-1 assume !!(main_~i~0 < 100); 20091#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20090#L10-2 assume true; 20089#L9-1 assume !!(main_~i~0 < 100); 20088#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20087#L10-2 assume true; 20086#L9-1 assume !!(main_~i~0 < 100); 20085#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20084#L10-2 assume true; 20083#L9-1 assume !!(main_~i~0 < 100); 20082#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20081#L10-2 assume true; 20080#L9-1 assume !!(main_~i~0 < 100); 20079#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20078#L10-2 assume true; 20077#L9-1 assume !!(main_~i~0 < 100); 20076#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20075#L10-2 assume true; 20074#L9-1 assume !!(main_~i~0 < 100); 20073#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20072#L10-2 assume true; 20071#L9-1 assume !!(main_~i~0 < 100); 20070#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20069#L10-2 assume true; 20068#L9-1 assume !!(main_~i~0 < 100); 20067#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20066#L10-2 assume true; 20065#L9-1 assume !!(main_~i~0 < 100); 20064#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20063#L10-2 assume true; 20062#L9-1 assume !!(main_~i~0 < 100); 20061#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20060#L10-2 assume true; 20059#L9-1 assume !!(main_~i~0 < 100); 20058#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20057#L10-2 assume true; 20056#L9-1 assume !!(main_~i~0 < 100); 20055#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20054#L10-2 assume true; 20053#L9-1 assume !!(main_~i~0 < 100); 20052#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20051#L10-2 assume true; 20050#L9-1 assume !!(main_~i~0 < 100); 20049#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20048#L10-2 assume true; 20047#L9-1 assume !!(main_~i~0 < 100); 20046#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20045#L10-2 assume true; 20044#L9-1 assume !!(main_~i~0 < 100); 20043#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20042#L10-2 assume true; 20041#L9-1 assume !!(main_~i~0 < 100); 20040#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20039#L10-2 assume true; 20038#L9-1 assume !!(main_~i~0 < 100); 20037#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20036#L10-2 assume true; 20035#L9-1 assume !!(main_~i~0 < 100); 20034#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20033#L10-2 assume true; 20032#L9-1 assume !!(main_~i~0 < 100); 20031#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20030#L10-2 assume true; 20029#L9-1 assume !!(main_~i~0 < 100); 20028#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20027#L10-2 assume true; 20026#L9-1 assume !!(main_~i~0 < 100); 20025#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20024#L10-2 assume true; 20023#L9-1 assume !!(main_~i~0 < 100); 20022#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20021#L10-2 assume true; 20020#L9-1 assume !!(main_~i~0 < 100); 20019#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20018#L10-2 assume true; 20017#L9-1 assume !!(main_~i~0 < 100); 20016#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20015#L10-2 assume true; 20014#L9-1 assume !!(main_~i~0 < 100); 20013#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20012#L10-2 assume true; 20011#L9-1 assume !!(main_~i~0 < 100); 20010#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20009#L10-2 assume true; 20008#L9-1 assume !!(main_~i~0 < 100); 20007#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20006#L10-2 assume true; 20005#L9-1 assume !!(main_~i~0 < 100); 20004#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20003#L10-2 assume true; 20002#L9-1 assume !!(main_~i~0 < 100); 20001#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20000#L10-2 assume true; 19999#L9-1 assume !!(main_~i~0 < 100); 19998#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19997#L10-2 assume true; 19996#L9-1 assume !!(main_~i~0 < 100); 19995#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19994#L10-2 assume true; 19993#L9-1 assume !!(main_~i~0 < 100); 19992#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19991#L10-2 assume true; 19990#L9-1 assume !!(main_~i~0 < 100); 19989#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19988#L10-2 assume true; 19987#L9-1 assume !!(main_~i~0 < 100); 19986#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19985#L10-2 assume true; 19984#L9-1 assume !!(main_~i~0 < 100); 19983#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19982#L10-2 assume true; 19981#L9-1 assume !!(main_~i~0 < 100); 19980#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19979#L10-2 assume true; 19978#L9-1 assume !!(main_~i~0 < 100); 19977#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19976#L10-2 assume true; 19975#L9-1 assume !!(main_~i~0 < 100); 19974#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19973#L10-2 assume true; 19972#L9-1 assume !!(main_~i~0 < 100); 19971#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19970#L10-2 assume true; 19969#L9-1 assume !!(main_~i~0 < 100); 19968#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19967#L10-2 assume true; 19966#L9-1 assume !!(main_~i~0 < 100); 19965#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19964#L10-2 assume true; 19962#L9-1 assume !!(main_~i~0 < 100); 19963#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19961#L10-2 assume true; 19959#L9-1 assume !!(main_~i~0 < 100); 19960#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 19957#L10-2 assume true; 19958#L9-1 [2018-11-10 09:50:35,184 INFO L795 eck$LassoCheckResult]: Loop: 19958#L9-1 assume !!(main_~i~0 < 100); 19963#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 19961#L10-2 assume true; 19959#L9-1 assume !!(main_~i~0 < 100); 19960#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 19957#L10-2 assume true; 19958#L9-1 [2018-11-10 09:50:35,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash 18569697, now seen corresponding path program 47 times [2018-11-10 09:50:35,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:35,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:35,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 48 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:35,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:35,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:35,822 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:50:35,862 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-11-10 09:50:35,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:35,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 48 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:35,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:35,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-11-10 09:50:35,904 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:35,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 44 times [2018-11-10 09:50:35,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:35,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:35,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:35,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-10 09:50:35,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 09:50:35,928 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. cyclomatic complexity: 3 Second operand 50 states. [2018-11-10 09:50:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:36,022 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-11-10 09:50:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 09:50:36,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 157 transitions. [2018-11-10 09:50:36,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:36,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 153 states and 155 transitions. [2018-11-10 09:50:36,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:36,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:36,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 155 transitions. [2018-11-10 09:50:36,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:36,023 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-11-10 09:50:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 155 transitions. [2018-11-10 09:50:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-10 09:50:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 09:50:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-11-10 09:50:36,025 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-11-10 09:50:36,025 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-11-10 09:50:36,025 INFO L442 BuchiCegarLoop]: ======== Iteration 50============ [2018-11-10 09:50:36,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 153 transitions. [2018-11-10 09:50:36,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:36,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:36,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:36,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [50, 49, 48, 1, 1, 1] [2018-11-10 09:50:36,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:36,027 INFO L793 eck$LassoCheckResult]: Stem: 20746#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20742#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 20743#L10-2 assume true; 20747#L9-1 assume !!(main_~i~0 < 100); 20748#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20892#L10-2 assume true; 20749#L9-1 assume !!(main_~i~0 < 100); 20744#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20745#L10-2 assume true; 20750#L9-1 assume !!(main_~i~0 < 100); 20891#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20890#L10-2 assume true; 20889#L9-1 assume !!(main_~i~0 < 100); 20888#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20887#L10-2 assume true; 20886#L9-1 assume !!(main_~i~0 < 100); 20885#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20884#L10-2 assume true; 20883#L9-1 assume !!(main_~i~0 < 100); 20882#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20881#L10-2 assume true; 20880#L9-1 assume !!(main_~i~0 < 100); 20879#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20878#L10-2 assume true; 20877#L9-1 assume !!(main_~i~0 < 100); 20876#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20875#L10-2 assume true; 20874#L9-1 assume !!(main_~i~0 < 100); 20873#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20872#L10-2 assume true; 20871#L9-1 assume !!(main_~i~0 < 100); 20870#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20869#L10-2 assume true; 20868#L9-1 assume !!(main_~i~0 < 100); 20867#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20866#L10-2 assume true; 20865#L9-1 assume !!(main_~i~0 < 100); 20864#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20863#L10-2 assume true; 20862#L9-1 assume !!(main_~i~0 < 100); 20861#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20860#L10-2 assume true; 20859#L9-1 assume !!(main_~i~0 < 100); 20858#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20857#L10-2 assume true; 20856#L9-1 assume !!(main_~i~0 < 100); 20855#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20854#L10-2 assume true; 20853#L9-1 assume !!(main_~i~0 < 100); 20852#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20851#L10-2 assume true; 20850#L9-1 assume !!(main_~i~0 < 100); 20849#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20848#L10-2 assume true; 20847#L9-1 assume !!(main_~i~0 < 100); 20846#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20845#L10-2 assume true; 20844#L9-1 assume !!(main_~i~0 < 100); 20843#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20842#L10-2 assume true; 20841#L9-1 assume !!(main_~i~0 < 100); 20840#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20839#L10-2 assume true; 20838#L9-1 assume !!(main_~i~0 < 100); 20837#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20836#L10-2 assume true; 20835#L9-1 assume !!(main_~i~0 < 100); 20834#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20833#L10-2 assume true; 20832#L9-1 assume !!(main_~i~0 < 100); 20831#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20830#L10-2 assume true; 20829#L9-1 assume !!(main_~i~0 < 100); 20828#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20827#L10-2 assume true; 20826#L9-1 assume !!(main_~i~0 < 100); 20825#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20824#L10-2 assume true; 20823#L9-1 assume !!(main_~i~0 < 100); 20822#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20821#L10-2 assume true; 20820#L9-1 assume !!(main_~i~0 < 100); 20819#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20818#L10-2 assume true; 20817#L9-1 assume !!(main_~i~0 < 100); 20816#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20815#L10-2 assume true; 20814#L9-1 assume !!(main_~i~0 < 100); 20813#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20812#L10-2 assume true; 20811#L9-1 assume !!(main_~i~0 < 100); 20810#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20809#L10-2 assume true; 20808#L9-1 assume !!(main_~i~0 < 100); 20807#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20806#L10-2 assume true; 20805#L9-1 assume !!(main_~i~0 < 100); 20804#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20803#L10-2 assume true; 20802#L9-1 assume !!(main_~i~0 < 100); 20801#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20800#L10-2 assume true; 20799#L9-1 assume !!(main_~i~0 < 100); 20798#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20797#L10-2 assume true; 20796#L9-1 assume !!(main_~i~0 < 100); 20795#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20794#L10-2 assume true; 20793#L9-1 assume !!(main_~i~0 < 100); 20792#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20791#L10-2 assume true; 20790#L9-1 assume !!(main_~i~0 < 100); 20789#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20788#L10-2 assume true; 20787#L9-1 assume !!(main_~i~0 < 100); 20786#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20785#L10-2 assume true; 20784#L9-1 assume !!(main_~i~0 < 100); 20783#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20782#L10-2 assume true; 20781#L9-1 assume !!(main_~i~0 < 100); 20780#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20779#L10-2 assume true; 20778#L9-1 assume !!(main_~i~0 < 100); 20777#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20776#L10-2 assume true; 20775#L9-1 assume !!(main_~i~0 < 100); 20774#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20773#L10-2 assume true; 20772#L9-1 assume !!(main_~i~0 < 100); 20771#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20770#L10-2 assume true; 20769#L9-1 assume !!(main_~i~0 < 100); 20768#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20767#L10-2 assume true; 20766#L9-1 assume !!(main_~i~0 < 100); 20765#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20764#L10-2 assume true; 20763#L9-1 assume !!(main_~i~0 < 100); 20762#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20761#L10-2 assume true; 20760#L9-1 assume !!(main_~i~0 < 100); 20759#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20758#L10-2 assume true; 20756#L9-1 assume !!(main_~i~0 < 100); 20757#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20755#L10-2 assume true; 20753#L9-1 assume !!(main_~i~0 < 100); 20754#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 20751#L10-2 assume true; 20752#L9-1 [2018-11-10 09:50:36,027 INFO L795 eck$LassoCheckResult]: Loop: 20752#L9-1 assume !!(main_~i~0 < 100); 20757#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 20755#L10-2 assume true; 20753#L9-1 assume !!(main_~i~0 < 100); 20754#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 20751#L10-2 assume true; 20752#L9-1 [2018-11-10 09:50:36,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash -842772834, now seen corresponding path program 48 times [2018-11-10 09:50:36,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:36,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:36,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:36,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 49 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:36,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:36,649 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:36,656 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:50:36,689 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-11-10 09:50:36,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:36,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 49 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:36,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:36,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-11-10 09:50:36,732 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:36,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 45 times [2018-11-10 09:50:36,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:36,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:36,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-10 09:50:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 09:50:36,753 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. cyclomatic complexity: 3 Second operand 51 states. [2018-11-10 09:50:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:36,855 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-11-10 09:50:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-10 09:50:36,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 160 transitions. [2018-11-10 09:50:36,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:36,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 156 states and 158 transitions. [2018-11-10 09:50:36,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:36,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:36,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 158 transitions. [2018-11-10 09:50:36,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:36,857 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-11-10 09:50:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 158 transitions. [2018-11-10 09:50:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-11-10 09:50:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 09:50:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-11-10 09:50:36,867 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-11-10 09:50:36,867 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-11-10 09:50:36,867 INFO L442 BuchiCegarLoop]: ======== Iteration 51============ [2018-11-10 09:50:36,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 156 transitions. [2018-11-10 09:50:36,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:36,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:36,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:36,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [51, 50, 49, 1, 1, 1] [2018-11-10 09:50:36,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:36,869 INFO L793 eck$LassoCheckResult]: Stem: 21556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 21552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 21553#L10-2 assume true; 21557#L9-1 assume !!(main_~i~0 < 100); 21559#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21705#L10-2 assume true; 21560#L9-1 assume !!(main_~i~0 < 100); 21554#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21555#L10-2 assume true; 21558#L9-1 assume !!(main_~i~0 < 100); 21704#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21703#L10-2 assume true; 21702#L9-1 assume !!(main_~i~0 < 100); 21701#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21700#L10-2 assume true; 21699#L9-1 assume !!(main_~i~0 < 100); 21698#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21697#L10-2 assume true; 21696#L9-1 assume !!(main_~i~0 < 100); 21695#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21694#L10-2 assume true; 21693#L9-1 assume !!(main_~i~0 < 100); 21692#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21691#L10-2 assume true; 21690#L9-1 assume !!(main_~i~0 < 100); 21689#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21688#L10-2 assume true; 21687#L9-1 assume !!(main_~i~0 < 100); 21686#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21685#L10-2 assume true; 21684#L9-1 assume !!(main_~i~0 < 100); 21683#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21682#L10-2 assume true; 21681#L9-1 assume !!(main_~i~0 < 100); 21680#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21679#L10-2 assume true; 21678#L9-1 assume !!(main_~i~0 < 100); 21677#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21676#L10-2 assume true; 21675#L9-1 assume !!(main_~i~0 < 100); 21674#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21673#L10-2 assume true; 21672#L9-1 assume !!(main_~i~0 < 100); 21671#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21670#L10-2 assume true; 21669#L9-1 assume !!(main_~i~0 < 100); 21668#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21667#L10-2 assume true; 21666#L9-1 assume !!(main_~i~0 < 100); 21665#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21664#L10-2 assume true; 21663#L9-1 assume !!(main_~i~0 < 100); 21662#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21661#L10-2 assume true; 21660#L9-1 assume !!(main_~i~0 < 100); 21659#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21658#L10-2 assume true; 21657#L9-1 assume !!(main_~i~0 < 100); 21656#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21655#L10-2 assume true; 21654#L9-1 assume !!(main_~i~0 < 100); 21653#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21652#L10-2 assume true; 21651#L9-1 assume !!(main_~i~0 < 100); 21650#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21649#L10-2 assume true; 21648#L9-1 assume !!(main_~i~0 < 100); 21647#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21646#L10-2 assume true; 21645#L9-1 assume !!(main_~i~0 < 100); 21644#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21643#L10-2 assume true; 21642#L9-1 assume !!(main_~i~0 < 100); 21641#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21640#L10-2 assume true; 21639#L9-1 assume !!(main_~i~0 < 100); 21638#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21637#L10-2 assume true; 21636#L9-1 assume !!(main_~i~0 < 100); 21635#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21634#L10-2 assume true; 21633#L9-1 assume !!(main_~i~0 < 100); 21632#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21631#L10-2 assume true; 21630#L9-1 assume !!(main_~i~0 < 100); 21629#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21628#L10-2 assume true; 21627#L9-1 assume !!(main_~i~0 < 100); 21626#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21625#L10-2 assume true; 21624#L9-1 assume !!(main_~i~0 < 100); 21623#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21622#L10-2 assume true; 21621#L9-1 assume !!(main_~i~0 < 100); 21620#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21619#L10-2 assume true; 21618#L9-1 assume !!(main_~i~0 < 100); 21617#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21616#L10-2 assume true; 21615#L9-1 assume !!(main_~i~0 < 100); 21614#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21613#L10-2 assume true; 21612#L9-1 assume !!(main_~i~0 < 100); 21611#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21610#L10-2 assume true; 21609#L9-1 assume !!(main_~i~0 < 100); 21608#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21607#L10-2 assume true; 21606#L9-1 assume !!(main_~i~0 < 100); 21605#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21604#L10-2 assume true; 21603#L9-1 assume !!(main_~i~0 < 100); 21602#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21601#L10-2 assume true; 21600#L9-1 assume !!(main_~i~0 < 100); 21599#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21598#L10-2 assume true; 21597#L9-1 assume !!(main_~i~0 < 100); 21596#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21595#L10-2 assume true; 21594#L9-1 assume !!(main_~i~0 < 100); 21593#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21592#L10-2 assume true; 21591#L9-1 assume !!(main_~i~0 < 100); 21590#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21589#L10-2 assume true; 21588#L9-1 assume !!(main_~i~0 < 100); 21587#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21586#L10-2 assume true; 21585#L9-1 assume !!(main_~i~0 < 100); 21584#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21583#L10-2 assume true; 21582#L9-1 assume !!(main_~i~0 < 100); 21581#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21580#L10-2 assume true; 21579#L9-1 assume !!(main_~i~0 < 100); 21578#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21577#L10-2 assume true; 21576#L9-1 assume !!(main_~i~0 < 100); 21575#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21574#L10-2 assume true; 21573#L9-1 assume !!(main_~i~0 < 100); 21572#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21571#L10-2 assume true; 21570#L9-1 assume !!(main_~i~0 < 100); 21569#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21568#L10-2 assume true; 21566#L9-1 assume !!(main_~i~0 < 100); 21567#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21565#L10-2 assume true; 21563#L9-1 assume !!(main_~i~0 < 100); 21564#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 21561#L10-2 assume true; 21562#L9-1 [2018-11-10 09:50:36,869 INFO L795 eck$LassoCheckResult]: Loop: 21562#L9-1 assume !!(main_~i~0 < 100); 21567#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 21565#L10-2 assume true; 21563#L9-1 assume !!(main_~i~0 < 100); 21564#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 21561#L10-2 assume true; 21562#L9-1 [2018-11-10 09:50:36,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:36,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1331479745, now seen corresponding path program 49 times [2018-11-10 09:50:36,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:36,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 50 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:37,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:37,569 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/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-10 09:50:37,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:37,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 50 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:37,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:50:37,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-11-10 09:50:37,626 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:50:37,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:37,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 46 times [2018-11-10 09:50:37,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:37,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:37,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-10 09:50:37,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 09:50:37,650 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. cyclomatic complexity: 3 Second operand 52 states. [2018-11-10 09:50:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:37,746 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-11-10 09:50:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-10 09:50:37,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 163 transitions. [2018-11-10 09:50:37,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:37,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 159 states and 161 transitions. [2018-11-10 09:50:37,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 09:50:37,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 09:50:37,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 161 transitions. [2018-11-10 09:50:37,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:50:37,747 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 161 transitions. [2018-11-10 09:50:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 161 transitions. [2018-11-10 09:50:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-11-10 09:50:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 09:50:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-11-10 09:50:37,749 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-11-10 09:50:37,749 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-11-10 09:50:37,749 INFO L442 BuchiCegarLoop]: ======== Iteration 52============ [2018-11-10 09:50:37,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 159 transitions. [2018-11-10 09:50:37,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:50:37,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:50:37,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:50:37,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [52, 51, 50, 1, 1, 1] [2018-11-10 09:50:37,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 09:50:37,751 INFO L793 eck$LassoCheckResult]: Stem: 22382#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 22379#L10-2 assume true; 22383#L9-1 assume !!(main_~i~0 < 100); 22385#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22534#L10-2 assume true; 22386#L9-1 assume !!(main_~i~0 < 100); 22380#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22381#L10-2 assume true; 22384#L9-1 assume !!(main_~i~0 < 100); 22533#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22532#L10-2 assume true; 22531#L9-1 assume !!(main_~i~0 < 100); 22530#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22529#L10-2 assume true; 22528#L9-1 assume !!(main_~i~0 < 100); 22527#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22526#L10-2 assume true; 22525#L9-1 assume !!(main_~i~0 < 100); 22524#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22523#L10-2 assume true; 22522#L9-1 assume !!(main_~i~0 < 100); 22521#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22520#L10-2 assume true; 22519#L9-1 assume !!(main_~i~0 < 100); 22518#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22517#L10-2 assume true; 22516#L9-1 assume !!(main_~i~0 < 100); 22515#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22514#L10-2 assume true; 22513#L9-1 assume !!(main_~i~0 < 100); 22512#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22511#L10-2 assume true; 22510#L9-1 assume !!(main_~i~0 < 100); 22509#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22508#L10-2 assume true; 22507#L9-1 assume !!(main_~i~0 < 100); 22506#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22505#L10-2 assume true; 22504#L9-1 assume !!(main_~i~0 < 100); 22503#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22502#L10-2 assume true; 22501#L9-1 assume !!(main_~i~0 < 100); 22500#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22499#L10-2 assume true; 22498#L9-1 assume !!(main_~i~0 < 100); 22497#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22496#L10-2 assume true; 22495#L9-1 assume !!(main_~i~0 < 100); 22494#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22493#L10-2 assume true; 22492#L9-1 assume !!(main_~i~0 < 100); 22491#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22490#L10-2 assume true; 22489#L9-1 assume !!(main_~i~0 < 100); 22488#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22487#L10-2 assume true; 22486#L9-1 assume !!(main_~i~0 < 100); 22485#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22484#L10-2 assume true; 22483#L9-1 assume !!(main_~i~0 < 100); 22482#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22481#L10-2 assume true; 22480#L9-1 assume !!(main_~i~0 < 100); 22479#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22478#L10-2 assume true; 22477#L9-1 assume !!(main_~i~0 < 100); 22476#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22475#L10-2 assume true; 22474#L9-1 assume !!(main_~i~0 < 100); 22473#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22472#L10-2 assume true; 22471#L9-1 assume !!(main_~i~0 < 100); 22470#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22469#L10-2 assume true; 22468#L9-1 assume !!(main_~i~0 < 100); 22467#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22466#L10-2 assume true; 22465#L9-1 assume !!(main_~i~0 < 100); 22464#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22463#L10-2 assume true; 22462#L9-1 assume !!(main_~i~0 < 100); 22461#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22460#L10-2 assume true; 22459#L9-1 assume !!(main_~i~0 < 100); 22458#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22457#L10-2 assume true; 22456#L9-1 assume !!(main_~i~0 < 100); 22455#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22454#L10-2 assume true; 22453#L9-1 assume !!(main_~i~0 < 100); 22452#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22451#L10-2 assume true; 22450#L9-1 assume !!(main_~i~0 < 100); 22449#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22448#L10-2 assume true; 22447#L9-1 assume !!(main_~i~0 < 100); 22446#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22445#L10-2 assume true; 22444#L9-1 assume !!(main_~i~0 < 100); 22443#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22442#L10-2 assume true; 22441#L9-1 assume !!(main_~i~0 < 100); 22440#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22439#L10-2 assume true; 22438#L9-1 assume !!(main_~i~0 < 100); 22437#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22436#L10-2 assume true; 22435#L9-1 assume !!(main_~i~0 < 100); 22434#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22433#L10-2 assume true; 22432#L9-1 assume !!(main_~i~0 < 100); 22431#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22430#L10-2 assume true; 22429#L9-1 assume !!(main_~i~0 < 100); 22428#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22427#L10-2 assume true; 22426#L9-1 assume !!(main_~i~0 < 100); 22425#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22424#L10-2 assume true; 22423#L9-1 assume !!(main_~i~0 < 100); 22422#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22421#L10-2 assume true; 22420#L9-1 assume !!(main_~i~0 < 100); 22419#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22418#L10-2 assume true; 22417#L9-1 assume !!(main_~i~0 < 100); 22416#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22415#L10-2 assume true; 22414#L9-1 assume !!(main_~i~0 < 100); 22413#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22412#L10-2 assume true; 22411#L9-1 assume !!(main_~i~0 < 100); 22410#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22409#L10-2 assume true; 22408#L9-1 assume !!(main_~i~0 < 100); 22407#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22406#L10-2 assume true; 22405#L9-1 assume !!(main_~i~0 < 100); 22404#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22403#L10-2 assume true; 22402#L9-1 assume !!(main_~i~0 < 100); 22401#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22400#L10-2 assume true; 22399#L9-1 assume !!(main_~i~0 < 100); 22398#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22397#L10-2 assume true; 22396#L9-1 assume !!(main_~i~0 < 100); 22395#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22394#L10-2 assume true; 22392#L9-1 assume !!(main_~i~0 < 100); 22393#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22391#L10-2 assume true; 22389#L9-1 assume !!(main_~i~0 < 100); 22390#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 22387#L10-2 assume true; 22388#L9-1 [2018-11-10 09:50:37,751 INFO L795 eck$LassoCheckResult]: Loop: 22388#L9-1 assume !!(main_~i~0 < 100); 22393#L10 assume main_~i~0 < 50;main_~i~0 := main_~i~0 + 1; 22391#L10-2 assume true; 22389#L9-1 assume !!(main_~i~0 < 100); 22390#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 22387#L10-2 assume true; 22388#L9-1 [2018-11-10 09:50:37,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2088269758, now seen corresponding path program 50 times [2018-11-10 09:50:37,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:37,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:37,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 47 times [2018-11-10 09:50:37,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:37,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:37,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:37,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1607228772, now seen corresponding path program 51 times [2018-11-10 09:50:37,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:50:37,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:50:37,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:37,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:50:38,448 WARN L179 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 161 [2018-11-10 09:50:38,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:50:38 BoogieIcfgContainer [2018-11-10 09:50:38,468 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:50:38,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:50:38,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:50:38,469 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:50:38,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:16" (3/4) ... [2018-11-10 09:50:38,472 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 09:50:38,513 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_191fc2fc-27c6-4319-a98b-1bc3d8d57e47/bin-2019/uautomizer/witness.graphml [2018-11-10 09:50:38,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:50:38,514 INFO L168 Benchmark]: Toolchain (without parser) took 22064.52 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 553.6 MB). Free memory was 959.7 MB in the beginning and 1.2 GB in the end (delta: -241.0 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:50:38,515 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:50:38,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:50:38,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.67 ms. Allocated memory is still 1.0 GB. Free memory is still 948.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:50:38,515 INFO L168 Benchmark]: Boogie Preprocessor took 10.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.8 MB in the beginning and 946.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:50:38,515 INFO L168 Benchmark]: RCFGBuilder took 159.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:50:38,516 INFO L168 Benchmark]: BuchiAutomizer took 21684.40 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 410.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.2 MB). Peak memory consumption was 327.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:50:38,516 INFO L168 Benchmark]: Witness Printer took 45.07 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:50:38,518 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.67 ms. Allocated memory is still 1.0 GB. Free memory is still 948.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.8 MB in the beginning and 946.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 159.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21684.40 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 410.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.2 MB). Peak memory consumption was 327.8 MB. Max. memory is 11.5 GB. * Witness Printer took 45.07 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 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 55 terminating modules (50 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. 50 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 157 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.6s and 52 iterations. TraceHistogramMax:52. Analysis of lassos took 18.6s. Construction of modules took 1.6s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 53. Automata minimization 0.0s AutomataMinimizationTime, 55 MinimizatonAttempts, 104 StatesRemovedByMinimization, 51 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 157 states and ocurred in iteration 51. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 250 SDtfs, 53 SDslu, 2220 SDs, 0 SdLazy, 3637 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN46 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax199 hnf97 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: 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 {\result=0, i=49} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 Loop: [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...