./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15_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_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:03:29,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:03:29,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:03:29,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:03:29,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:03:29,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:03:29,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:03:29,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:03:29,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:03:29,559 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:03:29,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:03:29,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:03:29,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:03:29,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:03:29,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:03:29,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:03:29,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:03:29,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:03:29,565 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:03:29,566 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:03:29,567 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:03:29,568 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:03:29,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:03:29,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:03:29,569 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:03:29,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:03:29,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:03:29,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:03:29,572 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:03:29,572 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:03:29,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:03:29,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:03:29,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:03:29,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:03:29,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:03:29,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:03:29,575 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 08:03:29,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:03:29,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:03:29,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:03:29,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:03:29,587 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:03:29,587 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:03:29,587 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:03:29,587 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:03:29,587 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:03:29,587 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:03:29,587 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:03:29,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:03:29,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:03:29,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:03:29,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:03:29,589 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:03:29,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:03:29,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:03:29,589 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:03:29,589 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:03:29,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:03:29,590 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:03:29,590 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:03:29,590 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:03:29,591 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_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-11-10 08:03:29,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:03:29,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:03:29,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:03:29,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:03:29,625 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:03:29,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 08:03:29,662 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/data/2205719c8/b0c9d40e9bb24af2b685df3259675e46/FLAG3dd0eb1e8 [2018-11-10 08:03:29,987 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:03:29,988 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 08:03:29,994 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/data/2205719c8/b0c9d40e9bb24af2b685df3259675e46/FLAG3dd0eb1e8 [2018-11-10 08:03:30,002 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/data/2205719c8/b0c9d40e9bb24af2b685df3259675e46 [2018-11-10 08:03:30,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:03:30,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:03:30,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:03:30,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:03:30,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:03:30,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,011 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 08:03:30, skipping insertion in model container [2018-11-10 08:03:30,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:03:30,031 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:03:30,130 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:03:30,132 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:03:30,154 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:03:30,164 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:03:30,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30 WrapperNode [2018-11-10 08:03:30,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:03:30,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:03:30,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:03:30,165 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:03:30,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:03:30,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:03:30,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:03:30,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:03:30,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... [2018-11-10 08:03:30,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:03:30,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:03:30,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:03:30,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:03:30,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/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 08:03:30,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:03:30,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:03:30,509 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:03:30,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:03:30 BoogieIcfgContainer [2018-11-10 08:03:30,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:03:30,510 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:03:30,510 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:03:30,513 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:03:30,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:03:30,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:03:30" (1/3) ... [2018-11-10 08:03:30,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62267304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:03:30, skipping insertion in model container [2018-11-10 08:03:30,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:03:30,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:03:30" (2/3) ... [2018-11-10 08:03:30,515 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62267304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:03:30, skipping insertion in model container [2018-11-10 08:03:30,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:03:30,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:03:30" (3/3) ... [2018-11-10 08:03:30,517 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 08:03:30,558 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:03:30,558 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:03:30,558 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:03:30,558 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:03:30,559 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:03:30,559 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:03:30,559 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:03:30,559 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:03:30,559 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:03:30,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2018-11-10 08:03:30,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 08:03:30,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:30,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:30,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:30,591 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, 1, 1] [2018-11-10 08:03:30,591 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:03:30,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2018-11-10 08:03:30,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 08:03:30,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:30,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:30,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:30,595 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, 1, 1] [2018-11-10 08:03:30,600 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 11#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 9#L223-1true [2018-11-10 08:03:30,600 INFO L795 eck$LassoCheckResult]: Loop: 9#L223-1true assume true; 12#L54-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 43#L56true 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;main_~lk15~0 := 0; 4#L91true assume main_~p1~0 != 0;main_~lk1~0 := 1; 19#L91-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 10#L95-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 32#L99-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 23#L103-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 40#L107-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 45#L111-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 37#L115-1true assume !(main_~p8~0 != 0); 53#L119-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 46#L123-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 50#L127-1true assume main_~p11~0 != 0;main_~lk11~0 := 1; 16#L131-1true assume main_~p12~0 != 0;main_~lk12~0 := 1; 6#L135-1true assume main_~p13~0 != 0;main_~lk13~0 := 1; 29#L139-1true assume main_~p14~0 != 0;main_~lk14~0 := 1; 34#L143-1true assume main_~p15~0 != 0;main_~lk15~0 := 1; 25#L147-1true assume !(main_~p1~0 != 0); 17#L153-1true assume !(main_~p2~0 != 0); 26#L158-1true assume !(main_~p3~0 != 0); 55#L163-1true assume !(main_~p4~0 != 0); 7#L168-1true assume !(main_~p5~0 != 0); 42#L173-1true assume !(main_~p6~0 != 0); 48#L178-1true assume !(main_~p7~0 != 0); 31#L183-1true assume !(main_~p8~0 != 0); 35#L188-1true assume !(main_~p9~0 != 0); 13#L193-1true assume !(main_~p10~0 != 0); 22#L198-1true assume !(main_~p11~0 != 0); 52#L203-1true assume !(main_~p12~0 != 0); 3#L208-1true assume !(main_~p13~0 != 0); 28#L213-1true assume !(main_~p14~0 != 0); 57#L218-1true assume !(main_~p15~0 != 0); 9#L223-1true [2018-11-10 08:03:30,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 08:03:30,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:30,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:30,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:30,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:30,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:30,670 INFO L82 PathProgramCache]: Analyzing trace with hash -75842128, now seen corresponding path program 1 times [2018-11-10 08:03:30,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:30,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:30,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:30,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:30,736 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 08:03:30,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:30,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:30,742 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:30,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:30,753 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-11-10 08:03:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:30,799 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-11-10 08:03:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:30,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 192 transitions. [2018-11-10 08:03:30,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 95 [2018-11-10 08:03:30,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 97 states and 155 transitions. [2018-11-10 08:03:30,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2018-11-10 08:03:30,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2018-11-10 08:03:30,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 155 transitions. [2018-11-10 08:03:30,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:30,812 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 155 transitions. [2018-11-10 08:03:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 155 transitions. [2018-11-10 08:03:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-10 08:03:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 08:03:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 155 transitions. [2018-11-10 08:03:30,834 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 155 transitions. [2018-11-10 08:03:30,834 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 155 transitions. [2018-11-10 08:03:30,834 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:03:30,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 155 transitions. [2018-11-10 08:03:30,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 95 [2018-11-10 08:03:30,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:30,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:30,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:30,837 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, 1, 1] [2018-11-10 08:03:30,837 INFO L793 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 189#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 185#L223-1 [2018-11-10 08:03:30,837 INFO L795 eck$LassoCheckResult]: Loop: 185#L223-1 assume true; 186#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 190#L56 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;main_~lk15~0 := 0; 225#L91 assume !(main_~p1~0 != 0); 226#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 267#L95-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 266#L99-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 265#L103-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 264#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 263#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 262#L115-1 assume !(main_~p8~0 != 0); 261#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 260#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 259#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 258#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 257#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 256#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 255#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 254#L147-1 assume !(main_~p1~0 != 0); 197#L153-1 assume !(main_~p2~0 != 0); 198#L158-1 assume !(main_~p3~0 != 0); 201#L163-1 assume !(main_~p4~0 != 0); 180#L168-1 assume !(main_~p5~0 != 0); 181#L173-1 assume !(main_~p6~0 != 0); 245#L178-1 assume !(main_~p7~0 != 0); 243#L183-1 assume !(main_~p8~0 != 0); 241#L188-1 assume !(main_~p9~0 != 0); 239#L193-1 assume !(main_~p10~0 != 0); 237#L198-1 assume !(main_~p11~0 != 0); 235#L203-1 assume !(main_~p12~0 != 0); 233#L208-1 assume !(main_~p13~0 != 0); 231#L213-1 assume !(main_~p14~0 != 0); 229#L218-1 assume !(main_~p15~0 != 0); 185#L223-1 [2018-11-10 08:03:30,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:30,838 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 08:03:30,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:30,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:30,846 INFO L82 PathProgramCache]: Analyzing trace with hash -53209874, now seen corresponding path program 1 times [2018-11-10 08:03:30,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:30,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:30,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:30,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:30,888 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 08:03:30,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:30,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:30,889 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:30,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:30,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:30,889 INFO L87 Difference]: Start difference. First operand 97 states and 155 transitions. cyclomatic complexity: 60 Second operand 3 states. [2018-11-10 08:03:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:30,913 INFO L93 Difference]: Finished difference Result 190 states and 302 transitions. [2018-11-10 08:03:30,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:30,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 302 transitions. [2018-11-10 08:03:30,916 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 188 [2018-11-10 08:03:30,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 190 states and 302 transitions. [2018-11-10 08:03:30,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-11-10 08:03:30,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2018-11-10 08:03:30,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 302 transitions. [2018-11-10 08:03:30,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:30,919 INFO L705 BuchiCegarLoop]: Abstraction has 190 states and 302 transitions. [2018-11-10 08:03:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 302 transitions. [2018-11-10 08:03:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-11-10 08:03:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 08:03:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 302 transitions. [2018-11-10 08:03:30,930 INFO L728 BuchiCegarLoop]: Abstraction has 190 states and 302 transitions. [2018-11-10 08:03:30,930 INFO L608 BuchiCegarLoop]: Abstraction has 190 states and 302 transitions. [2018-11-10 08:03:30,930 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:03:30,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 302 transitions. [2018-11-10 08:03:30,932 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 188 [2018-11-10 08:03:30,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:30,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:30,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:30,932 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, 1, 1] [2018-11-10 08:03:30,933 INFO L793 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 482#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 483#L223-1 [2018-11-10 08:03:30,933 INFO L795 eck$LassoCheckResult]: Loop: 483#L223-1 assume true; 564#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 562#L56 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;main_~lk15~0 := 0; 560#L91 assume !(main_~p1~0 != 0); 557#L91-2 assume !(main_~p2~0 != 0); 555#L95-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 553#L99-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 551#L103-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 549#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 547#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 545#L115-1 assume !(main_~p8~0 != 0); 543#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 541#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 539#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 537#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 535#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 533#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 531#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 529#L147-1 assume !(main_~p1~0 != 0); 530#L153-1 assume !(main_~p2~0 != 0); 616#L158-1 assume !(main_~p3~0 != 0); 612#L163-1 assume !(main_~p4~0 != 0); 607#L168-1 assume !(main_~p5~0 != 0); 604#L173-1 assume !(main_~p6~0 != 0); 600#L178-1 assume !(main_~p7~0 != 0); 596#L183-1 assume !(main_~p8~0 != 0); 592#L188-1 assume !(main_~p9~0 != 0); 588#L193-1 assume !(main_~p10~0 != 0); 584#L198-1 assume !(main_~p11~0 != 0); 580#L203-1 assume !(main_~p12~0 != 0); 576#L208-1 assume !(main_~p13~0 != 0); 572#L213-1 assume !(main_~p14~0 != 0); 568#L218-1 assume !(main_~p15~0 != 0); 483#L223-1 [2018-11-10 08:03:30,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 08:03:30,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:30,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:30,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:30,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:30,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1332993520, now seen corresponding path program 1 times [2018-11-10 08:03:30,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:30,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:30,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:30,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:30,971 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 08:03:30,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:30,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:30,972 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:30,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:30,973 INFO L87 Difference]: Start difference. First operand 190 states and 302 transitions. cyclomatic complexity: 116 Second operand 3 states. [2018-11-10 08:03:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:30,991 INFO L93 Difference]: Finished difference Result 374 states and 590 transitions. [2018-11-10 08:03:30,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:30,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 590 transitions. [2018-11-10 08:03:30,994 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 372 [2018-11-10 08:03:30,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 374 states and 590 transitions. [2018-11-10 08:03:30,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 08:03:30,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 08:03:30,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 590 transitions. [2018-11-10 08:03:31,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:31,000 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 590 transitions. [2018-11-10 08:03:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 590 transitions. [2018-11-10 08:03:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2018-11-10 08:03:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-10 08:03:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 590 transitions. [2018-11-10 08:03:31,016 INFO L728 BuchiCegarLoop]: Abstraction has 374 states and 590 transitions. [2018-11-10 08:03:31,016 INFO L608 BuchiCegarLoop]: Abstraction has 374 states and 590 transitions. [2018-11-10 08:03:31,016 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:03:31,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 374 states and 590 transitions. [2018-11-10 08:03:31,019 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 372 [2018-11-10 08:03:31,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:31,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:31,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:31,020 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, 1, 1] [2018-11-10 08:03:31,020 INFO L793 eck$LassoCheckResult]: Stem: 1078#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1052#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1053#L223-1 [2018-11-10 08:03:31,020 INFO L795 eck$LassoCheckResult]: Loop: 1053#L223-1 assume true; 1158#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1154#L56 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;main_~lk15~0 := 0; 1150#L91 assume !(main_~p1~0 != 0); 1145#L91-2 assume !(main_~p2~0 != 0); 1139#L95-1 assume !(main_~p3~0 != 0); 1134#L99-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 1131#L103-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1128#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1125#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1122#L115-1 assume !(main_~p8~0 != 0); 1119#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1117#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1115#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1113#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 1110#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 1111#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 1274#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 1103#L147-1 assume !(main_~p1~0 != 0); 1104#L153-1 assume !(main_~p2~0 != 0); 1267#L158-1 assume !(main_~p3~0 != 0); 1263#L163-1 assume !(main_~p4~0 != 0); 1259#L168-1 assume !(main_~p5~0 != 0); 1256#L173-1 assume !(main_~p6~0 != 0); 1252#L178-1 assume !(main_~p7~0 != 0); 1248#L183-1 assume !(main_~p8~0 != 0); 1244#L188-1 assume !(main_~p9~0 != 0); 1240#L193-1 assume !(main_~p10~0 != 0); 1217#L198-1 assume !(main_~p11~0 != 0); 1187#L203-1 assume !(main_~p12~0 != 0); 1183#L208-1 assume !(main_~p13~0 != 0); 1181#L213-1 assume !(main_~p14~0 != 0); 1167#L218-1 assume !(main_~p15~0 != 0); 1053#L223-1 [2018-11-10 08:03:31,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 08:03:31,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:31,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash 823520430, now seen corresponding path program 1 times [2018-11-10 08:03:31,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:31,047 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 08:03:31,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:31,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:31,048 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:31,049 INFO L87 Difference]: Start difference. First operand 374 states and 590 transitions. cyclomatic complexity: 224 Second operand 3 states. [2018-11-10 08:03:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:31,062 INFO L93 Difference]: Finished difference Result 738 states and 1154 transitions. [2018-11-10 08:03:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:31,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 738 states and 1154 transitions. [2018-11-10 08:03:31,066 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 736 [2018-11-10 08:03:31,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 738 states to 738 states and 1154 transitions. [2018-11-10 08:03:31,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 738 [2018-11-10 08:03:31,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 738 [2018-11-10 08:03:31,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 738 states and 1154 transitions. [2018-11-10 08:03:31,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:31,071 INFO L705 BuchiCegarLoop]: Abstraction has 738 states and 1154 transitions. [2018-11-10 08:03:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states and 1154 transitions. [2018-11-10 08:03:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2018-11-10 08:03:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-10 08:03:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1154 transitions. [2018-11-10 08:03:31,086 INFO L728 BuchiCegarLoop]: Abstraction has 738 states and 1154 transitions. [2018-11-10 08:03:31,086 INFO L608 BuchiCegarLoop]: Abstraction has 738 states and 1154 transitions. [2018-11-10 08:03:31,086 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:03:31,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 738 states and 1154 transitions. [2018-11-10 08:03:31,089 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 736 [2018-11-10 08:03:31,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:31,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:31,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:31,090 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, 1, 1] [2018-11-10 08:03:31,090 INFO L793 eck$LassoCheckResult]: Stem: 2195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2170#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2171#L223-1 [2018-11-10 08:03:31,091 INFO L795 eck$LassoCheckResult]: Loop: 2171#L223-1 assume true; 2285#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2278#L56 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;main_~lk15~0 := 0; 2270#L91 assume !(main_~p1~0 != 0); 2268#L91-2 assume !(main_~p2~0 != 0); 2266#L95-1 assume !(main_~p3~0 != 0); 2267#L99-1 assume !(main_~p4~0 != 0); 2419#L103-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 2417#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 2415#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 2414#L115-1 assume !(main_~p8~0 != 0); 2413#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 2412#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 2411#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 2408#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 2405#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 2397#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 2391#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 2384#L147-1 assume !(main_~p1~0 != 0); 2377#L153-1 assume !(main_~p2~0 != 0); 2371#L158-1 assume !(main_~p3~0 != 0); 2369#L163-1 assume !(main_~p4~0 != 0); 2365#L168-1 assume !(main_~p5~0 != 0); 2362#L173-1 assume !(main_~p6~0 != 0); 2358#L178-1 assume !(main_~p7~0 != 0); 2354#L183-1 assume !(main_~p8~0 != 0); 2350#L188-1 assume !(main_~p9~0 != 0); 2346#L193-1 assume !(main_~p10~0 != 0); 2341#L198-1 assume !(main_~p11~0 != 0); 2324#L203-1 assume !(main_~p12~0 != 0); 2310#L208-1 assume !(main_~p13~0 != 0); 2298#L213-1 assume !(main_~p14~0 != 0); 2293#L218-1 assume !(main_~p15~0 != 0); 2171#L223-1 [2018-11-10 08:03:31,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 08:03:31,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1548218832, now seen corresponding path program 1 times [2018-11-10 08:03:31,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:31,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:31,115 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 08:03:31,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:31,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:31,116 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:31,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:31,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:31,116 INFO L87 Difference]: Start difference. First operand 738 states and 1154 transitions. cyclomatic complexity: 432 Second operand 3 states. [2018-11-10 08:03:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:31,138 INFO L93 Difference]: Finished difference Result 1458 states and 2258 transitions. [2018-11-10 08:03:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:31,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1458 states and 2258 transitions. [2018-11-10 08:03:31,147 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1456 [2018-11-10 08:03:31,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1458 states to 1458 states and 2258 transitions. [2018-11-10 08:03:31,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1458 [2018-11-10 08:03:31,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1458 [2018-11-10 08:03:31,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1458 states and 2258 transitions. [2018-11-10 08:03:31,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:31,153 INFO L705 BuchiCegarLoop]: Abstraction has 1458 states and 2258 transitions. [2018-11-10 08:03:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states and 2258 transitions. [2018-11-10 08:03:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2018-11-10 08:03:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-11-10 08:03:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2258 transitions. [2018-11-10 08:03:31,167 INFO L728 BuchiCegarLoop]: Abstraction has 1458 states and 2258 transitions. [2018-11-10 08:03:31,167 INFO L608 BuchiCegarLoop]: Abstraction has 1458 states and 2258 transitions. [2018-11-10 08:03:31,167 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:03:31,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1458 states and 2258 transitions. [2018-11-10 08:03:31,170 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1456 [2018-11-10 08:03:31,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:31,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:31,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:31,171 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, 1, 1] [2018-11-10 08:03:31,171 INFO L793 eck$LassoCheckResult]: Stem: 4396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4371#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 4372#L223-1 [2018-11-10 08:03:31,172 INFO L795 eck$LassoCheckResult]: Loop: 4372#L223-1 assume true; 4497#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4495#L56 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;main_~lk15~0 := 0; 4492#L91 assume !(main_~p1~0 != 0); 4488#L91-2 assume !(main_~p2~0 != 0); 4484#L95-1 assume !(main_~p3~0 != 0); 4485#L99-1 assume !(main_~p4~0 != 0); 4578#L103-1 assume !(main_~p5~0 != 0); 4576#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 4574#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 4572#L115-1 assume !(main_~p8~0 != 0); 4570#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 4568#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 4566#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 4564#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 4562#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 4560#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 4558#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 4554#L147-1 assume !(main_~p1~0 != 0); 4550#L153-1 assume !(main_~p2~0 != 0); 4548#L158-1 assume !(main_~p3~0 != 0); 4545#L163-1 assume !(main_~p4~0 != 0); 4541#L168-1 assume !(main_~p5~0 != 0); 4538#L173-1 assume !(main_~p6~0 != 0); 4534#L178-1 assume !(main_~p7~0 != 0); 4530#L183-1 assume !(main_~p8~0 != 0); 4526#L188-1 assume !(main_~p9~0 != 0); 4522#L193-1 assume !(main_~p10~0 != 0); 4518#L198-1 assume !(main_~p11~0 != 0); 4514#L203-1 assume !(main_~p12~0 != 0); 4510#L208-1 assume !(main_~p13~0 != 0); 4506#L213-1 assume !(main_~p14~0 != 0); 4502#L218-1 assume !(main_~p15~0 != 0); 4372#L223-1 [2018-11-10 08:03:31,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 08:03:31,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1486179218, now seen corresponding path program 1 times [2018-11-10 08:03:31,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:31,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:31,219 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 08:03:31,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:31,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:31,219 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:31,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:31,220 INFO L87 Difference]: Start difference. First operand 1458 states and 2258 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-11-10 08:03:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:31,242 INFO L93 Difference]: Finished difference Result 2882 states and 4418 transitions. [2018-11-10 08:03:31,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:31,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4418 transitions. [2018-11-10 08:03:31,257 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2880 [2018-11-10 08:03:31,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4418 transitions. [2018-11-10 08:03:31,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2018-11-10 08:03:31,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2018-11-10 08:03:31,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4418 transitions. [2018-11-10 08:03:31,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:31,269 INFO L705 BuchiCegarLoop]: Abstraction has 2882 states and 4418 transitions. [2018-11-10 08:03:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4418 transitions. [2018-11-10 08:03:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2018-11-10 08:03:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2018-11-10 08:03:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4418 transitions. [2018-11-10 08:03:31,301 INFO L728 BuchiCegarLoop]: Abstraction has 2882 states and 4418 transitions. [2018-11-10 08:03:31,301 INFO L608 BuchiCegarLoop]: Abstraction has 2882 states and 4418 transitions. [2018-11-10 08:03:31,301 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 08:03:31,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4418 transitions. [2018-11-10 08:03:31,309 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2880 [2018-11-10 08:03:31,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:31,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:31,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:31,310 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, 1, 1] [2018-11-10 08:03:31,311 INFO L793 eck$LassoCheckResult]: Stem: 8742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8717#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 8718#L223-1 [2018-11-10 08:03:31,311 INFO L795 eck$LassoCheckResult]: Loop: 8718#L223-1 assume true; 8828#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 8826#L56 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;main_~lk15~0 := 0; 8824#L91 assume !(main_~p1~0 != 0); 8820#L91-2 assume !(main_~p2~0 != 0); 8816#L95-1 assume !(main_~p3~0 != 0); 8812#L99-1 assume !(main_~p4~0 != 0); 8808#L103-1 assume !(main_~p5~0 != 0); 8804#L107-1 assume !(main_~p6~0 != 0); 8802#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 8800#L115-1 assume !(main_~p8~0 != 0); 8798#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 8796#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 8794#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 8792#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 8790#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 8788#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 8786#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 8783#L147-1 assume !(main_~p1~0 != 0); 8784#L153-1 assume !(main_~p2~0 != 0); 8879#L158-1 assume !(main_~p3~0 != 0); 8875#L163-1 assume !(main_~p4~0 != 0); 8871#L168-1 assume !(main_~p5~0 != 0); 8867#L173-1 assume !(main_~p6~0 != 0); 8864#L178-1 assume !(main_~p7~0 != 0); 8860#L183-1 assume !(main_~p8~0 != 0); 8856#L188-1 assume !(main_~p9~0 != 0); 8852#L193-1 assume !(main_~p10~0 != 0); 8848#L198-1 assume !(main_~p11~0 != 0); 8844#L203-1 assume !(main_~p12~0 != 0); 8840#L208-1 assume !(main_~p13~0 != 0); 8836#L213-1 assume !(main_~p14~0 != 0); 8832#L218-1 assume !(main_~p15~0 != 0); 8718#L223-1 [2018-11-10 08:03:31,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 08:03:31,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1345630608, now seen corresponding path program 1 times [2018-11-10 08:03:31,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:31,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:31,347 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 08:03:31,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:31,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:31,348 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:31,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:31,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:31,348 INFO L87 Difference]: Start difference. First operand 2882 states and 4418 transitions. cyclomatic complexity: 1600 Second operand 3 states. [2018-11-10 08:03:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:31,375 INFO L93 Difference]: Finished difference Result 5698 states and 8642 transitions. [2018-11-10 08:03:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:31,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5698 states and 8642 transitions. [2018-11-10 08:03:31,395 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5696 [2018-11-10 08:03:31,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5698 states to 5698 states and 8642 transitions. [2018-11-10 08:03:31,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5698 [2018-11-10 08:03:31,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5698 [2018-11-10 08:03:31,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5698 states and 8642 transitions. [2018-11-10 08:03:31,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:31,419 INFO L705 BuchiCegarLoop]: Abstraction has 5698 states and 8642 transitions. [2018-11-10 08:03:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states and 8642 transitions. [2018-11-10 08:03:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5698. [2018-11-10 08:03:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5698 states. [2018-11-10 08:03:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 8642 transitions. [2018-11-10 08:03:31,483 INFO L728 BuchiCegarLoop]: Abstraction has 5698 states and 8642 transitions. [2018-11-10 08:03:31,483 INFO L608 BuchiCegarLoop]: Abstraction has 5698 states and 8642 transitions. [2018-11-10 08:03:31,483 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 08:03:31,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5698 states and 8642 transitions. [2018-11-10 08:03:31,498 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5696 [2018-11-10 08:03:31,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:31,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:31,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:31,499 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, 1, 1] [2018-11-10 08:03:31,499 INFO L793 eck$LassoCheckResult]: Stem: 17326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17303#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 17304#L223-1 [2018-11-10 08:03:31,499 INFO L795 eck$LassoCheckResult]: Loop: 17304#L223-1 assume true; 17467#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 17463#L56 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;main_~lk15~0 := 0; 17459#L91 assume !(main_~p1~0 != 0); 17452#L91-2 assume !(main_~p2~0 != 0); 17444#L95-1 assume !(main_~p3~0 != 0); 17436#L99-1 assume !(main_~p4~0 != 0); 17428#L103-1 assume !(main_~p5~0 != 0); 17420#L107-1 assume !(main_~p6~0 != 0); 17413#L111-1 assume !(main_~p7~0 != 0); 17414#L115-1 assume !(main_~p8~0 != 0); 17404#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 17405#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 17396#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 17397#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 17388#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 17389#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 17380#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 17381#L147-1 assume !(main_~p1~0 != 0); 17533#L153-1 assume !(main_~p2~0 != 0); 17529#L158-1 assume !(main_~p3~0 != 0); 17517#L163-1 assume !(main_~p4~0 != 0); 17515#L168-1 assume !(main_~p5~0 != 0); 17513#L173-1 assume !(main_~p6~0 != 0); 17511#L178-1 assume !(main_~p7~0 != 0); 17510#L183-1 assume !(main_~p8~0 != 0); 17508#L188-1 assume !(main_~p9~0 != 0); 17506#L193-1 assume !(main_~p10~0 != 0); 17504#L198-1 assume !(main_~p11~0 != 0); 17502#L203-1 assume !(main_~p12~0 != 0); 17500#L208-1 assume !(main_~p13~0 != 0); 17498#L213-1 assume !(main_~p14~0 != 0); 17476#L218-1 assume !(main_~p15~0 != 0); 17304#L223-1 [2018-11-10 08:03:31,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 08:03:31,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1479644114, now seen corresponding path program 1 times [2018-11-10 08:03:31,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:31,536 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 08:03:31,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:31,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:31,537 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:31,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:31,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:31,537 INFO L87 Difference]: Start difference. First operand 5698 states and 8642 transitions. cyclomatic complexity: 3072 Second operand 3 states. [2018-11-10 08:03:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:31,578 INFO L93 Difference]: Finished difference Result 11266 states and 16898 transitions. [2018-11-10 08:03:31,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:31,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11266 states and 16898 transitions. [2018-11-10 08:03:31,609 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11264 [2018-11-10 08:03:31,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11266 states to 11266 states and 16898 transitions. [2018-11-10 08:03:31,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11266 [2018-11-10 08:03:31,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11266 [2018-11-10 08:03:31,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11266 states and 16898 transitions. [2018-11-10 08:03:31,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:31,653 INFO L705 BuchiCegarLoop]: Abstraction has 11266 states and 16898 transitions. [2018-11-10 08:03:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states and 16898 transitions. [2018-11-10 08:03:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 11266. [2018-11-10 08:03:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11266 states. [2018-11-10 08:03:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11266 states to 11266 states and 16898 transitions. [2018-11-10 08:03:31,829 INFO L728 BuchiCegarLoop]: Abstraction has 11266 states and 16898 transitions. [2018-11-10 08:03:31,829 INFO L608 BuchiCegarLoop]: Abstraction has 11266 states and 16898 transitions. [2018-11-10 08:03:31,829 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 08:03:31,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11266 states and 16898 transitions. [2018-11-10 08:03:31,858 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11264 [2018-11-10 08:03:31,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:31,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:31,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:31,859 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, 1, 1] [2018-11-10 08:03:31,859 INFO L793 eck$LassoCheckResult]: Stem: 34298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 34273#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 34274#L223-1 [2018-11-10 08:03:31,859 INFO L795 eck$LassoCheckResult]: Loop: 34274#L223-1 assume true; 34605#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 34603#L56 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;main_~lk15~0 := 0; 34598#L91 assume !(main_~p1~0 != 0); 34564#L91-2 assume !(main_~p2~0 != 0); 34560#L95-1 assume !(main_~p3~0 != 0); 34556#L99-1 assume !(main_~p4~0 != 0); 34444#L103-1 assume !(main_~p5~0 != 0); 34440#L107-1 assume !(main_~p6~0 != 0); 34392#L111-1 assume !(main_~p7~0 != 0); 34393#L115-1 assume !(main_~p8~0 != 0); 34374#L119-1 assume !(main_~p9~0 != 0); 34375#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 34679#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 34680#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 34671#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 34672#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 34663#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 34664#L147-1 assume !(main_~p1~0 != 0); 34700#L153-1 assume !(main_~p2~0 != 0); 34696#L158-1 assume !(main_~p3~0 != 0); 34632#L163-1 assume !(main_~p4~0 != 0); 34633#L168-1 assume !(main_~p5~0 != 0); 34622#L173-1 assume !(main_~p6~0 != 0); 34624#L178-1 assume !(main_~p7~0 != 0); 34691#L183-1 assume !(main_~p8~0 != 0); 34621#L188-1 assume !(main_~p9~0 != 0); 34620#L193-1 assume !(main_~p10~0 != 0); 34618#L198-1 assume !(main_~p11~0 != 0); 34616#L203-1 assume !(main_~p12~0 != 0); 34614#L208-1 assume !(main_~p13~0 != 0); 34612#L213-1 assume !(main_~p14~0 != 0); 34610#L218-1 assume !(main_~p15~0 != 0); 34274#L223-1 [2018-11-10 08:03:31,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 08:03:31,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:31,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1260789396, now seen corresponding path program 1 times [2018-11-10 08:03:31,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:31,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:31,888 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 08:03:31,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:31,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:31,889 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:31,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:31,889 INFO L87 Difference]: Start difference. First operand 11266 states and 16898 transitions. cyclomatic complexity: 5888 Second operand 3 states. [2018-11-10 08:03:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:31,948 INFO L93 Difference]: Finished difference Result 22274 states and 33026 transitions. [2018-11-10 08:03:31,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:31,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22274 states and 33026 transitions. [2018-11-10 08:03:32,024 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 22272 [2018-11-10 08:03:32,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22274 states to 22274 states and 33026 transitions. [2018-11-10 08:03:32,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22274 [2018-11-10 08:03:32,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22274 [2018-11-10 08:03:32,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22274 states and 33026 transitions. [2018-11-10 08:03:32,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:32,115 INFO L705 BuchiCegarLoop]: Abstraction has 22274 states and 33026 transitions. [2018-11-10 08:03:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22274 states and 33026 transitions. [2018-11-10 08:03:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22274 to 22274. [2018-11-10 08:03:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22274 states. [2018-11-10 08:03:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22274 states to 22274 states and 33026 transitions. [2018-11-10 08:03:32,354 INFO L728 BuchiCegarLoop]: Abstraction has 22274 states and 33026 transitions. [2018-11-10 08:03:32,354 INFO L608 BuchiCegarLoop]: Abstraction has 22274 states and 33026 transitions. [2018-11-10 08:03:32,354 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 08:03:32,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22274 states and 33026 transitions. [2018-11-10 08:03:32,407 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 22272 [2018-11-10 08:03:32,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:32,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:32,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:32,408 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, 1, 1] [2018-11-10 08:03:32,408 INFO L793 eck$LassoCheckResult]: Stem: 67847#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 67819#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 67820#L223-1 [2018-11-10 08:03:32,409 INFO L795 eck$LassoCheckResult]: Loop: 67820#L223-1 assume true; 67984#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 67982#L56 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;main_~lk15~0 := 0; 67980#L91 assume !(main_~p1~0 != 0); 67976#L91-2 assume !(main_~p2~0 != 0); 67972#L95-1 assume !(main_~p3~0 != 0); 67968#L99-1 assume !(main_~p4~0 != 0); 67964#L103-1 assume !(main_~p5~0 != 0); 67960#L107-1 assume !(main_~p6~0 != 0); 67956#L111-1 assume !(main_~p7~0 != 0); 67954#L115-1 assume !(main_~p8~0 != 0); 67950#L119-1 assume !(main_~p9~0 != 0); 67946#L123-1 assume !(main_~p10~0 != 0); 67944#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 67942#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 67940#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 67938#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 67936#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 67933#L147-1 assume !(main_~p1~0 != 0); 67934#L153-1 assume !(main_~p2~0 != 0); 68035#L158-1 assume !(main_~p3~0 != 0); 68031#L163-1 assume !(main_~p4~0 != 0); 68027#L168-1 assume !(main_~p5~0 != 0); 68023#L173-1 assume !(main_~p6~0 != 0); 68019#L178-1 assume !(main_~p7~0 != 0); 68016#L183-1 assume !(main_~p8~0 != 0); 68011#L188-1 assume !(main_~p9~0 != 0); 68007#L193-1 assume !(main_~p10~0 != 0); 68004#L198-1 assume !(main_~p11~0 != 0); 68000#L203-1 assume !(main_~p12~0 != 0); 67996#L208-1 assume !(main_~p13~0 != 0); 67992#L213-1 assume !(main_~p14~0 != 0); 67988#L218-1 assume !(main_~p15~0 != 0); 67820#L223-1 [2018-11-10 08:03:32,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 08:03:32,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:32,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:32,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:32,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash -838087570, now seen corresponding path program 1 times [2018-11-10 08:03:32,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:32,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:32,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:32,436 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 08:03:32,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:32,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:32,436 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:32,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:32,437 INFO L87 Difference]: Start difference. First operand 22274 states and 33026 transitions. cyclomatic complexity: 11264 Second operand 3 states. [2018-11-10 08:03:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:32,528 INFO L93 Difference]: Finished difference Result 44034 states and 64514 transitions. [2018-11-10 08:03:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:32,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44034 states and 64514 transitions. [2018-11-10 08:03:32,679 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 44032 [2018-11-10 08:03:32,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44034 states to 44034 states and 64514 transitions. [2018-11-10 08:03:32,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44034 [2018-11-10 08:03:32,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44034 [2018-11-10 08:03:32,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44034 states and 64514 transitions. [2018-11-10 08:03:32,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:32,862 INFO L705 BuchiCegarLoop]: Abstraction has 44034 states and 64514 transitions. [2018-11-10 08:03:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44034 states and 64514 transitions. [2018-11-10 08:03:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44034 to 44034. [2018-11-10 08:03:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44034 states. [2018-11-10 08:03:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44034 states to 44034 states and 64514 transitions. [2018-11-10 08:03:33,299 INFO L728 BuchiCegarLoop]: Abstraction has 44034 states and 64514 transitions. [2018-11-10 08:03:33,299 INFO L608 BuchiCegarLoop]: Abstraction has 44034 states and 64514 transitions. [2018-11-10 08:03:33,299 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 08:03:33,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44034 states and 64514 transitions. [2018-11-10 08:03:33,380 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 44032 [2018-11-10 08:03:33,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:33,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:33,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:33,381 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, 1, 1] [2018-11-10 08:03:33,381 INFO L793 eck$LassoCheckResult]: Stem: 134160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 134133#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 134134#L223-1 [2018-11-10 08:03:33,381 INFO L795 eck$LassoCheckResult]: Loop: 134134#L223-1 assume true; 135190#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 135186#L56 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;main_~lk15~0 := 0; 135178#L91 assume !(main_~p1~0 != 0); 135174#L91-2 assume !(main_~p2~0 != 0); 135166#L95-1 assume !(main_~p3~0 != 0); 135158#L99-1 assume !(main_~p4~0 != 0); 135152#L103-1 assume !(main_~p5~0 != 0); 135153#L107-1 assume !(main_~p6~0 != 0); 135297#L111-1 assume !(main_~p7~0 != 0); 135296#L115-1 assume !(main_~p8~0 != 0); 135294#L119-1 assume !(main_~p9~0 != 0); 135288#L123-1 assume !(main_~p10~0 != 0); 135283#L127-1 assume !(main_~p11~0 != 0); 135280#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 135277#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 135275#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 135272#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 135270#L147-1 assume !(main_~p1~0 != 0); 135268#L153-1 assume !(main_~p2~0 != 0); 135265#L158-1 assume !(main_~p3~0 != 0); 135105#L163-1 assume !(main_~p4~0 != 0); 135077#L168-1 assume !(main_~p5~0 != 0); 135073#L173-1 assume !(main_~p6~0 != 0); 135068#L178-1 assume !(main_~p7~0 != 0); 135055#L183-1 assume !(main_~p8~0 != 0); 135043#L188-1 assume !(main_~p9~0 != 0); 135031#L193-1 assume !(main_~p10~0 != 0); 135033#L198-1 assume !(main_~p11~0 != 0); 135222#L203-1 assume !(main_~p12~0 != 0); 135214#L208-1 assume !(main_~p13~0 != 0); 135206#L213-1 assume !(main_~p14~0 != 0); 135198#L218-1 assume !(main_~p15~0 != 0); 134134#L223-1 [2018-11-10 08:03:33,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 08:03:33,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:33,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:33,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:33,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:33,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1655736020, now seen corresponding path program 1 times [2018-11-10 08:03:33,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:33,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:33,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:33,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:33,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:33,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 08:03:33,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:33,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:33,408 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:33,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:33,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:33,408 INFO L87 Difference]: Start difference. First operand 44034 states and 64514 transitions. cyclomatic complexity: 21504 Second operand 3 states. [2018-11-10 08:03:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:33,540 INFO L93 Difference]: Finished difference Result 87042 states and 125954 transitions. [2018-11-10 08:03:33,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:33,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87042 states and 125954 transitions. [2018-11-10 08:03:33,774 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 87040 [2018-11-10 08:03:34,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87042 states to 87042 states and 125954 transitions. [2018-11-10 08:03:34,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87042 [2018-11-10 08:03:34,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87042 [2018-11-10 08:03:34,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87042 states and 125954 transitions. [2018-11-10 08:03:34,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:34,153 INFO L705 BuchiCegarLoop]: Abstraction has 87042 states and 125954 transitions. [2018-11-10 08:03:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87042 states and 125954 transitions. [2018-11-10 08:03:34,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87042 to 87042. [2018-11-10 08:03:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87042 states. [2018-11-10 08:03:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87042 states to 87042 states and 125954 transitions. [2018-11-10 08:03:34,898 INFO L728 BuchiCegarLoop]: Abstraction has 87042 states and 125954 transitions. [2018-11-10 08:03:34,898 INFO L608 BuchiCegarLoop]: Abstraction has 87042 states and 125954 transitions. [2018-11-10 08:03:34,898 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 08:03:34,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87042 states and 125954 transitions. [2018-11-10 08:03:35,043 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 87040 [2018-11-10 08:03:35,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:35,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:35,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:35,045 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, 1, 1] [2018-11-10 08:03:35,045 INFO L793 eck$LassoCheckResult]: Stem: 265239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 265215#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 265216#L223-1 [2018-11-10 08:03:35,045 INFO L795 eck$LassoCheckResult]: Loop: 265216#L223-1 assume true; 266051#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 266049#L56 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;main_~lk15~0 := 0; 266047#L91 assume !(main_~p1~0 != 0); 266045#L91-2 assume !(main_~p2~0 != 0); 266040#L95-1 assume !(main_~p3~0 != 0); 266032#L99-1 assume !(main_~p4~0 != 0); 266024#L103-1 assume !(main_~p5~0 != 0); 266016#L107-1 assume !(main_~p6~0 != 0); 266010#L111-1 assume !(main_~p7~0 != 0); 266007#L115-1 assume !(main_~p8~0 != 0); 266002#L119-1 assume !(main_~p9~0 != 0); 265994#L123-1 assume !(main_~p10~0 != 0); 265986#L127-1 assume !(main_~p11~0 != 0); 265978#L131-1 assume !(main_~p12~0 != 0); 265971#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 265967#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 265963#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 265955#L147-1 assume !(main_~p1~0 != 0); 265947#L153-1 assume !(main_~p2~0 != 0); 265948#L158-1 assume !(main_~p3~0 != 0); 265924#L163-1 assume !(main_~p4~0 != 0); 265925#L168-1 assume !(main_~p5~0 != 0); 265900#L173-1 assume !(main_~p6~0 != 0); 265902#L178-1 assume !(main_~p7~0 != 0); 266083#L183-1 assume !(main_~p8~0 != 0); 266078#L188-1 assume !(main_~p9~0 != 0); 266074#L193-1 assume !(main_~p10~0 != 0); 266070#L198-1 assume !(main_~p11~0 != 0); 266066#L203-1 assume !(main_~p12~0 != 0); 266063#L208-1 assume !(main_~p13~0 != 0); 266059#L213-1 assume !(main_~p14~0 != 0); 266055#L218-1 assume !(main_~p15~0 != 0); 265216#L223-1 [2018-11-10 08:03:35,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2018-11-10 08:03:35,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:35,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:35,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash 950287534, now seen corresponding path program 1 times [2018-11-10 08:03:35,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:35,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:35,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:35,069 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 08:03:35,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:35,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:35,069 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:35,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:35,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:35,070 INFO L87 Difference]: Start difference. First operand 87042 states and 125954 transitions. cyclomatic complexity: 40960 Second operand 3 states. [2018-11-10 08:03:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:35,319 INFO L93 Difference]: Finished difference Result 172034 states and 245762 transitions. [2018-11-10 08:03:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:35,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172034 states and 245762 transitions. [2018-11-10 08:03:35,771 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 172032 [2018-11-10 08:03:36,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172034 states to 172034 states and 245762 transitions. [2018-11-10 08:03:36,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172034 [2018-11-10 08:03:36,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172034 [2018-11-10 08:03:36,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172034 states and 245762 transitions. [2018-11-10 08:03:36,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:36,260 INFO L705 BuchiCegarLoop]: Abstraction has 172034 states and 245762 transitions. [2018-11-10 08:03:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172034 states and 245762 transitions. [2018-11-10 08:03:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172034 to 172034. [2018-11-10 08:03:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172034 states. [2018-11-10 08:03:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172034 states to 172034 states and 245762 transitions. [2018-11-10 08:03:40,660 INFO L728 BuchiCegarLoop]: Abstraction has 172034 states and 245762 transitions. [2018-11-10 08:03:40,660 INFO L608 BuchiCegarLoop]: Abstraction has 172034 states and 245762 transitions. [2018-11-10 08:03:40,660 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 08:03:40,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172034 states and 245762 transitions. [2018-11-10 08:03:40,964 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 172032 [2018-11-10 08:03:40,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:40,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:40,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:40,965 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, 1, 1] [2018-11-10 08:03:40,965 INFO L793 eck$LassoCheckResult]: Stem: 524324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 524296#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 524297#L223-1 [2018-11-10 08:03:40,965 INFO L795 eck$LassoCheckResult]: Loop: 524297#L223-1 assume true; 524752#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 524751#L56 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;main_~lk15~0 := 0; 524749#L91 assume !(main_~p1~0 != 0); 524747#L91-2 assume !(main_~p2~0 != 0); 524745#L95-1 assume !(main_~p3~0 != 0); 524743#L99-1 assume !(main_~p4~0 != 0); 524741#L103-1 assume !(main_~p5~0 != 0); 524739#L107-1 assume !(main_~p6~0 != 0); 524737#L111-1 assume !(main_~p7~0 != 0); 524735#L115-1 assume !(main_~p8~0 != 0); 524732#L119-1 assume !(main_~p9~0 != 0); 524728#L123-1 assume !(main_~p10~0 != 0); 524724#L127-1 assume !(main_~p11~0 != 0); 524720#L131-1 assume !(main_~p12~0 != 0); 524716#L135-1 assume !(main_~p13~0 != 0); 524717#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 524705#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 524706#L147-1 assume !(main_~p1~0 != 0); 524693#L153-1 assume !(main_~p2~0 != 0); 524694#L158-1 assume !(main_~p3~0 != 0); 524677#L163-1 assume !(main_~p4~0 != 0); 524678#L168-1 assume !(main_~p5~0 != 0); 524664#L173-1 assume !(main_~p6~0 != 0); 524666#L178-1 assume !(main_~p7~0 != 0); 524650#L183-1 assume !(main_~p8~0 != 0); 524649#L188-1 assume !(main_~p9~0 != 0); 524634#L193-1 assume !(main_~p10~0 != 0); 524636#L198-1 assume !(main_~p11~0 != 0); 524623#L203-1 assume !(main_~p12~0 != 0); 524625#L208-1 assume !(main_~p13~0 != 0); 524756#L213-1 assume !(main_~p14~0 != 0); 524754#L218-1 assume !(main_~p15~0 != 0); 524297#L223-1 [2018-11-10 08:03:40,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2018-11-10 08:03:40,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:40,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:40,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:40,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1043857172, now seen corresponding path program 1 times [2018-11-10 08:03:40,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:40,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:40,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:40,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:40,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:40,999 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 08:03:41,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:41,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:03:41,000 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:41,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:41,000 INFO L87 Difference]: Start difference. First operand 172034 states and 245762 transitions. cyclomatic complexity: 77824 Second operand 3 states. [2018-11-10 08:03:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:41,534 INFO L93 Difference]: Finished difference Result 339970 states and 479234 transitions. [2018-11-10 08:03:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:41,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 339970 states and 479234 transitions. [2018-11-10 08:03:42,427 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 339968 [2018-11-10 08:03:43,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 339970 states to 339970 states and 479234 transitions. [2018-11-10 08:03:43,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339970 [2018-11-10 08:03:43,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339970 [2018-11-10 08:03:43,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 339970 states and 479234 transitions. [2018-11-10 08:03:43,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:43,710 INFO L705 BuchiCegarLoop]: Abstraction has 339970 states and 479234 transitions. [2018-11-10 08:03:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339970 states and 479234 transitions. [2018-11-10 08:03:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339970 to 339970. [2018-11-10 08:03:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339970 states. [2018-11-10 08:03:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339970 states to 339970 states and 479234 transitions. [2018-11-10 08:03:46,452 INFO L728 BuchiCegarLoop]: Abstraction has 339970 states and 479234 transitions. [2018-11-10 08:03:46,453 INFO L608 BuchiCegarLoop]: Abstraction has 339970 states and 479234 transitions. [2018-11-10 08:03:46,453 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 08:03:46,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339970 states and 479234 transitions. [2018-11-10 08:03:47,142 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 339968 [2018-11-10 08:03:47,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:03:47,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:03:47,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:03:47,145 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, 1, 1] [2018-11-10 08:03:47,145 INFO L793 eck$LassoCheckResult]: Stem: 1036333#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1036306#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1036307#L223-1 [2018-11-10 08:03:47,145 INFO L795 eck$LassoCheckResult]: Loop: 1036307#L223-1 assume true; 1036639#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1036638#L56 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;main_~lk15~0 := 0; 1036636#L91 assume !(main_~p1~0 != 0); 1036634#L91-2 assume !(main_~p2~0 != 0); 1036632#L95-1 assume !(main_~p3~0 != 0); 1036630#L99-1 assume !(main_~p4~0 != 0); 1036628#L103-1 assume !(main_~p5~0 != 0); 1036626#L107-1 assume !(main_~p6~0 != 0); 1036623#L111-1 assume !(main_~p7~0 != 0); 1036621#L115-1 assume !(main_~p8~0 != 0); 1036617#L119-1 assume !(main_~p9~0 != 0); 1036613#L123-1 assume !(main_~p10~0 != 0); 1036609#L127-1 assume !(main_~p11~0 != 0); 1036605#L131-1 assume !(main_~p12~0 != 0); 1036601#L135-1 assume !(main_~p13~0 != 0); 1036598#L139-1 assume !(main_~p14~0 != 0); 1036599#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 1036588#L147-1 assume !(main_~p1~0 != 0); 1036589#L153-1 assume !(main_~p2~0 != 0); 1036576#L158-1 assume !(main_~p3~0 != 0); 1036578#L163-1 assume !(main_~p4~0 != 0); 1036564#L168-1 assume !(main_~p5~0 != 0); 1036565#L173-1 assume !(main_~p6~0 != 0); 1036552#L178-1 assume !(main_~p7~0 != 0); 1036554#L183-1 assume !(main_~p8~0 != 0); 1036540#L188-1 assume !(main_~p9~0 != 0); 1036542#L193-1 assume !(main_~p10~0 != 0); 1036531#L198-1 assume !(main_~p11~0 != 0); 1036532#L203-1 assume !(main_~p12~0 != 0); 1036519#L208-1 assume !(main_~p13~0 != 0); 1036521#L213-1 assume !(main_~p14~0 != 0); 1036641#L218-1 assume !(main_~p15~0 != 0); 1036307#L223-1 [2018-11-10 08:03:47,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2018-11-10 08:03:47,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:47,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:03:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:03:47,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:03:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1662762222, now seen corresponding path program 1 times [2018-11-10 08:03:47,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:03:47,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:03:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:47,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:03:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:03:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:03:47,171 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 08:03:47,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:03:47,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:03:47,171 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:03:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:03:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:03:47,172 INFO L87 Difference]: Start difference. First operand 339970 states and 479234 transitions. cyclomatic complexity: 147456 Second operand 3 states. [2018-11-10 08:03:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:03:49,381 INFO L93 Difference]: Finished difference Result 671746 states and 933890 transitions. [2018-11-10 08:03:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:03:49,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 671746 states and 933890 transitions. [2018-11-10 08:03:51,068 INFO L131 ngComponentsAnalysis]: Automaton has 16384 accepting balls. 671744 [2018-11-10 08:03:51,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 671746 states to 671746 states and 933890 transitions. [2018-11-10 08:03:51,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 671746 [2018-11-10 08:03:59,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 671746 [2018-11-10 08:03:59,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 671746 states and 933890 transitions. [2018-11-10 08:03:59,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:03:59,173 INFO L705 BuchiCegarLoop]: Abstraction has 671746 states and 933890 transitions. [2018-11-10 08:03:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671746 states and 933890 transitions. [2018-11-10 08:04:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671746 to 671746. [2018-11-10 08:04:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671746 states. [2018-11-10 08:04:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671746 states to 671746 states and 933890 transitions. [2018-11-10 08:04:03,804 INFO L728 BuchiCegarLoop]: Abstraction has 671746 states and 933890 transitions. [2018-11-10 08:04:03,804 INFO L608 BuchiCegarLoop]: Abstraction has 671746 states and 933890 transitions. [2018-11-10 08:04:03,805 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 08:04:03,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671746 states and 933890 transitions. [2018-11-10 08:04:05,708 INFO L131 ngComponentsAnalysis]: Automaton has 16384 accepting balls. 671744 [2018-11-10 08:04:05,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:05,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:05,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:04:05,713 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, 1, 1] [2018-11-10 08:04:05,713 INFO L793 eck$LassoCheckResult]: Stem: 2048056#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2048028#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_#t~nondet15, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2048029#L223-1 [2018-11-10 08:04:05,713 INFO L795 eck$LassoCheckResult]: Loop: 2048029#L223-1 assume true; 2049010#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2049007#L56 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;main_~lk15~0 := 0; 2049003#L91 assume !(main_~p1~0 != 0); 2049000#L91-2 assume !(main_~p2~0 != 0); 2048929#L95-1 assume !(main_~p3~0 != 0); 2048930#L99-1 assume !(main_~p4~0 != 0); 2049063#L103-1 assume !(main_~p5~0 != 0); 2049194#L107-1 assume !(main_~p6~0 != 0); 2049191#L111-1 assume !(main_~p7~0 != 0); 2049188#L115-1 assume !(main_~p8~0 != 0); 2049183#L119-1 assume !(main_~p9~0 != 0); 2049179#L123-1 assume !(main_~p10~0 != 0); 2049173#L127-1 assume !(main_~p11~0 != 0); 2049167#L131-1 assume !(main_~p12~0 != 0); 2049161#L135-1 assume !(main_~p13~0 != 0); 2049159#L139-1 assume !(main_~p14~0 != 0); 2048375#L143-1 assume !(main_~p15~0 != 0); 2048377#L147-1 assume !(main_~p1~0 != 0); 2049150#L153-1 assume !(main_~p2~0 != 0); 2048773#L158-1 assume !(main_~p3~0 != 0); 2048757#L163-1 assume !(main_~p4~0 != 0); 2048758#L168-1 assume !(main_~p5~0 != 0); 2048734#L173-1 assume !(main_~p6~0 != 0); 2048736#L178-1 assume !(main_~p7~0 != 0); 2049041#L183-1 assume !(main_~p8~0 != 0); 2049036#L188-1 assume !(main_~p9~0 != 0); 2049032#L193-1 assume !(main_~p10~0 != 0); 2049028#L198-1 assume !(main_~p11~0 != 0); 2049026#L203-1 assume !(main_~p12~0 != 0); 2049023#L208-1 assume !(main_~p13~0 != 0); 2049019#L213-1 assume !(main_~p14~0 != 0); 2049015#L218-1 assume !(main_~p15~0 != 0); 2048029#L223-1 [2018-11-10 08:04:05,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 15 times [2018-11-10 08:04:05,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:05,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:05,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:05,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash 641693868, now seen corresponding path program 1 times [2018-11-10 08:04:05,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:05,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:05,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:05,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash -677481174, now seen corresponding path program 1 times [2018-11-10 08:04:05,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:05,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:05,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:05,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:05,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:05,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:04:05 BoogieIcfgContainer [2018-11-10 08:04:05,923 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:04:05,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:04:05,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:04:05,924 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:04:05,924 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:03:30" (3/4) ... [2018-11-10 08:04:05,927 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 08:04:05,966 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6cccdc0f-0f7f-4423-9b0a-3bd85497e933/bin-2019/uautomizer/witness.graphml [2018-11-10 08:04:05,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:04:05,967 INFO L168 Benchmark]: Toolchain (without parser) took 35962.54 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 960.2 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-10 08:04:05,968 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:04:05,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:04:05,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.33 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:04:05,969 INFO L168 Benchmark]: Boogie Preprocessor took 20.53 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 944.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:04:05,969 INFO L168 Benchmark]: RCFGBuilder took 301.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:04:05,970 INFO L168 Benchmark]: BuchiAutomizer took 35413.23 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-10 08:04:05,970 INFO L168 Benchmark]: Witness Printer took 43.19 ms. Allocated memory is still 6.2 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:04:05,972 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.53 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 944.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 301.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 35413.23 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 43.19 ms. Allocated memory is still 6.2 GB. Free memory is still 2.8 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 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 671746 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 35.3s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 13.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 6.4s Buchi closure took 7.3s. Biggest automaton had 671746 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1675 SDtfs, 873 SDslu, 1054 SDs, 0 SdLazy, 70 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI14 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: 54]: 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@3b6b9af9=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26f7f34d=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d7cd6d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45f9f6dc=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bfcdfb6=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2abd389f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@489f931=0, p15=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d66c363=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31aed506=0, lk15=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@552d62cf=0, p14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c507b5b=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6666e88=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54122c19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f53b206=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c6900b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67efa586=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: 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; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; Loop: [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 [L91] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L99] COND FALSE !(p3 != 0) [L103] COND FALSE !(p4 != 0) [L107] COND FALSE !(p5 != 0) [L111] COND FALSE !(p6 != 0) [L115] COND FALSE !(p7 != 0) [L119] COND FALSE !(p8 != 0) [L123] COND FALSE !(p9 != 0) [L127] COND FALSE !(p10 != 0) [L131] COND FALSE !(p11 != 0) [L135] COND FALSE !(p12 != 0) [L139] COND FALSE !(p13 != 0) [L143] COND FALSE !(p14 != 0) [L147] COND FALSE !(p15 != 0) [L153] COND FALSE !(p1 != 0) [L158] COND FALSE !(p2 != 0) [L163] COND FALSE !(p3 != 0) [L168] COND FALSE !(p4 != 0) [L173] COND FALSE !(p5 != 0) [L178] COND FALSE !(p6 != 0) [L183] COND FALSE !(p7 != 0) [L188] COND FALSE !(p8 != 0) [L193] COND FALSE !(p9 != 0) [L198] COND FALSE !(p10 != 0) [L203] COND FALSE !(p11 != 0) [L208] COND FALSE !(p12 != 0) [L213] COND FALSE !(p13 != 0) [L218] COND FALSE !(p14 != 0) [L223] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...