./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/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 4c4a63b42b00dbfea9a5b040626d99ec84a4e61b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-09 01:19:25,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:19:25,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:19:25,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:19:25,702 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:19:25,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:19:25,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:19:25,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:19:25,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:19:25,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:19:25,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:19:25,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:19:25,707 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:19:25,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:19:25,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:19:25,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:19:25,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:19:25,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:19:25,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:19:25,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:19:25,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:19:25,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:19:25,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:19:25,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:19:25,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:19:25,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:19:25,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:19:25,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:19:25,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:19:25,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:19:25,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:19:25,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:19:25,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:19:25,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:19:25,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:19:25,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:19:25,718 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 01:19:25,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:19:25,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:19:25,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:19:25,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:19:25,727 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:19:25,727 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 01:19:25,727 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 01:19:25,727 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 01:19:25,727 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 01:19:25,727 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 01:19:25,727 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 01:19:25,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:19:25,728 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 01:19:25,729 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:19:25,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 01:19:25,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:19:25,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:19:25,729 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 01:19:25,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:19:25,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:19:25,729 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 01:19:25,730 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 01:19:25,730 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_300f5305-ddf6-4284-aa96-460977ec41db/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 -> 4c4a63b42b00dbfea9a5b040626d99ec84a4e61b [2018-12-09 01:19:25,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:19:25,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:19:25,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:19:25,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:19:25,757 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:19:25,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 01:19:25,792 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/data/fd592aafd/76e16fec4427434d87df1e4869ce61fa/FLAG177133c8f [2018-12-09 01:19:26,224 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:19:26,224 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/sv-benchmarks/c/locks/test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 01:19:26,228 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/data/fd592aafd/76e16fec4427434d87df1e4869ce61fa/FLAG177133c8f [2018-12-09 01:19:26,236 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/data/fd592aafd/76e16fec4427434d87df1e4869ce61fa [2018-12-09 01:19:26,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:19:26,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:19:26,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:19:26,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:19:26,241 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:19:26,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26, skipping insertion in model container [2018-12-09 01:19:26,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:19:26,259 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:19:26,348 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:19:26,351 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:19:26,367 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:19:26,376 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:19:26,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26 WrapperNode [2018-12-09 01:19:26,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:19:26,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:19:26,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:19:26,377 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:19:26,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:19:26,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:19:26,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:19:26,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:19:26,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... [2018-12-09 01:19:26,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:19:26,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:19:26,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:19:26,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:19:26,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/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-12-09 01:19:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:19:26,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:19:26,637 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:19:26,637 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 01:19:26,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:26 BoogieIcfgContainer [2018-12-09 01:19:26,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:19:26,638 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 01:19:26,638 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 01:19:26,640 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 01:19:26,641 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:19:26,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:19:26" (1/3) ... [2018-12-09 01:19:26,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ccf9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:19:26, skipping insertion in model container [2018-12-09 01:19:26,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:19:26,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:26" (2/3) ... [2018-12-09 01:19:26,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ccf9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:19:26, skipping insertion in model container [2018-12-09 01:19:26,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:19:26,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:26" (3/3) ... [2018-12-09 01:19:26,643 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_14_false-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 01:19:26,676 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:19:26,677 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 01:19:26,677 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 01:19:26,677 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 01:19:26,677 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:19:26,677 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:19:26,677 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 01:19:26,677 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:19:26,677 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 01:19:26,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-12-09 01:19:26,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-12-09 01:19:26,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:26,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:26,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:26,707 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] [2018-12-09 01:19:26,707 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 01:19:26,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-12-09 01:19:26,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-12-09 01:19:26,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:26,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:26,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:26,709 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] [2018-12-09 01:19:26,714 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 18#L209true [2018-12-09 01:19:26,714 INFO L796 eck$LassoCheckResult]: Loop: 18#L209true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L53true assume !(0 == main_~cond~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; 48#L86true assume 0 != main_~p1~0;main_~lk1~0 := 1; 34#L86-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 51#L90-1true assume !(0 != main_~p3~0); 43#L94-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 12#L98-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 4#L102-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 7#L106-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 25#L110-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 19#L114-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 35#L118-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 38#L122-1true assume !(0 != main_~p11~0); 32#L126-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 49#L130-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 40#L134-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 45#L138-1true assume !(0 != main_~p1~0); 28#L144-1true assume 0 != main_~p2~0; 23#L150true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 9#L149true assume !(0 != main_~p3~0); 27#L154-1true assume !(0 != main_~p4~0); 33#L159-1true assume !(0 != main_~p5~0); 16#L164-1true assume !(0 != main_~p6~0); 20#L169-1true assume !(0 != main_~p7~0); 50#L174-1true assume !(0 != main_~p8~0); 5#L179-1true assume !(0 != main_~p9~0); 36#L184-1true assume !(0 != main_~p10~0); 42#L189-1true assume !(0 != main_~p11~0); 24#L194-1true assume !(0 != main_~p12~0); 30#L199-1true assume !(0 != main_~p13~0); 11#L204-1true assume 0 != main_~p14~0; 31#L210true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 18#L209true [2018-12-09 01:19:26,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-09 01:19:26,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:26,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:26,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:26,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:26,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:26,779 INFO L82 PathProgramCache]: Analyzing trace with hash -878582343, now seen corresponding path program 1 times [2018-12-09 01:19:26,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:26,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:26,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:26,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:26,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:26,848 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-09 01:19:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:26,884 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2018-12-09 01:19:26,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:26,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 177 transitions. [2018-12-09 01:19:26,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2018-12-09 01:19:26,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 88 states and 138 transitions. [2018-12-09 01:19:26,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-12-09 01:19:26,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-12-09 01:19:26,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 138 transitions. [2018-12-09 01:19:26,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:26,892 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-12-09 01:19:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 138 transitions. [2018-12-09 01:19:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-09 01:19:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 01:19:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-12-09 01:19:26,912 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-12-09 01:19:26,912 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-12-09 01:19:26,912 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 01:19:26,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 138 transitions. [2018-12-09 01:19:26,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2018-12-09 01:19:26,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:26,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:26,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:26,914 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] [2018-12-09 01:19:26,914 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 169#L209 [2018-12-09 01:19:26,914 INFO L796 eck$LassoCheckResult]: Loop: 169#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 206#L53 assume !(0 == main_~cond~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; 207#L86 assume !(0 != main_~p1~0); 210#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 244#L90-1 assume !(0 != main_~p3~0); 243#L94-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 242#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 241#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 240#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 239#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 238#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 237#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 236#L122-1 assume !(0 != main_~p11~0); 235#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 234#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 233#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 232#L138-1 assume !(0 != main_~p1~0); 231#L144-1 assume 0 != main_~p2~0; 230#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 229#L149 assume !(0 != main_~p3~0); 227#L154-1 assume !(0 != main_~p4~0); 225#L159-1 assume !(0 != main_~p5~0); 193#L164-1 assume !(0 != main_~p6~0); 194#L169-1 assume !(0 != main_~p7~0); 160#L174-1 assume !(0 != main_~p8~0); 170#L179-1 assume !(0 != main_~p9~0); 171#L184-1 assume !(0 != main_~p10~0); 202#L189-1 assume !(0 != main_~p11~0); 192#L194-1 assume !(0 != main_~p12~0); 165#L199-1 assume !(0 != main_~p13~0); 166#L204-1 assume 0 != main_~p14~0; 168#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 169#L209 [2018-12-09 01:19:26,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-09 01:19:26,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:26,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:26,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash -855950089, now seen corresponding path program 1 times [2018-12-09 01:19:26,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:26,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:26,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:26,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:26,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:26,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:26,942 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:26,942 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. cyclomatic complexity: 52 Second operand 3 states. [2018-12-09 01:19:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:26,954 INFO L93 Difference]: Finished difference Result 173 states and 269 transitions. [2018-12-09 01:19:26,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:26,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 269 transitions. [2018-12-09 01:19:26,957 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2018-12-09 01:19:26,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 269 transitions. [2018-12-09 01:19:26,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2018-12-09 01:19:26,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2018-12-09 01:19:26,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 269 transitions. [2018-12-09 01:19:26,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:26,959 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 269 transitions. [2018-12-09 01:19:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 269 transitions. [2018-12-09 01:19:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-09 01:19:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-09 01:19:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2018-12-09 01:19:26,968 INFO L728 BuchiCegarLoop]: Abstraction has 173 states and 269 transitions. [2018-12-09 01:19:26,968 INFO L608 BuchiCegarLoop]: Abstraction has 173 states and 269 transitions. [2018-12-09 01:19:26,968 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 01:19:26,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 269 transitions. [2018-12-09 01:19:26,970 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2018-12-09 01:19:26,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:26,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:26,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:26,970 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] [2018-12-09 01:19:26,970 INFO L794 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 474#L209 [2018-12-09 01:19:26,970 INFO L796 eck$LassoCheckResult]: Loop: 474#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 489#L53 assume !(0 == main_~cond~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; 490#L86 assume !(0 != main_~p1~0); 448#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 449#L90-1 assume !(0 != main_~p3~0); 481#L94-1 assume !(0 != main_~p4~0); 483#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 585#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 583#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 581#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 579#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 577#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 575#L122-1 assume !(0 != main_~p11~0); 573#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 571#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 569#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 567#L138-1 assume !(0 != main_~p1~0); 566#L144-1 assume 0 != main_~p2~0; 565#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 564#L149 assume !(0 != main_~p3~0); 562#L154-1 assume !(0 != main_~p4~0); 442#L159-1 assume !(0 != main_~p5~0); 444#L164-1 assume !(0 != main_~p6~0); 456#L169-1 assume !(0 != main_~p7~0); 549#L174-1 assume !(0 != main_~p8~0); 547#L179-1 assume !(0 != main_~p9~0); 544#L184-1 assume !(0 != main_~p10~0); 543#L189-1 assume !(0 != main_~p11~0); 541#L194-1 assume !(0 != main_~p12~0); 521#L199-1 assume !(0 != main_~p13~0); 522#L204-1 assume 0 != main_~p14~0; 518#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 474#L209 [2018-12-09 01:19:26,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-12-09 01:19:26,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:26,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:26,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:26,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:26,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1067277945, now seen corresponding path program 1 times [2018-12-09 01:19:26,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:26,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:26,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:26,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:26,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:26,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:26,995 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:26,995 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. cyclomatic complexity: 100 Second operand 3 states. [2018-12-09 01:19:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:27,008 INFO L93 Difference]: Finished difference Result 341 states and 525 transitions. [2018-12-09 01:19:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:27,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 525 transitions. [2018-12-09 01:19:27,010 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2018-12-09 01:19:27,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 341 states and 525 transitions. [2018-12-09 01:19:27,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-12-09 01:19:27,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 341 [2018-12-09 01:19:27,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 525 transitions. [2018-12-09 01:19:27,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:27,012 INFO L705 BuchiCegarLoop]: Abstraction has 341 states and 525 transitions. [2018-12-09 01:19:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 525 transitions. [2018-12-09 01:19:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-12-09 01:19:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-09 01:19:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 525 transitions. [2018-12-09 01:19:27,020 INFO L728 BuchiCegarLoop]: Abstraction has 341 states and 525 transitions. [2018-12-09 01:19:27,020 INFO L608 BuchiCegarLoop]: Abstraction has 341 states and 525 transitions. [2018-12-09 01:19:27,020 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 01:19:27,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 525 transitions. [2018-12-09 01:19:27,022 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2018-12-09 01:19:27,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:27,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:27,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:27,022 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] [2018-12-09 01:19:27,022 INFO L794 eck$LassoCheckResult]: Stem: 996#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 997#L209 [2018-12-09 01:19:27,022 INFO L796 eck$LassoCheckResult]: Loop: 997#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1142#L53 assume !(0 == main_~cond~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; 1141#L86 assume !(0 != main_~p1~0); 1007#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1008#L90-1 assume !(0 != main_~p3~0); 1117#L94-1 assume !(0 != main_~p4~0); 1119#L98-1 assume !(0 != main_~p5~0); 1103#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1104#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1091#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1092#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1079#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1080#L122-1 assume !(0 != main_~p11~0); 1066#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1067#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1056#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1057#L138-1 assume !(0 != main_~p1~0); 1134#L144-1 assume 0 != main_~p2~0; 1132#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1129#L149 assume !(0 != main_~p3~0); 1124#L154-1 assume !(0 != main_~p4~0); 1122#L159-1 assume !(0 != main_~p5~0); 1116#L164-1 assume !(0 != main_~p6~0); 1115#L169-1 assume !(0 != main_~p7~0); 1102#L174-1 assume !(0 != main_~p8~0); 1096#L179-1 assume !(0 != main_~p9~0); 1089#L184-1 assume !(0 != main_~p10~0); 1084#L189-1 assume !(0 != main_~p11~0); 1078#L194-1 assume !(0 != main_~p12~0); 1077#L199-1 assume !(0 != main_~p13~0); 1144#L204-1 assume 0 != main_~p14~0; 1143#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 997#L209 [2018-12-09 01:19:27,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-12-09 01:19:27,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1129317559, now seen corresponding path program 1 times [2018-12-09 01:19:27,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:27,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-12-09 01:19:27,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:27,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:27,048 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:27,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:27,048 INFO L87 Difference]: Start difference. First operand 341 states and 525 transitions. cyclomatic complexity: 192 Second operand 3 states. [2018-12-09 01:19:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:27,058 INFO L93 Difference]: Finished difference Result 673 states and 1025 transitions. [2018-12-09 01:19:27,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:27,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1025 transitions. [2018-12-09 01:19:27,061 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2018-12-09 01:19:27,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 673 states and 1025 transitions. [2018-12-09 01:19:27,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 673 [2018-12-09 01:19:27,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 673 [2018-12-09 01:19:27,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 1025 transitions. [2018-12-09 01:19:27,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:27,065 INFO L705 BuchiCegarLoop]: Abstraction has 673 states and 1025 transitions. [2018-12-09 01:19:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 1025 transitions. [2018-12-09 01:19:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2018-12-09 01:19:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-12-09 01:19:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1025 transitions. [2018-12-09 01:19:27,077 INFO L728 BuchiCegarLoop]: Abstraction has 673 states and 1025 transitions. [2018-12-09 01:19:27,077 INFO L608 BuchiCegarLoop]: Abstraction has 673 states and 1025 transitions. [2018-12-09 01:19:27,077 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 01:19:27,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 673 states and 1025 transitions. [2018-12-09 01:19:27,079 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2018-12-09 01:19:27,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:27,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:27,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:27,079 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] [2018-12-09 01:19:27,079 INFO L794 eck$LassoCheckResult]: Stem: 2014#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 2015#L209 [2018-12-09 01:19:27,080 INFO L796 eck$LassoCheckResult]: Loop: 2015#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2092#L53 assume !(0 == main_~cond~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; 2090#L86 assume !(0 != main_~p1~0); 2088#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2086#L90-1 assume !(0 != main_~p3~0); 2082#L94-1 assume !(0 != main_~p4~0); 2078#L98-1 assume !(0 != main_~p5~0); 2074#L102-1 assume !(0 != main_~p6~0); 2072#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2070#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2068#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2066#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2064#L122-1 assume !(0 != main_~p11~0); 2062#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2060#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2058#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2056#L138-1 assume !(0 != main_~p1~0); 2050#L144-1 assume 0 != main_~p2~0; 2051#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2042#L149 assume !(0 != main_~p3~0); 2041#L154-1 assume !(0 != main_~p4~0); 2130#L159-1 assume !(0 != main_~p5~0); 2127#L164-1 assume !(0 != main_~p6~0); 2124#L169-1 assume !(0 != main_~p7~0); 2120#L174-1 assume !(0 != main_~p8~0); 2116#L179-1 assume !(0 != main_~p9~0); 2111#L184-1 assume !(0 != main_~p10~0); 2108#L189-1 assume !(0 != main_~p11~0); 2104#L194-1 assume !(0 != main_~p12~0); 2099#L199-1 assume !(0 != main_~p13~0); 2097#L204-1 assume 0 != main_~p14~0; 2095#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2015#L209 [2018-12-09 01:19:27,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-12-09 01:19:27,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1269866169, now seen corresponding path program 1 times [2018-12-09 01:19:27,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:27,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:27,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:27,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:27,098 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:27,099 INFO L87 Difference]: Start difference. First operand 673 states and 1025 transitions. cyclomatic complexity: 368 Second operand 3 states. [2018-12-09 01:19:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:27,109 INFO L93 Difference]: Finished difference Result 1329 states and 2001 transitions. [2018-12-09 01:19:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:27,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1329 states and 2001 transitions. [2018-12-09 01:19:27,115 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2018-12-09 01:19:27,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1329 states to 1329 states and 2001 transitions. [2018-12-09 01:19:27,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1329 [2018-12-09 01:19:27,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1329 [2018-12-09 01:19:27,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1329 states and 2001 transitions. [2018-12-09 01:19:27,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:27,120 INFO L705 BuchiCegarLoop]: Abstraction has 1329 states and 2001 transitions. [2018-12-09 01:19:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states and 2001 transitions. [2018-12-09 01:19:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2018-12-09 01:19:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2018-12-09 01:19:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2001 transitions. [2018-12-09 01:19:27,133 INFO L728 BuchiCegarLoop]: Abstraction has 1329 states and 2001 transitions. [2018-12-09 01:19:27,133 INFO L608 BuchiCegarLoop]: Abstraction has 1329 states and 2001 transitions. [2018-12-09 01:19:27,133 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 01:19:27,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1329 states and 2001 transitions. [2018-12-09 01:19:27,136 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2018-12-09 01:19:27,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:27,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:27,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:27,136 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] [2018-12-09 01:19:27,137 INFO L794 eck$LassoCheckResult]: Stem: 4027#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 4028#L209 [2018-12-09 01:19:27,137 INFO L796 eck$LassoCheckResult]: Loop: 4028#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4527#L53 assume !(0 == main_~cond~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; 4526#L86 assume !(0 != main_~p1~0); 4524#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4351#L90-1 assume !(0 != main_~p3~0); 4352#L94-1 assume !(0 != main_~p4~0); 4513#L98-1 assume !(0 != main_~p5~0); 4544#L102-1 assume !(0 != main_~p6~0); 4545#L106-1 assume !(0 != main_~p7~0); 4629#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4630#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4623#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4624#L122-1 assume !(0 != main_~p11~0); 4617#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4618#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4610#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4611#L138-1 assume !(0 != main_~p1~0); 4712#L144-1 assume 0 != main_~p2~0; 4131#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4132#L149 assume !(0 != main_~p3~0); 4362#L154-1 assume !(0 != main_~p4~0); 4363#L159-1 assume !(0 != main_~p5~0); 4425#L164-1 assume !(0 != main_~p6~0); 4547#L169-1 assume !(0 != main_~p7~0); 4543#L174-1 assume !(0 != main_~p8~0); 4541#L179-1 assume !(0 != main_~p9~0); 4537#L184-1 assume !(0 != main_~p10~0); 4535#L189-1 assume !(0 != main_~p11~0); 4533#L194-1 assume !(0 != main_~p12~0); 4530#L199-1 assume !(0 != main_~p13~0); 4529#L204-1 assume 0 != main_~p14~0; 4528#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4028#L209 [2018-12-09 01:19:27,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-12-09 01:19:27,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1135852663, now seen corresponding path program 1 times [2018-12-09 01:19:27,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:27,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:27,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:27,157 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:27,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:27,158 INFO L87 Difference]: Start difference. First operand 1329 states and 2001 transitions. cyclomatic complexity: 704 Second operand 3 states. [2018-12-09 01:19:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:27,177 INFO L93 Difference]: Finished difference Result 2625 states and 3905 transitions. [2018-12-09 01:19:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:27,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2625 states and 3905 transitions. [2018-12-09 01:19:27,188 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2018-12-09 01:19:27,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2625 states to 2625 states and 3905 transitions. [2018-12-09 01:19:27,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2625 [2018-12-09 01:19:27,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2625 [2018-12-09 01:19:27,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2625 states and 3905 transitions. [2018-12-09 01:19:27,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:27,198 INFO L705 BuchiCegarLoop]: Abstraction has 2625 states and 3905 transitions. [2018-12-09 01:19:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states and 3905 transitions. [2018-12-09 01:19:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2625. [2018-12-09 01:19:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2018-12-09 01:19:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3905 transitions. [2018-12-09 01:19:27,229 INFO L728 BuchiCegarLoop]: Abstraction has 2625 states and 3905 transitions. [2018-12-09 01:19:27,229 INFO L608 BuchiCegarLoop]: Abstraction has 2625 states and 3905 transitions. [2018-12-09 01:19:27,229 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 01:19:27,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2625 states and 3905 transitions. [2018-12-09 01:19:27,236 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2018-12-09 01:19:27,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:27,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:27,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:27,236 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] [2018-12-09 01:19:27,236 INFO L794 eck$LassoCheckResult]: Stem: 7991#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 7992#L209 [2018-12-09 01:19:27,237 INFO L796 eck$LassoCheckResult]: Loop: 7992#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 8209#L53 assume !(0 == main_~cond~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; 8205#L86 assume !(0 != main_~p1~0); 8202#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8198#L90-1 assume !(0 != main_~p3~0); 8161#L94-1 assume !(0 != main_~p4~0); 8157#L98-1 assume !(0 != main_~p5~0); 8101#L102-1 assume !(0 != main_~p6~0); 8059#L106-1 assume !(0 != main_~p7~0); 8060#L110-1 assume !(0 != main_~p8~0); 8304#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8302#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8299#L122-1 assume !(0 != main_~p11~0); 8296#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8293#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8290#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8286#L138-1 assume !(0 != main_~p1~0); 8283#L144-1 assume 0 != main_~p2~0; 8279#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8277#L149 assume !(0 != main_~p3~0); 8273#L154-1 assume !(0 != main_~p4~0); 8270#L159-1 assume !(0 != main_~p5~0); 8266#L164-1 assume !(0 != main_~p6~0); 8263#L169-1 assume !(0 != main_~p7~0); 8260#L174-1 assume !(0 != main_~p8~0); 8257#L179-1 assume !(0 != main_~p9~0); 8251#L184-1 assume !(0 != main_~p10~0); 8250#L189-1 assume !(0 != main_~p11~0); 8246#L194-1 assume !(0 != main_~p12~0); 8225#L199-1 assume !(0 != main_~p13~0); 8221#L204-1 assume 0 != main_~p14~0; 8218#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 7992#L209 [2018-12-09 01:19:27,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-12-09 01:19:27,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -669585671, now seen corresponding path program 1 times [2018-12-09 01:19:27,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:27,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:27,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:27,259 INFO L87 Difference]: Start difference. First operand 2625 states and 3905 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2018-12-09 01:19:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:27,289 INFO L93 Difference]: Finished difference Result 5185 states and 7617 transitions. [2018-12-09 01:19:27,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:27,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5185 states and 7617 transitions. [2018-12-09 01:19:27,306 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2018-12-09 01:19:27,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5185 states to 5185 states and 7617 transitions. [2018-12-09 01:19:27,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5185 [2018-12-09 01:19:27,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5185 [2018-12-09 01:19:27,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5185 states and 7617 transitions. [2018-12-09 01:19:27,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:27,327 INFO L705 BuchiCegarLoop]: Abstraction has 5185 states and 7617 transitions. [2018-12-09 01:19:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states and 7617 transitions. [2018-12-09 01:19:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 5185. [2018-12-09 01:19:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5185 states. [2018-12-09 01:19:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7617 transitions. [2018-12-09 01:19:27,384 INFO L728 BuchiCegarLoop]: Abstraction has 5185 states and 7617 transitions. [2018-12-09 01:19:27,384 INFO L608 BuchiCegarLoop]: Abstraction has 5185 states and 7617 transitions. [2018-12-09 01:19:27,384 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 01:19:27,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5185 states and 7617 transitions. [2018-12-09 01:19:27,397 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2018-12-09 01:19:27,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:27,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:27,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:27,398 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] [2018-12-09 01:19:27,398 INFO L794 eck$LassoCheckResult]: Stem: 15798#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 15799#L209 [2018-12-09 01:19:27,398 INFO L796 eck$LassoCheckResult]: Loop: 15799#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 15885#L53 assume !(0 == main_~cond~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; 15883#L86 assume !(0 != main_~p1~0); 15882#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 15881#L90-1 assume !(0 != main_~p3~0); 15879#L94-1 assume !(0 != main_~p4~0); 15877#L98-1 assume !(0 != main_~p5~0); 15875#L102-1 assume !(0 != main_~p6~0); 15869#L106-1 assume !(0 != main_~p7~0); 15870#L110-1 assume !(0 != main_~p8~0); 15954#L114-1 assume !(0 != main_~p9~0); 15951#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 15948#L122-1 assume !(0 != main_~p11~0); 15945#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 15942#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 15940#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 15938#L138-1 assume !(0 != main_~p1~0); 15935#L144-1 assume 0 != main_~p2~0; 15932#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 15929#L149 assume !(0 != main_~p3~0); 15924#L154-1 assume !(0 != main_~p4~0); 15920#L159-1 assume !(0 != main_~p5~0); 15916#L164-1 assume !(0 != main_~p6~0); 15913#L169-1 assume !(0 != main_~p7~0); 15910#L174-1 assume !(0 != main_~p8~0); 15907#L179-1 assume !(0 != main_~p9~0); 15904#L184-1 assume !(0 != main_~p10~0); 15901#L189-1 assume !(0 != main_~p11~0); 15898#L194-1 assume !(0 != main_~p12~0); 15894#L199-1 assume !(0 != main_~p13~0); 15891#L204-1 assume 0 != main_~p14~0; 15888#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 15799#L209 [2018-12-09 01:19:27,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2018-12-09 01:19:27,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -450730953, now seen corresponding path program 1 times [2018-12-09 01:19:27,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:27,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:27,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:27,418 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:27,419 INFO L87 Difference]: Start difference. First operand 5185 states and 7617 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2018-12-09 01:19:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:27,441 INFO L93 Difference]: Finished difference Result 10241 states and 14849 transitions. [2018-12-09 01:19:27,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:27,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10241 states and 14849 transitions. [2018-12-09 01:19:27,467 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2018-12-09 01:19:27,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10241 states to 10241 states and 14849 transitions. [2018-12-09 01:19:27,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10241 [2018-12-09 01:19:27,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10241 [2018-12-09 01:19:27,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10241 states and 14849 transitions. [2018-12-09 01:19:27,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:27,503 INFO L705 BuchiCegarLoop]: Abstraction has 10241 states and 14849 transitions. [2018-12-09 01:19:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10241 states and 14849 transitions. [2018-12-09 01:19:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 10241. [2018-12-09 01:19:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10241 states. [2018-12-09 01:19:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 14849 transitions. [2018-12-09 01:19:27,617 INFO L728 BuchiCegarLoop]: Abstraction has 10241 states and 14849 transitions. [2018-12-09 01:19:27,617 INFO L608 BuchiCegarLoop]: Abstraction has 10241 states and 14849 transitions. [2018-12-09 01:19:27,617 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 01:19:27,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10241 states and 14849 transitions. [2018-12-09 01:19:27,652 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2018-12-09 01:19:27,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:27,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:27,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:27,653 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] [2018-12-09 01:19:27,653 INFO L794 eck$LassoCheckResult]: Stem: 31236#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 31237#L209 [2018-12-09 01:19:27,654 INFO L796 eck$LassoCheckResult]: Loop: 31237#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 31804#L53 assume !(0 == main_~cond~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; 31805#L86 assume !(0 != main_~p1~0); 31794#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 31795#L90-1 assume !(0 != main_~p3~0); 31786#L94-1 assume !(0 != main_~p4~0); 31781#L98-1 assume !(0 != main_~p5~0); 31775#L102-1 assume !(0 != main_~p6~0); 31777#L106-1 assume !(0 != main_~p7~0); 31855#L110-1 assume !(0 != main_~p8~0); 31304#L114-1 assume !(0 != main_~p9~0); 31305#L118-1 assume !(0 != main_~p10~0); 32118#L122-1 assume !(0 != main_~p11~0); 32108#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 32109#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 32098#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 32099#L138-1 assume !(0 != main_~p1~0); 32170#L144-1 assume 0 != main_~p2~0; 32169#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 32168#L149 assume !(0 != main_~p3~0); 32165#L154-1 assume !(0 != main_~p4~0); 31674#L159-1 assume !(0 != main_~p5~0); 31663#L164-1 assume !(0 != main_~p6~0); 31664#L169-1 assume !(0 != main_~p7~0); 32086#L174-1 assume !(0 != main_~p8~0); 32084#L179-1 assume !(0 != main_~p9~0); 32083#L184-1 assume !(0 != main_~p10~0); 31831#L189-1 assume !(0 != main_~p11~0); 31830#L194-1 assume !(0 != main_~p12~0); 31820#L199-1 assume !(0 != main_~p13~0); 31821#L204-1 assume 0 != main_~p14~0; 31812#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 31237#L209 [2018-12-09 01:19:27,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2018-12-09 01:19:27,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:27,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:27,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash -28029127, now seen corresponding path program 1 times [2018-12-09 01:19:27,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:27,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:27,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:27,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:27,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:27,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:27,675 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:27,675 INFO L87 Difference]: Start difference. First operand 10241 states and 14849 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2018-12-09 01:19:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:27,717 INFO L93 Difference]: Finished difference Result 20225 states and 28929 transitions. [2018-12-09 01:19:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:27,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20225 states and 28929 transitions. [2018-12-09 01:19:27,772 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2018-12-09 01:19:27,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20225 states to 20225 states and 28929 transitions. [2018-12-09 01:19:27,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20225 [2018-12-09 01:19:27,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20225 [2018-12-09 01:19:27,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20225 states and 28929 transitions. [2018-12-09 01:19:27,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:27,836 INFO L705 BuchiCegarLoop]: Abstraction has 20225 states and 28929 transitions. [2018-12-09 01:19:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states and 28929 transitions. [2018-12-09 01:19:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 20225. [2018-12-09 01:19:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2018-12-09 01:19:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 28929 transitions. [2018-12-09 01:19:27,976 INFO L728 BuchiCegarLoop]: Abstraction has 20225 states and 28929 transitions. [2018-12-09 01:19:27,976 INFO L608 BuchiCegarLoop]: Abstraction has 20225 states and 28929 transitions. [2018-12-09 01:19:27,976 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 01:19:27,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20225 states and 28929 transitions. [2018-12-09 01:19:28,007 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2018-12-09 01:19:28,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:28,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:28,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:28,007 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] [2018-12-09 01:19:28,008 INFO L794 eck$LassoCheckResult]: Stem: 61713#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 61714#L209 [2018-12-09 01:19:28,008 INFO L796 eck$LassoCheckResult]: Loop: 61714#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 62136#L53 assume !(0 == main_~cond~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; 62131#L86 assume !(0 != main_~p1~0); 62127#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 62124#L90-1 assume !(0 != main_~p3~0); 62119#L94-1 assume !(0 != main_~p4~0); 62113#L98-1 assume !(0 != main_~p5~0); 62107#L102-1 assume !(0 != main_~p6~0); 62095#L106-1 assume !(0 != main_~p7~0); 62097#L110-1 assume !(0 != main_~p8~0); 62100#L114-1 assume !(0 != main_~p9~0); 62217#L118-1 assume !(0 != main_~p10~0); 62215#L122-1 assume !(0 != main_~p11~0); 62212#L126-1 assume !(0 != main_~p12~0); 62213#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 62230#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 62228#L138-1 assume !(0 != main_~p1~0); 62227#L144-1 assume 0 != main_~p2~0; 62226#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 62225#L149 assume !(0 != main_~p3~0); 62222#L154-1 assume !(0 != main_~p4~0); 62220#L159-1 assume !(0 != main_~p5~0); 62015#L164-1 assume !(0 != main_~p6~0); 62016#L169-1 assume !(0 != main_~p7~0); 62007#L174-1 assume !(0 != main_~p8~0); 62004#L179-1 assume !(0 != main_~p9~0); 61999#L184-1 assume !(0 != main_~p10~0); 61951#L189-1 assume !(0 != main_~p11~0); 61950#L194-1 assume !(0 != main_~p12~0); 62148#L199-1 assume !(0 != main_~p13~0); 62144#L204-1 assume 0 != main_~p14~0; 62141#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 61714#L209 [2018-12-09 01:19:28,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2018-12-09 01:19:28,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:28,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1716972869, now seen corresponding path program 1 times [2018-12-09 01:19:28,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:28,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:19:28,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:28,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:28,023 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:19:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:19:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:19:28,023 INFO L87 Difference]: Start difference. First operand 20225 states and 28929 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2018-12-09 01:19:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:28,080 INFO L93 Difference]: Finished difference Result 39937 states and 56321 transitions. [2018-12-09 01:19:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:19:28,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39937 states and 56321 transitions. [2018-12-09 01:19:28,165 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2018-12-09 01:19:28,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39937 states to 39937 states and 56321 transitions. [2018-12-09 01:19:28,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39937 [2018-12-09 01:19:28,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39937 [2018-12-09 01:19:28,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39937 states and 56321 transitions. [2018-12-09 01:19:28,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:19:28,264 INFO L705 BuchiCegarLoop]: Abstraction has 39937 states and 56321 transitions. [2018-12-09 01:19:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39937 states and 56321 transitions. [2018-12-09 01:19:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39937 to 39937. [2018-12-09 01:19:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39937 states. [2018-12-09 01:19:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39937 states to 39937 states and 56321 transitions. [2018-12-09 01:19:28,594 INFO L728 BuchiCegarLoop]: Abstraction has 39937 states and 56321 transitions. [2018-12-09 01:19:28,594 INFO L608 BuchiCegarLoop]: Abstraction has 39937 states and 56321 transitions. [2018-12-09 01:19:28,594 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 01:19:28,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39937 states and 56321 transitions. [2018-12-09 01:19:28,664 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2018-12-09 01:19:28,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:19:28,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:19:28,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 01:19:28,665 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] [2018-12-09 01:19:28,665 INFO L794 eck$LassoCheckResult]: Stem: 121873#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 121874#L209 [2018-12-09 01:19:28,665 INFO L796 eck$LassoCheckResult]: Loop: 121874#L209 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 122323#L53 assume !(0 == main_~cond~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; 122324#L86 assume !(0 != main_~p1~0); 122309#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 122310#L90-1 assume !(0 != main_~p3~0); 122295#L94-1 assume !(0 != main_~p4~0); 122297#L98-1 assume !(0 != main_~p5~0); 122530#L102-1 assume !(0 != main_~p6~0); 122527#L106-1 assume !(0 != main_~p7~0); 122525#L110-1 assume !(0 != main_~p8~0); 122523#L114-1 assume !(0 != main_~p9~0); 122466#L118-1 assume !(0 != main_~p10~0); 122464#L122-1 assume !(0 != main_~p11~0); 122460#L126-1 assume !(0 != main_~p12~0); 122457#L130-1 assume !(0 != main_~p13~0); 122456#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 122454#L138-1 assume !(0 != main_~p1~0); 122453#L144-1 assume 0 != main_~p2~0; 122452#L150 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 122192#L149 assume !(0 != main_~p3~0); 122187#L154-1 assume !(0 != main_~p4~0); 122188#L159-1 assume !(0 != main_~p5~0); 122178#L164-1 assume !(0 != main_~p6~0); 122179#L169-1 assume !(0 != main_~p7~0); 122436#L174-1 assume !(0 != main_~p8~0); 122428#L179-1 assume !(0 != main_~p9~0); 122378#L184-1 assume !(0 != main_~p10~0); 122368#L189-1 assume !(0 != main_~p11~0); 122367#L194-1 assume !(0 != main_~p12~0); 122349#L199-1 assume !(0 != main_~p13~0); 122350#L204-1 assume 0 != main_~p14~0; 122335#L210 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 121874#L209 [2018-12-09 01:19:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2018-12-09 01:19:28,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 583849721, now seen corresponding path program 1 times [2018-12-09 01:19:28,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:19:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1609341720, now seen corresponding path program 1 times [2018-12-09 01:19:28,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:19:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:19:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:28,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 01:19:28 BoogieIcfgContainer [2018-12-09 01:19:28,876 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 01:19:28,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:19:28,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:19:28,877 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:19:28,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:26" (3/4) ... [2018-12-09 01:19:28,879 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 01:19:28,921 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_300f5305-ddf6-4284-aa96-460977ec41db/bin-2019/uautomizer/witness.graphml [2018-12-09 01:19:28,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:19:28,922 INFO L168 Benchmark]: Toolchain (without parser) took 2683.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.5 MB). Free memory was 959.8 MB in the beginning and 909.3 MB in the end (delta: 50.5 MB). Peak memory consumption was 299.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:28,923 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:19:28,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.22 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:28,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:28,923 INFO L168 Benchmark]: Boogie Preprocessor took 14.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:28,924 INFO L168 Benchmark]: RCFGBuilder took 194.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:28,924 INFO L168 Benchmark]: BuchiAutomizer took 2238.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.0 GB in the beginning and 909.3 MB in the end (delta: 137.3 MB). Peak memory consumption was 307.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:28,924 INFO L168 Benchmark]: Witness Printer took 44.19 ms. Allocated memory is still 1.3 GB. Free memory is still 909.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:19:28,926 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.22 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 194.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2238.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.0 GB in the beginning and 909.3 MB in the end (delta: 137.3 MB). Peak memory consumption was 307.7 MB. Max. memory is 11.5 GB. * Witness Printer took 44.19 ms. Allocated memory is still 1.3 GB. Free memory is still 909.3 MB. 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39937 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 39937 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1073 SDtfs, 551 SDslu, 669 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 51]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=3, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60688f9b=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8c0c3b6=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a0b7db0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48f9456e=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44c580a0=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bb6ae3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47eaa678=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f86ea80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62387487=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@91942d=0, p14=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73be1242=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73dad5af=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@115547b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50f25ed2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ebbed88=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 51]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; Loop: [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 [L86] COND FALSE !(p1 != 0) [L90] COND TRUE p2 != 0 [L91] lk2 = 1 [L94] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L102] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L110] COND FALSE !(p7 != 0) [L114] COND FALSE !(p8 != 0) [L118] COND FALSE !(p9 != 0) [L122] COND FALSE !(p10 != 0) [L126] COND FALSE !(p11 != 0) [L130] COND FALSE !(p12 != 0) [L134] COND FALSE !(p13 != 0) [L138] COND TRUE p14 != 0 [L139] lk14 = 1 [L144] COND FALSE !(p1 != 0) [L149] COND TRUE p2 != 0 [L150] COND FALSE !(lk2 != 1) [L151] lk2 = 0 [L154] COND FALSE !(p3 != 0) [L159] COND FALSE !(p4 != 0) [L164] COND FALSE !(p5 != 0) [L169] COND FALSE !(p6 != 0) [L174] COND FALSE !(p7 != 0) [L179] COND FALSE !(p8 != 0) [L184] COND FALSE !(p9 != 0) [L189] COND FALSE !(p10 != 0) [L194] COND FALSE !(p11 != 0) [L199] COND FALSE !(p12 != 0) [L204] COND FALSE !(p13 != 0) [L209] COND TRUE p14 != 0 [L210] COND FALSE !(lk14 != 1) [L211] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...