./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5a3d22d49117f02662b197492bc1b16616a2878 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:16:55,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:16:55,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:16:55,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:16:55,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:16:55,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:16:55,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:16:55,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:16:55,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:16:55,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:16:55,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:16:55,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:16:55,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:16:55,731 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:16:55,732 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:16:55,732 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:16:55,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:16:55,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:16:55,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:16:55,736 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:16:55,737 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:16:55,738 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:16:55,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:16:55,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:16:55,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:16:55,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:16:55,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:16:55,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:16:55,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:16:55,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:16:55,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:16:55,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:16:55,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:16:55,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:16:55,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:16:55,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:16:55,746 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:16:55,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:16:55,757 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:16:55,758 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:16:55,758 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:16:55,758 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:16:55,758 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:16:55,758 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:16:55,758 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:16:55,758 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:16:55,759 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:16:55,759 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:16:55,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:16:55,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:16:55,759 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:16:55,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:16:55,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:16:55,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:16:55,760 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:16:55,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:16:55,760 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:16:55,760 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:16:55,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:16:55,760 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:16:55,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:16:55,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:16:55,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:16:55,761 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:16:55,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:16:55,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:16:55,761 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:16:55,762 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:16:55,762 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_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-10 07:16:55,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:16:55,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:16:55,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:16:55,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:16:55,798 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:16:55,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:16:55,834 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/data/3edc54c4e/bf1b0b78675e433abcc3fbb410eb3119/FLAGf442dfc31 [2018-11-10 07:16:56,228 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:16:56,228 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:16:56,233 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/data/3edc54c4e/bf1b0b78675e433abcc3fbb410eb3119/FLAGf442dfc31 [2018-11-10 07:16:56,241 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/data/3edc54c4e/bf1b0b78675e433abcc3fbb410eb3119 [2018-11-10 07:16:56,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:16:56,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:16:56,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:16:56,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:16:56,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:16:56,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56, skipping insertion in model container [2018-11-10 07:16:56,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:16:56,273 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:16:56,377 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:16:56,379 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:16:56,396 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:16:56,406 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:16:56,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56 WrapperNode [2018-11-10 07:16:56,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:16:56,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:16:56,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:16:56,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:16:56,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:16:56,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:16:56,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:16:56,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:16:56,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... [2018-11-10 07:16:56,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:16:56,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:16:56,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:16:56,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:16:56,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/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 07:16:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:16:56,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:16:56,702 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:16:56,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:16:56 BoogieIcfgContainer [2018-11-10 07:16:56,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:16:56,703 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:16:56,703 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:16:56,705 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:16:56,706 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:16:56,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:16:56" (1/3) ... [2018-11-10 07:16:56,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6dd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:16:56, skipping insertion in model container [2018-11-10 07:16:56,707 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:16:56,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:56" (2/3) ... [2018-11-10 07:16:56,708 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6dd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:16:56, skipping insertion in model container [2018-11-10 07:16:56,708 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:16:56,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:16:56" (3/3) ... [2018-11-10 07:16:56,709 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:16:56,750 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:16:56,750 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:16:56,750 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:16:56,750 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:16:56,750 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:16:56,750 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:16:56,751 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:16:56,751 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:16:56,751 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:16:56,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2018-11-10 07:16:56,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-10 07:16:56,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:56,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:56,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:56,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:56,784 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:16:56,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2018-11-10 07:16:56,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-10 07:16:56,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:56,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:56,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:56,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:56,791 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 18#L209-1true [2018-11-10 07:16:56,792 INFO L795 eck$LassoCheckResult]: Loop: 18#L209-1true assume true; 5#L51-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 49#L53true assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 50#L86true assume main_~p1~0 != 0;main_~lk1~0 := 1; 35#L86-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 53#L90-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 44#L94-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 12#L98-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 4#L102-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 8#L106-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 25#L110-1true assume !(main_~p8~0 != 0); 19#L114-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 36#L118-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 39#L122-1true assume main_~p11~0 != 0;main_~lk11~0 := 1; 33#L126-1true assume main_~p12~0 != 0;main_~lk12~0 := 1; 51#L130-1true assume main_~p13~0 != 0;main_~lk13~0 := 1; 41#L134-1true assume main_~p14~0 != 0;main_~lk14~0 := 1; 46#L138-1true assume !(main_~p1~0 != 0); 28#L144-1true assume !(main_~p2~0 != 0); 47#L149-1true assume !(main_~p3~0 != 0); 27#L154-1true assume !(main_~p4~0 != 0); 34#L159-1true assume !(main_~p5~0 != 0); 16#L164-1true assume !(main_~p6~0 != 0); 20#L169-1true assume !(main_~p7~0 != 0); 52#L174-1true assume !(main_~p8~0 != 0); 6#L179-1true assume !(main_~p9~0 != 0); 37#L184-1true assume !(main_~p10~0 != 0); 43#L189-1true assume !(main_~p11~0 != 0); 24#L194-1true assume !(main_~p12~0 != 0); 30#L199-1true assume !(main_~p13~0 != 0); 11#L204-1true assume !(main_~p14~0 != 0); 18#L209-1true [2018-11-10 07:16:56,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 07:16:56,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:56,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:56,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:56,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:56,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:56,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash 325349891, now seen corresponding path program 1 times [2018-11-10 07:16:56,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:56,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:56,937 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 07:16:56,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:56,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:56,941 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:56,952 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2018-11-10 07:16:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:56,975 INFO L93 Difference]: Finished difference Result 101 states and 180 transitions. [2018-11-10 07:16:56,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:56,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 180 transitions. [2018-11-10 07:16:56,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2018-11-10 07:16:56,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 145 transitions. [2018-11-10 07:16:56,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2018-11-10 07:16:56,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-10 07:16:56,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 145 transitions. [2018-11-10 07:16:56,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:56,986 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 145 transitions. [2018-11-10 07:16:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 145 transitions. [2018-11-10 07:16:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-10 07:16:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 07:16:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 145 transitions. [2018-11-10 07:16:57,007 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 145 transitions. [2018-11-10 07:16:57,007 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 145 transitions. [2018-11-10 07:16:57,008 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:16:57,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 145 transitions. [2018-11-10 07:16:57,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2018-11-10 07:16:57,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:57,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:57,011 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:57,011 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:57,011 INFO L793 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 191#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 192#L209-1 [2018-11-10 07:16:57,011 INFO L795 eck$LassoCheckResult]: Loop: 192#L209-1 assume true; 217#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 211#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 212#L86 assume !(main_~p1~0 != 0); 216#L86-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 252#L90-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 251#L94-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 250#L98-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 249#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 248#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 247#L110-1 assume !(main_~p8~0 != 0); 246#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 245#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 244#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 243#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 242#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 241#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 240#L138-1 assume !(main_~p1~0 != 0); 162#L144-1 assume !(main_~p2~0 != 0); 164#L149-1 assume !(main_~p3~0 != 0); 170#L154-1 assume !(main_~p4~0 != 0); 185#L159-1 assume !(main_~p5~0 != 0); 187#L164-1 assume !(main_~p6~0 != 0); 199#L169-1 assume !(main_~p7~0 != 0); 229#L174-1 assume !(main_~p8~0 != 0); 227#L179-1 assume !(main_~p9~0 != 0); 225#L184-1 assume !(main_~p10~0 != 0); 206#L189-1 assume !(main_~p11~0 != 0); 198#L194-1 assume !(main_~p12~0 != 0); 221#L199-1 assume !(main_~p13~0 != 0); 219#L204-1 assume !(main_~p14~0 != 0); 192#L209-1 [2018-11-10 07:16:57,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 07:16:57,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash -184123199, now seen corresponding path program 1 times [2018-11-10 07:16:57,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:57,058 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 07:16:57,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:57,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:57,058 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:57,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:57,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:57,059 INFO L87 Difference]: Start difference. First operand 91 states and 145 transitions. cyclomatic complexity: 56 Second operand 3 states. [2018-11-10 07:16:57,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:57,083 INFO L93 Difference]: Finished difference Result 178 states and 282 transitions. [2018-11-10 07:16:57,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:57,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 282 transitions. [2018-11-10 07:16:57,086 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2018-11-10 07:16:57,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 178 states and 282 transitions. [2018-11-10 07:16:57,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2018-11-10 07:16:57,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2018-11-10 07:16:57,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 282 transitions. [2018-11-10 07:16:57,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:57,090 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 282 transitions. [2018-11-10 07:16:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 282 transitions. [2018-11-10 07:16:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-11-10 07:16:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-10 07:16:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 282 transitions. [2018-11-10 07:16:57,100 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 282 transitions. [2018-11-10 07:16:57,100 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 282 transitions. [2018-11-10 07:16:57,100 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:16:57,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 282 transitions. [2018-11-10 07:16:57,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2018-11-10 07:16:57,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:57,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:57,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:57,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:57,103 INFO L793 eck$LassoCheckResult]: Stem: 487#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 466#L209-1 [2018-11-10 07:16:57,104 INFO L795 eck$LassoCheckResult]: Loop: 466#L209-1 assume true; 527#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 525#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 522#L86 assume !(main_~p1~0 != 0); 520#L86-2 assume !(main_~p2~0 != 0); 518#L90-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 516#L94-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 514#L98-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 512#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 510#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 508#L110-1 assume !(main_~p8~0 != 0); 506#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 504#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 502#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 500#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 497#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 496#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 493#L138-1 assume !(main_~p1~0 != 0); 494#L144-1 assume !(main_~p2~0 != 0); 574#L149-1 assume !(main_~p3~0 != 0); 569#L154-1 assume !(main_~p4~0 != 0); 566#L159-1 assume !(main_~p5~0 != 0); 562#L164-1 assume !(main_~p6~0 != 0); 557#L169-1 assume !(main_~p7~0 != 0); 554#L174-1 assume !(main_~p8~0 != 0); 550#L179-1 assume !(main_~p9~0 != 0); 546#L184-1 assume !(main_~p10~0 != 0); 542#L189-1 assume !(main_~p11~0 != 0); 538#L194-1 assume !(main_~p12~0 != 0); 534#L199-1 assume !(main_~p13~0 != 0); 531#L204-1 assume !(main_~p14~0 != 0); 466#L209-1 [2018-11-10 07:16:57,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 07:16:57,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1739104835, now seen corresponding path program 1 times [2018-11-10 07:16:57,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:57,146 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 07:16:57,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:57,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:57,147 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:57,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:57,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:57,147 INFO L87 Difference]: Start difference. First operand 178 states and 282 transitions. cyclomatic complexity: 108 Second operand 3 states. [2018-11-10 07:16:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:57,166 INFO L93 Difference]: Finished difference Result 350 states and 550 transitions. [2018-11-10 07:16:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:57,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 550 transitions. [2018-11-10 07:16:57,170 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 348 [2018-11-10 07:16:57,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 550 transitions. [2018-11-10 07:16:57,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2018-11-10 07:16:57,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2018-11-10 07:16:57,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 550 transitions. [2018-11-10 07:16:57,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:57,175 INFO L705 BuchiCegarLoop]: Abstraction has 350 states and 550 transitions. [2018-11-10 07:16:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 550 transitions. [2018-11-10 07:16:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2018-11-10 07:16:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-10 07:16:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 550 transitions. [2018-11-10 07:16:57,188 INFO L728 BuchiCegarLoop]: Abstraction has 350 states and 550 transitions. [2018-11-10 07:16:57,188 INFO L608 BuchiCegarLoop]: Abstraction has 350 states and 550 transitions. [2018-11-10 07:16:57,188 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:16:57,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 350 states and 550 transitions. [2018-11-10 07:16:57,191 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 348 [2018-11-10 07:16:57,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:57,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:57,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:57,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:57,192 INFO L793 eck$LassoCheckResult]: Stem: 1023#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 999#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 1000#L209-1 [2018-11-10 07:16:57,192 INFO L795 eck$LassoCheckResult]: Loop: 1000#L209-1 assume true; 1090#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1083#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1081#L86 assume !(main_~p1~0 != 0); 1079#L86-2 assume !(main_~p2~0 != 0); 1078#L90-1 assume !(main_~p3~0 != 0); 1072#L94-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 1073#L98-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1064#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1065#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1056#L110-1 assume !(main_~p8~0 != 0); 1057#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1048#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1049#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1040#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 1041#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 1034#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 1035#L138-1 assume !(main_~p1~0 != 0); 1140#L144-1 assume !(main_~p2~0 != 0); 1136#L149-1 assume !(main_~p3~0 != 0); 1132#L154-1 assume !(main_~p4~0 != 0); 1129#L159-1 assume !(main_~p5~0 != 0); 1125#L164-1 assume !(main_~p6~0 != 0); 1120#L169-1 assume !(main_~p7~0 != 0); 1117#L174-1 assume !(main_~p8~0 != 0); 1113#L179-1 assume !(main_~p9~0 != 0); 1109#L184-1 assume !(main_~p10~0 != 0); 1105#L189-1 assume !(main_~p11~0 != 0); 1101#L194-1 assume !(main_~p12~0 != 0); 1098#L199-1 assume !(main_~p13~0 != 0); 1095#L204-1 assume !(main_~p14~0 != 0); 1000#L209-1 [2018-11-10 07:16:57,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,192 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 07:16:57,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1801144449, now seen corresponding path program 1 times [2018-11-10 07:16:57,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:57,227 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 07:16:57,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:57,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:57,228 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:57,228 INFO L87 Difference]: Start difference. First operand 350 states and 550 transitions. cyclomatic complexity: 208 Second operand 3 states. [2018-11-10 07:16:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:57,246 INFO L93 Difference]: Finished difference Result 690 states and 1074 transitions. [2018-11-10 07:16:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:57,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 1074 transitions. [2018-11-10 07:16:57,251 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 688 [2018-11-10 07:16:57,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 690 states and 1074 transitions. [2018-11-10 07:16:57,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2018-11-10 07:16:57,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 690 [2018-11-10 07:16:57,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 690 states and 1074 transitions. [2018-11-10 07:16:57,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:57,257 INFO L705 BuchiCegarLoop]: Abstraction has 690 states and 1074 transitions. [2018-11-10 07:16:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states and 1074 transitions. [2018-11-10 07:16:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2018-11-10 07:16:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-11-10 07:16:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1074 transitions. [2018-11-10 07:16:57,271 INFO L728 BuchiCegarLoop]: Abstraction has 690 states and 1074 transitions. [2018-11-10 07:16:57,271 INFO L608 BuchiCegarLoop]: Abstraction has 690 states and 1074 transitions. [2018-11-10 07:16:57,271 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:16:57,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 690 states and 1074 transitions. [2018-11-10 07:16:57,274 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 688 [2018-11-10 07:16:57,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:57,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:57,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:57,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:57,275 INFO L793 eck$LassoCheckResult]: Stem: 2069#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2045#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 2046#L209-1 [2018-11-10 07:16:57,275 INFO L795 eck$LassoCheckResult]: Loop: 2046#L209-1 assume true; 2151#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2149#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2146#L86 assume !(main_~p1~0 != 0); 2142#L86-2 assume !(main_~p2~0 != 0); 2138#L90-1 assume !(main_~p3~0 != 0); 2134#L94-1 assume !(main_~p4~0 != 0); 2135#L98-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 2125#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 2126#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 2117#L110-1 assume !(main_~p8~0 != 0); 2118#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 2109#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 2110#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 2101#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 2102#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 2093#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 2094#L138-1 assume !(main_~p1~0 != 0); 2200#L144-1 assume !(main_~p2~0 != 0); 2196#L149-1 assume !(main_~p3~0 != 0); 2194#L154-1 assume !(main_~p4~0 != 0); 2192#L159-1 assume !(main_~p5~0 != 0); 2188#L164-1 assume !(main_~p6~0 != 0); 2183#L169-1 assume !(main_~p7~0 != 0); 2180#L174-1 assume !(main_~p8~0 != 0); 2176#L179-1 assume !(main_~p9~0 != 0); 2172#L184-1 assume !(main_~p10~0 != 0); 2168#L189-1 assume !(main_~p11~0 != 0); 2164#L194-1 assume !(main_~p12~0 != 0); 2160#L199-1 assume !(main_~p13~0 != 0); 2156#L204-1 assume !(main_~p14~0 != 0); 2046#L209-1 [2018-11-10 07:16:57,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 07:16:57,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1941693059, now seen corresponding path program 1 times [2018-11-10 07:16:57,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:57,308 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 07:16:57,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:57,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:57,309 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:57,310 INFO L87 Difference]: Start difference. First operand 690 states and 1074 transitions. cyclomatic complexity: 400 Second operand 3 states. [2018-11-10 07:16:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:57,329 INFO L93 Difference]: Finished difference Result 1362 states and 2098 transitions. [2018-11-10 07:16:57,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:57,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1362 states and 2098 transitions. [2018-11-10 07:16:57,340 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1360 [2018-11-10 07:16:57,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1362 states to 1362 states and 2098 transitions. [2018-11-10 07:16:57,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1362 [2018-11-10 07:16:57,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1362 [2018-11-10 07:16:57,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1362 states and 2098 transitions. [2018-11-10 07:16:57,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:57,350 INFO L705 BuchiCegarLoop]: Abstraction has 1362 states and 2098 transitions. [2018-11-10 07:16:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states and 2098 transitions. [2018-11-10 07:16:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2018-11-10 07:16:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-11-10 07:16:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2098 transitions. [2018-11-10 07:16:57,374 INFO L728 BuchiCegarLoop]: Abstraction has 1362 states and 2098 transitions. [2018-11-10 07:16:57,374 INFO L608 BuchiCegarLoop]: Abstraction has 1362 states and 2098 transitions. [2018-11-10 07:16:57,374 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:16:57,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1362 states and 2098 transitions. [2018-11-10 07:16:57,380 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1360 [2018-11-10 07:16:57,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:57,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:57,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:57,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:57,381 INFO L793 eck$LassoCheckResult]: Stem: 4127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4102#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 4103#L209-1 [2018-11-10 07:16:57,381 INFO L795 eck$LassoCheckResult]: Loop: 4103#L209-1 assume true; 4258#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4256#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4253#L86 assume !(main_~p1~0 != 0); 4249#L86-2 assume !(main_~p2~0 != 0); 4245#L90-1 assume !(main_~p3~0 != 0); 4242#L94-1 assume !(main_~p4~0 != 0); 4176#L98-1 assume !(main_~p5~0 != 0); 4172#L102-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 4170#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 4167#L110-1 assume !(main_~p8~0 != 0); 4168#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 4482#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 4481#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 4479#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 4477#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 4153#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 4148#L138-1 assume !(main_~p1~0 != 0); 4150#L144-1 assume !(main_~p2~0 != 0); 4311#L149-1 assume !(main_~p3~0 != 0); 4308#L154-1 assume !(main_~p4~0 != 0); 4297#L159-1 assume !(main_~p5~0 != 0); 4295#L164-1 assume !(main_~p6~0 != 0); 4290#L169-1 assume !(main_~p7~0 != 0); 4287#L174-1 assume !(main_~p8~0 != 0); 4283#L179-1 assume !(main_~p9~0 != 0); 4279#L184-1 assume !(main_~p10~0 != 0); 4275#L189-1 assume !(main_~p11~0 != 0); 4271#L194-1 assume !(main_~p12~0 != 0); 4267#L199-1 assume !(main_~p13~0 != 0); 4263#L204-1 assume !(main_~p14~0 != 0); 4103#L209-1 [2018-11-10 07:16:57,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 07:16:57,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1807679553, now seen corresponding path program 1 times [2018-11-10 07:16:57,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:57,407 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 07:16:57,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:57,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:57,407 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:57,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:57,408 INFO L87 Difference]: Start difference. First operand 1362 states and 2098 transitions. cyclomatic complexity: 768 Second operand 3 states. [2018-11-10 07:16:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:57,425 INFO L93 Difference]: Finished difference Result 2690 states and 4098 transitions. [2018-11-10 07:16:57,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:57,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2690 states and 4098 transitions. [2018-11-10 07:16:57,444 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2688 [2018-11-10 07:16:57,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2690 states to 2690 states and 4098 transitions. [2018-11-10 07:16:57,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2690 [2018-11-10 07:16:57,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2690 [2018-11-10 07:16:57,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2690 states and 4098 transitions. [2018-11-10 07:16:57,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:57,462 INFO L705 BuchiCegarLoop]: Abstraction has 2690 states and 4098 transitions. [2018-11-10 07:16:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states and 4098 transitions. [2018-11-10 07:16:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2018-11-10 07:16:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2018-11-10 07:16:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 4098 transitions. [2018-11-10 07:16:57,509 INFO L728 BuchiCegarLoop]: Abstraction has 2690 states and 4098 transitions. [2018-11-10 07:16:57,509 INFO L608 BuchiCegarLoop]: Abstraction has 2690 states and 4098 transitions. [2018-11-10 07:16:57,509 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:16:57,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2690 states and 4098 transitions. [2018-11-10 07:16:57,520 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2688 [2018-11-10 07:16:57,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:57,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:57,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:57,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:57,521 INFO L793 eck$LassoCheckResult]: Stem: 8189#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 8161#L209-1 [2018-11-10 07:16:57,521 INFO L795 eck$LassoCheckResult]: Loop: 8161#L209-1 assume true; 8388#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 8386#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8384#L86 assume !(main_~p1~0 != 0); 8374#L86-2 assume !(main_~p2~0 != 0); 8376#L90-1 assume !(main_~p3~0 != 0); 8355#L94-1 assume !(main_~p4~0 != 0); 8357#L98-1 assume !(main_~p5~0 != 0); 8341#L102-1 assume !(main_~p6~0 != 0); 8343#L106-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 8329#L110-1 assume !(main_~p8~0 != 0); 8330#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 8317#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 8318#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 8305#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 8306#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 8292#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 8293#L138-1 assume !(main_~p1~0 != 0); 8430#L144-1 assume !(main_~p2~0 != 0); 8428#L149-1 assume !(main_~p3~0 != 0); 8426#L154-1 assume !(main_~p4~0 != 0); 8424#L159-1 assume !(main_~p5~0 != 0); 8422#L164-1 assume !(main_~p6~0 != 0); 8420#L169-1 assume !(main_~p7~0 != 0); 8417#L174-1 assume !(main_~p8~0 != 0); 8413#L179-1 assume !(main_~p9~0 != 0); 8409#L184-1 assume !(main_~p10~0 != 0); 8405#L189-1 assume !(main_~p11~0 != 0); 8401#L194-1 assume !(main_~p12~0 != 0); 8397#L199-1 assume !(main_~p13~0 != 0); 8393#L204-1 assume !(main_~p14~0 != 0); 8161#L209-1 [2018-11-10 07:16:57,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,521 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 07:16:57,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2241219, now seen corresponding path program 1 times [2018-11-10 07:16:57,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:57,566 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 07:16:57,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:57,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:57,567 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:57,567 INFO L87 Difference]: Start difference. First operand 2690 states and 4098 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2018-11-10 07:16:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:57,600 INFO L93 Difference]: Finished difference Result 5314 states and 8002 transitions. [2018-11-10 07:16:57,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:57,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5314 states and 8002 transitions. [2018-11-10 07:16:57,629 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5312 [2018-11-10 07:16:57,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5314 states to 5314 states and 8002 transitions. [2018-11-10 07:16:57,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5314 [2018-11-10 07:16:57,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5314 [2018-11-10 07:16:57,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5314 states and 8002 transitions. [2018-11-10 07:16:57,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:57,664 INFO L705 BuchiCegarLoop]: Abstraction has 5314 states and 8002 transitions. [2018-11-10 07:16:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states and 8002 transitions. [2018-11-10 07:16:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 5314. [2018-11-10 07:16:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2018-11-10 07:16:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 8002 transitions. [2018-11-10 07:16:57,754 INFO L728 BuchiCegarLoop]: Abstraction has 5314 states and 8002 transitions. [2018-11-10 07:16:57,754 INFO L608 BuchiCegarLoop]: Abstraction has 5314 states and 8002 transitions. [2018-11-10 07:16:57,754 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:16:57,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5314 states and 8002 transitions. [2018-11-10 07:16:57,774 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5312 [2018-11-10 07:16:57,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:57,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:57,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:57,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:57,775 INFO L793 eck$LassoCheckResult]: Stem: 16198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 16172#L209-1 [2018-11-10 07:16:57,775 INFO L795 eck$LassoCheckResult]: Loop: 16172#L209-1 assume true; 16465#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 16463#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 16461#L86 assume !(main_~p1~0 != 0); 16447#L86-2 assume !(main_~p2~0 != 0); 16449#L90-1 assume !(main_~p3~0 != 0); 16423#L94-1 assume !(main_~p4~0 != 0); 16425#L98-1 assume !(main_~p5~0 != 0); 16407#L102-1 assume !(main_~p6~0 != 0); 16409#L106-1 assume !(main_~p7~0 != 0); 16387#L110-1 assume !(main_~p8~0 != 0); 16388#L114-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 16371#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 16372#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 16355#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 16356#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 16339#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 16340#L138-1 assume !(main_~p1~0 != 0); 16507#L144-1 assume !(main_~p2~0 != 0); 16505#L149-1 assume !(main_~p3~0 != 0); 16503#L154-1 assume !(main_~p4~0 != 0); 16501#L159-1 assume !(main_~p5~0 != 0); 16499#L164-1 assume !(main_~p6~0 != 0); 16497#L169-1 assume !(main_~p7~0 != 0); 16494#L174-1 assume !(main_~p8~0 != 0); 16490#L179-1 assume !(main_~p9~0 != 0); 16486#L184-1 assume !(main_~p10~0 != 0); 16482#L189-1 assume !(main_~p11~0 != 0); 16478#L194-1 assume !(main_~p12~0 != 0); 16474#L199-1 assume !(main_~p13~0 != 0); 16470#L204-1 assume !(main_~p14~0 != 0); 16172#L209-1 [2018-11-10 07:16:57,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 07:16:57,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:57,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash 221095937, now seen corresponding path program 1 times [2018-11-10 07:16:57,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:57,805 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 07:16:57,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:57,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:57,805 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:57,806 INFO L87 Difference]: Start difference. First operand 5314 states and 8002 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2018-11-10 07:16:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:57,856 INFO L93 Difference]: Finished difference Result 10498 states and 15618 transitions. [2018-11-10 07:16:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:57,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10498 states and 15618 transitions. [2018-11-10 07:16:57,901 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10496 [2018-11-10 07:16:57,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10498 states to 10498 states and 15618 transitions. [2018-11-10 07:16:57,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10498 [2018-11-10 07:16:57,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10498 [2018-11-10 07:16:57,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10498 states and 15618 transitions. [2018-11-10 07:16:57,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:57,987 INFO L705 BuchiCegarLoop]: Abstraction has 10498 states and 15618 transitions. [2018-11-10 07:16:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10498 states and 15618 transitions. [2018-11-10 07:16:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10498 to 10498. [2018-11-10 07:16:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10498 states. [2018-11-10 07:16:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10498 states to 10498 states and 15618 transitions. [2018-11-10 07:16:58,132 INFO L728 BuchiCegarLoop]: Abstraction has 10498 states and 15618 transitions. [2018-11-10 07:16:58,132 INFO L608 BuchiCegarLoop]: Abstraction has 10498 states and 15618 transitions. [2018-11-10 07:16:58,132 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:16:58,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10498 states and 15618 transitions. [2018-11-10 07:16:58,157 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10496 [2018-11-10 07:16:58,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:58,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:58,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:58,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:58,158 INFO L793 eck$LassoCheckResult]: Stem: 32015#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 31987#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 31988#L209-1 [2018-11-10 07:16:58,158 INFO L795 eck$LassoCheckResult]: Loop: 31988#L209-1 assume true; 32254#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 32252#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 32248#L86 assume !(main_~p1~0 != 0); 32245#L86-2 assume !(main_~p2~0 != 0); 32233#L90-1 assume !(main_~p3~0 != 0); 32235#L94-1 assume !(main_~p4~0 != 0); 32213#L98-1 assume !(main_~p5~0 != 0); 32215#L102-1 assume !(main_~p6~0 != 0); 32193#L106-1 assume !(main_~p7~0 != 0); 32195#L110-1 assume !(main_~p8~0 != 0); 32173#L114-1 assume !(main_~p9~0 != 0); 32175#L118-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 32157#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 32158#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 32141#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 32142#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 32121#L138-1 assume !(main_~p1~0 != 0); 32123#L144-1 assume !(main_~p2~0 != 0); 32295#L149-1 assume !(main_~p3~0 != 0); 32293#L154-1 assume !(main_~p4~0 != 0); 32291#L159-1 assume !(main_~p5~0 != 0); 32289#L164-1 assume !(main_~p6~0 != 0); 32285#L169-1 assume !(main_~p7~0 != 0); 32282#L174-1 assume !(main_~p8~0 != 0); 32277#L179-1 assume !(main_~p9~0 != 0); 32274#L184-1 assume !(main_~p10~0 != 0); 32270#L189-1 assume !(main_~p11~0 != 0); 32266#L194-1 assume !(main_~p12~0 != 0); 32262#L199-1 assume !(main_~p13~0 != 0); 32258#L204-1 assume !(main_~p14~0 != 0); 31988#L209-1 [2018-11-10 07:16:58,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 07:16:58,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:58,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:58,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:58,163 INFO L82 PathProgramCache]: Analyzing trace with hash -596552513, now seen corresponding path program 1 times [2018-11-10 07:16:58,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:58,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:58,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:58,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:58,190 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 07:16:58,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:58,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:58,191 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:58,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:58,191 INFO L87 Difference]: Start difference. First operand 10498 states and 15618 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2018-11-10 07:16:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:58,237 INFO L93 Difference]: Finished difference Result 20738 states and 30466 transitions. [2018-11-10 07:16:58,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:58,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20738 states and 30466 transitions. [2018-11-10 07:16:58,304 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20736 [2018-11-10 07:16:58,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20738 states to 20738 states and 30466 transitions. [2018-11-10 07:16:58,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20738 [2018-11-10 07:16:58,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20738 [2018-11-10 07:16:58,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20738 states and 30466 transitions. [2018-11-10 07:16:58,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:58,374 INFO L705 BuchiCegarLoop]: Abstraction has 20738 states and 30466 transitions. [2018-11-10 07:16:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20738 states and 30466 transitions. [2018-11-10 07:16:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20738 to 20738. [2018-11-10 07:16:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20738 states. [2018-11-10 07:16:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20738 states to 20738 states and 30466 transitions. [2018-11-10 07:16:58,667 INFO L728 BuchiCegarLoop]: Abstraction has 20738 states and 30466 transitions. [2018-11-10 07:16:58,668 INFO L608 BuchiCegarLoop]: Abstraction has 20738 states and 30466 transitions. [2018-11-10 07:16:58,668 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:16:58,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20738 states and 30466 transitions. [2018-11-10 07:16:58,711 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20736 [2018-11-10 07:16:58,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:58,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:58,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:58,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:58,717 INFO L793 eck$LassoCheckResult]: Stem: 63263#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 63229#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 63230#L209-1 [2018-11-10 07:16:58,717 INFO L795 eck$LassoCheckResult]: Loop: 63230#L209-1 assume true; 63525#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 63523#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 63521#L86 assume !(main_~p1~0 != 0); 63507#L86-2 assume !(main_~p2~0 != 0); 63509#L90-1 assume !(main_~p3~0 != 0); 63483#L94-1 assume !(main_~p4~0 != 0); 63485#L98-1 assume !(main_~p5~0 != 0); 63467#L102-1 assume !(main_~p6~0 != 0); 63469#L106-1 assume !(main_~p7~0 != 0); 63447#L110-1 assume !(main_~p8~0 != 0); 63448#L114-1 assume !(main_~p9~0 != 0); 63423#L118-1 assume !(main_~p10~0 != 0); 63425#L122-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 63407#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 63408#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 63391#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 63392#L138-1 assume !(main_~p1~0 != 0); 63567#L144-1 assume !(main_~p2~0 != 0); 63565#L149-1 assume !(main_~p3~0 != 0); 63563#L154-1 assume !(main_~p4~0 != 0); 63561#L159-1 assume !(main_~p5~0 != 0); 63559#L164-1 assume !(main_~p6~0 != 0); 63557#L169-1 assume !(main_~p7~0 != 0); 63554#L174-1 assume !(main_~p8~0 != 0); 63549#L179-1 assume !(main_~p9~0 != 0); 63545#L184-1 assume !(main_~p10~0 != 0); 63542#L189-1 assume !(main_~p11~0 != 0); 63538#L194-1 assume !(main_~p12~0 != 0); 63534#L199-1 assume !(main_~p13~0 != 0); 63530#L204-1 assume !(main_~p14~0 != 0); 63230#L209-1 [2018-11-10 07:16:58,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 07:16:58,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:58,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:58,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:58,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2009471041, now seen corresponding path program 1 times [2018-11-10 07:16:58,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:58,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:58,733 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 07:16:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:58,737 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:58,737 INFO L87 Difference]: Start difference. First operand 20738 states and 30466 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2018-11-10 07:16:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:58,825 INFO L93 Difference]: Finished difference Result 40962 states and 59394 transitions. [2018-11-10 07:16:58,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:58,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40962 states and 59394 transitions. [2018-11-10 07:16:58,946 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 40960 [2018-11-10 07:16:59,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40962 states to 40962 states and 59394 transitions. [2018-11-10 07:16:59,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40962 [2018-11-10 07:16:59,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40962 [2018-11-10 07:16:59,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40962 states and 59394 transitions. [2018-11-10 07:16:59,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:16:59,084 INFO L705 BuchiCegarLoop]: Abstraction has 40962 states and 59394 transitions. [2018-11-10 07:16:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40962 states and 59394 transitions. [2018-11-10 07:16:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40962 to 40962. [2018-11-10 07:16:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40962 states. [2018-11-10 07:16:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40962 states to 40962 states and 59394 transitions. [2018-11-10 07:16:59,491 INFO L728 BuchiCegarLoop]: Abstraction has 40962 states and 59394 transitions. [2018-11-10 07:16:59,491 INFO L608 BuchiCegarLoop]: Abstraction has 40962 states and 59394 transitions. [2018-11-10 07:16:59,491 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:16:59,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40962 states and 59394 transitions. [2018-11-10 07:16:59,563 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 40960 [2018-11-10 07:16:59,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:16:59,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:16:59,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:16:59,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:16:59,564 INFO L793 eck$LassoCheckResult]: Stem: 124967#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 124935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 124936#L209-1 [2018-11-10 07:16:59,564 INFO L795 eck$LassoCheckResult]: Loop: 124936#L209-1 assume true; 126013#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 126012#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 126011#L86 assume !(main_~p1~0 != 0); 126009#L86-2 assume !(main_~p2~0 != 0); 126007#L90-1 assume !(main_~p3~0 != 0); 126005#L94-1 assume !(main_~p4~0 != 0); 125742#L98-1 assume !(main_~p5~0 != 0); 125744#L102-1 assume !(main_~p6~0 != 0); 125988#L106-1 assume !(main_~p7~0 != 0); 125987#L110-1 assume !(main_~p8~0 != 0); 125984#L114-1 assume !(main_~p9~0 != 0); 125980#L118-1 assume !(main_~p10~0 != 0); 125976#L122-1 assume !(main_~p11~0 != 0); 125973#L126-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 125970#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 125968#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 125964#L138-1 assume !(main_~p1~0 != 0); 125960#L144-1 assume !(main_~p2~0 != 0); 125957#L149-1 assume !(main_~p3~0 != 0); 125954#L154-1 assume !(main_~p4~0 != 0); 125951#L159-1 assume !(main_~p5~0 != 0); 125945#L164-1 assume !(main_~p6~0 != 0); 125942#L169-1 assume !(main_~p7~0 != 0); 125936#L174-1 assume !(main_~p8~0 != 0); 125935#L179-1 assume !(main_~p9~0 != 0); 126047#L184-1 assume !(main_~p10~0 != 0); 126044#L189-1 assume !(main_~p11~0 != 0); 126043#L194-1 assume !(main_~p12~0 != 0); 125890#L199-1 assume !(main_~p13~0 != 0); 125889#L204-1 assume !(main_~p14~0 != 0); 124936#L209-1 [2018-11-10 07:16:59,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 07:16:59,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:59,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:59,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:16:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:16:59,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:16:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 15326335, now seen corresponding path program 1 times [2018-11-10 07:16:59,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:16:59,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:16:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:59,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:16:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:16:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:16:59,580 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 07:16:59,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:16:59,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:16:59,581 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:16:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:16:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:16:59,581 INFO L87 Difference]: Start difference. First operand 40962 states and 59394 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2018-11-10 07:16:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:16:59,718 INFO L93 Difference]: Finished difference Result 80898 states and 115714 transitions. [2018-11-10 07:16:59,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:16:59,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80898 states and 115714 transitions. [2018-11-10 07:16:59,899 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 80896 [2018-11-10 07:17:00,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80898 states to 80898 states and 115714 transitions. [2018-11-10 07:17:00,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80898 [2018-11-10 07:17:00,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80898 [2018-11-10 07:17:00,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80898 states and 115714 transitions. [2018-11-10 07:17:00,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:17:00,223 INFO L705 BuchiCegarLoop]: Abstraction has 80898 states and 115714 transitions. [2018-11-10 07:17:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80898 states and 115714 transitions. [2018-11-10 07:17:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80898 to 80898. [2018-11-10 07:17:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80898 states. [2018-11-10 07:17:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80898 states to 80898 states and 115714 transitions. [2018-11-10 07:17:00,968 INFO L728 BuchiCegarLoop]: Abstraction has 80898 states and 115714 transitions. [2018-11-10 07:17:00,968 INFO L608 BuchiCegarLoop]: Abstraction has 80898 states and 115714 transitions. [2018-11-10 07:17:00,968 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:17:00,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80898 states and 115714 transitions. [2018-11-10 07:17:01,067 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 80896 [2018-11-10 07:17:01,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:17:01,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:17:01,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:17:01,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:01,068 INFO L793 eck$LassoCheckResult]: Stem: 246838#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 246802#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 246803#L209-1 [2018-11-10 07:17:01,069 INFO L795 eck$LassoCheckResult]: Loop: 246803#L209-1 assume true; 247323#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 247311#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 247312#L86 assume !(main_~p1~0 != 0); 247293#L86-2 assume !(main_~p2~0 != 0); 247295#L90-1 assume !(main_~p3~0 != 0); 247275#L94-1 assume !(main_~p4~0 != 0); 247277#L98-1 assume !(main_~p5~0 != 0); 247476#L102-1 assume !(main_~p6~0 != 0); 247473#L106-1 assume !(main_~p7~0 != 0); 247471#L110-1 assume !(main_~p8~0 != 0); 247468#L114-1 assume !(main_~p9~0 != 0); 247464#L118-1 assume !(main_~p10~0 != 0); 247457#L122-1 assume !(main_~p11~0 != 0); 247449#L126-1 assume !(main_~p12~0 != 0); 247442#L130-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 247438#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 247433#L138-1 assume !(main_~p1~0 != 0); 247425#L144-1 assume !(main_~p2~0 != 0); 247417#L149-1 assume !(main_~p3~0 != 0); 247409#L154-1 assume !(main_~p4~0 != 0); 247403#L159-1 assume !(main_~p5~0 != 0); 247124#L164-1 assume !(main_~p6~0 != 0); 247125#L169-1 assume !(main_~p7~0 != 0); 247385#L174-1 assume !(main_~p8~0 != 0); 247384#L179-1 assume !(main_~p9~0 != 0); 247362#L184-1 assume !(main_~p10~0 != 0); 247363#L189-1 assume !(main_~p11~0 != 0); 247345#L194-1 assume !(main_~p12~0 != 0); 247347#L199-1 assume !(main_~p13~0 != 0); 247488#L204-1 assume !(main_~p14~0 != 0); 246803#L209-1 [2018-11-10 07:17:01,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:01,069 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2018-11-10 07:17:01,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:01,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:01,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:01,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1573021567, now seen corresponding path program 1 times [2018-11-10 07:17:01,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:01,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:01,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:17:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:01,105 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 07:17:01,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:01,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:17:01,106 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:17:01,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:17:01,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:17:01,106 INFO L87 Difference]: Start difference. First operand 80898 states and 115714 transitions. cyclomatic complexity: 36864 Second operand 3 states. [2018-11-10 07:17:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:01,306 INFO L93 Difference]: Finished difference Result 159746 states and 225282 transitions. [2018-11-10 07:17:01,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:17:01,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159746 states and 225282 transitions. [2018-11-10 07:17:01,663 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 159744 [2018-11-10 07:17:02,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159746 states to 159746 states and 225282 transitions. [2018-11-10 07:17:02,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159746 [2018-11-10 07:17:02,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159746 [2018-11-10 07:17:02,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159746 states and 225282 transitions. [2018-11-10 07:17:02,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:17:02,342 INFO L705 BuchiCegarLoop]: Abstraction has 159746 states and 225282 transitions. [2018-11-10 07:17:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159746 states and 225282 transitions. [2018-11-10 07:17:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159746 to 159746. [2018-11-10 07:17:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159746 states. [2018-11-10 07:17:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159746 states to 159746 states and 225282 transitions. [2018-11-10 07:17:03,742 INFO L728 BuchiCegarLoop]: Abstraction has 159746 states and 225282 transitions. [2018-11-10 07:17:03,742 INFO L608 BuchiCegarLoop]: Abstraction has 159746 states and 225282 transitions. [2018-11-10 07:17:03,742 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:17:03,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159746 states and 225282 transitions. [2018-11-10 07:17:03,994 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 159744 [2018-11-10 07:17:03,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:17:03,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:17:03,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:17:03,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:03,996 INFO L793 eck$LassoCheckResult]: Stem: 487479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 487450#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 487451#L209-1 [2018-11-10 07:17:03,996 INFO L795 eck$LassoCheckResult]: Loop: 487451#L209-1 assume true; 488297#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 488294#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 488290#L86 assume !(main_~p1~0 != 0); 488286#L86-2 assume !(main_~p2~0 != 0); 488283#L90-1 assume !(main_~p3~0 != 0); 488281#L94-1 assume !(main_~p4~0 != 0); 488279#L98-1 assume !(main_~p5~0 != 0); 488277#L102-1 assume !(main_~p6~0 != 0); 488275#L106-1 assume !(main_~p7~0 != 0); 488274#L110-1 assume !(main_~p8~0 != 0); 488273#L114-1 assume !(main_~p9~0 != 0); 488267#L118-1 assume !(main_~p10~0 != 0); 488269#L122-1 assume !(main_~p11~0 != 0); 488333#L126-1 assume !(main_~p12~0 != 0); 488330#L130-1 assume !(main_~p13~0 != 0); 488329#L134-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 488325#L138-1 assume !(main_~p1~0 != 0); 488255#L144-1 assume !(main_~p2~0 != 0); 488257#L149-1 assume !(main_~p3~0 != 0); 488232#L154-1 assume !(main_~p4~0 != 0); 488233#L159-1 assume !(main_~p5~0 != 0); 488222#L164-1 assume !(main_~p6~0 != 0); 488223#L169-1 assume !(main_~p7~0 != 0); 488202#L174-1 assume !(main_~p8~0 != 0); 488201#L179-1 assume !(main_~p9~0 != 0); 488186#L184-1 assume !(main_~p10~0 != 0); 488187#L189-1 assume !(main_~p11~0 != 0); 488171#L194-1 assume !(main_~p12~0 != 0); 488173#L199-1 assume !(main_~p13~0 != 0); 488303#L204-1 assume !(main_~p14~0 != 0); 487451#L209-1 [2018-11-10 07:17:03,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:03,996 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2018-11-10 07:17:03,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:03,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:03,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:03,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1700877375, now seen corresponding path program 1 times [2018-11-10 07:17:03,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:03,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:04,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:04,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:17:04,014 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 07:17:04,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:17:04,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:17:04,014 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:17:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:17:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:17:04,015 INFO L87 Difference]: Start difference. First operand 159746 states and 225282 transitions. cyclomatic complexity: 69632 Second operand 3 states. [2018-11-10 07:17:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:17:04,436 INFO L93 Difference]: Finished difference Result 315394 states and 438274 transitions. [2018-11-10 07:17:04,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:17:04,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315394 states and 438274 transitions. [2018-11-10 07:17:07,827 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 315392 [2018-11-10 07:17:08,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315394 states to 315394 states and 438274 transitions. [2018-11-10 07:17:08,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 315394 [2018-11-10 07:17:08,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 315394 [2018-11-10 07:17:08,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315394 states and 438274 transitions. [2018-11-10 07:17:08,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:17:08,282 INFO L705 BuchiCegarLoop]: Abstraction has 315394 states and 438274 transitions. [2018-11-10 07:17:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315394 states and 438274 transitions. [2018-11-10 07:17:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315394 to 315394. [2018-11-10 07:17:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315394 states. [2018-11-10 07:17:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315394 states to 315394 states and 438274 transitions. [2018-11-10 07:17:10,284 INFO L728 BuchiCegarLoop]: Abstraction has 315394 states and 438274 transitions. [2018-11-10 07:17:10,284 INFO L608 BuchiCegarLoop]: Abstraction has 315394 states and 438274 transitions. [2018-11-10 07:17:10,284 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:17:10,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315394 states and 438274 transitions. [2018-11-10 07:17:11,211 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 315392 [2018-11-10 07:17:11,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:17:11,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:17:11,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:17:11,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:17:11,214 INFO L793 eck$LassoCheckResult]: Stem: 962627#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 962597#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 962598#L209-1 [2018-11-10 07:17:11,214 INFO L795 eck$LassoCheckResult]: Loop: 962598#L209-1 assume true; 963459#L51-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 963457#L53 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 963453#L86 assume !(main_~p1~0 != 0); 963449#L86-2 assume !(main_~p2~0 != 0); 963445#L90-1 assume !(main_~p3~0 != 0); 963441#L94-1 assume !(main_~p4~0 != 0); 963437#L98-1 assume !(main_~p5~0 != 0); 963433#L102-1 assume !(main_~p6~0 != 0); 963369#L106-1 assume !(main_~p7~0 != 0); 963359#L110-1 assume !(main_~p8~0 != 0); 963360#L114-1 assume !(main_~p9~0 != 0); 963610#L118-1 assume !(main_~p10~0 != 0); 963606#L122-1 assume !(main_~p11~0 != 0); 963603#L126-1 assume !(main_~p12~0 != 0); 963596#L130-1 assume !(main_~p13~0 != 0); 963589#L134-1 assume !(main_~p14~0 != 0); 963582#L138-1 assume !(main_~p1~0 != 0); 963531#L144-1 assume !(main_~p2~0 != 0); 963527#L149-1 assume !(main_~p3~0 != 0); 963523#L154-1 assume !(main_~p4~0 != 0); 963519#L159-1 assume !(main_~p5~0 != 0); 963517#L164-1 assume !(main_~p6~0 != 0); 963486#L169-1 assume !(main_~p7~0 != 0); 963483#L174-1 assume !(main_~p8~0 != 0); 963479#L179-1 assume !(main_~p9~0 != 0); 963476#L184-1 assume !(main_~p10~0 != 0); 963474#L189-1 assume !(main_~p11~0 != 0); 963470#L194-1 assume !(main_~p12~0 != 0); 963466#L199-1 assume !(main_~p13~0 != 0); 963462#L204-1 assume !(main_~p14~0 != 0); 962598#L209-1 [2018-11-10 07:17:11,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2018-11-10 07:17:11,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:11,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash 421013697, now seen corresponding path program 1 times [2018-11-10 07:17:11,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:11,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:17:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:11,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:17:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -563598145, now seen corresponding path program 1 times [2018-11-10 07:17:11,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:17:11,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:17:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:17:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:17:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:17:11,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:17:11 BoogieIcfgContainer [2018-11-10 07:17:11,415 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:17:11,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:17:11,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:17:11,415 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:17:11,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:16:56" (3/4) ... [2018-11-10 07:17:11,418 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 07:17:11,463 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bffd4bc3-8cd3-45ba-a603-8ad44e2c3ef5/bin-2019/uautomizer/witness.graphml [2018-11-10 07:17:11,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:17:11,464 INFO L168 Benchmark]: Toolchain (without parser) took 15220.97 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 954.9 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-10 07:17:11,466 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:17:11,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.26 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 941.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:11,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.81 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:17:11,467 INFO L168 Benchmark]: Boogie Preprocessor took 13.59 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:11,467 INFO L168 Benchmark]: RCFGBuilder took 258.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:17:11,467 INFO L168 Benchmark]: BuchiAutomizer took 14712.05 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-10 07:17:11,468 INFO L168 Benchmark]: Witness Printer took 48.50 ms. Allocated memory is still 4.0 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:17:11,469 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.26 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 941.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.81 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.59 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14712.05 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 48.50 ms. Allocated memory is still 4.0 GB. Free memory is still 2.3 GB. There was no memory consumed. 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 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 315394 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.6s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 5.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 5.6s Buchi closure took 0.1s. Biggest automaton had 315394 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1459 SDtfs, 759 SDslu, 914 SDs, 0 SdLazy, 65 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI13 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 51]: 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 {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@755a93dd=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21dd1b64=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@162351f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25292a47=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fb96d47=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6055b2e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f0c728=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41301148=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19cde9b1=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a60195c=0, p14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@115ee46=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63f97d8a=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8ff2431=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45f480f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49d008f2=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 51]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; Loop: [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 [L86] COND FALSE !(p1 != 0) [L90] COND FALSE !(p2 != 0) [L94] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L102] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L110] COND FALSE !(p7 != 0) [L114] COND FALSE !(p8 != 0) [L118] COND FALSE !(p9 != 0) [L122] COND FALSE !(p10 != 0) [L126] COND FALSE !(p11 != 0) [L130] COND FALSE !(p12 != 0) [L134] COND FALSE !(p13 != 0) [L138] COND FALSE !(p14 != 0) [L144] COND FALSE !(p1 != 0) [L149] COND FALSE !(p2 != 0) [L154] COND FALSE !(p3 != 0) [L159] COND FALSE !(p4 != 0) [L164] COND FALSE !(p5 != 0) [L169] COND FALSE !(p6 != 0) [L174] COND FALSE !(p7 != 0) [L179] COND FALSE !(p8 != 0) [L184] COND FALSE !(p9 != 0) [L189] COND FALSE !(p10 != 0) [L194] COND FALSE !(p11 != 0) [L199] COND FALSE !(p12 != 0) [L204] COND FALSE !(p13 != 0) [L209] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...