./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-0ed9222-m [2019-01-14 04:43:11,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:43:11,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:43:11,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:43:11,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:43:11,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:43:11,099 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:43:11,101 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:43:11,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:43:11,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:43:11,106 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:43:11,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:43:11,108 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:43:11,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:43:11,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:43:11,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:43:11,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:43:11,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:43:11,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:43:11,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:43:11,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:43:11,126 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:43:11,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:43:11,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:43:11,130 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:43:11,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:43:11,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:43:11,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:43:11,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:43:11,137 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:43:11,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:43:11,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:43:11,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:43:11,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:43:11,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:43:11,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:43:11,143 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:43:11,164 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:43:11,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:43:11,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:43:11,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:43:11,167 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:43:11,167 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:43:11,167 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:43:11,168 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:43:11,170 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:43:11,170 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:43:11,170 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:43:11,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:43:11,171 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:43:11,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:43:11,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:43:11,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:43:11,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:43:11,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:43:11,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:43:11,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:43:11,172 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:43:11,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:43:11,174 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:43:11,174 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:43:11,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:43:11,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:43:11,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:43:11,176 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:43:11,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:43:11,176 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:43:11,176 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:43:11,178 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:43:11,179 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2019-01-14 04:43:11,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:43:11,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:43:11,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:43:11,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:43:11,255 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:43:11,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2019-01-14 04:43:11,343 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546c50720/3b2c5548a71a4c219817a1160b282560/FLAGdb8295a6b [2019-01-14 04:43:11,879 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:43:11,879 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2019-01-14 04:43:11,891 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546c50720/3b2c5548a71a4c219817a1160b282560/FLAGdb8295a6b [2019-01-14 04:43:12,186 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546c50720/3b2c5548a71a4c219817a1160b282560 [2019-01-14 04:43:12,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:43:12,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:43:12,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:43:12,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:43:12,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:43:12,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594d8011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12, skipping insertion in model container [2019-01-14 04:43:12,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:43:12,259 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:43:12,605 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:43:12,614 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:43:12,699 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:43:12,742 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:43:12,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12 WrapperNode [2019-01-14 04:43:12,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:43:12,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:43:12,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:43:12,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:43:12,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:43:12,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:43:12,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:43:12,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:43:12,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:12,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:13,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:13,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... [2019-01-14 04:43:13,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:43:13,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:43:13,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:43:13,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:43:13,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:43:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:43:13,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:43:14,468 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:43:14,469 INFO L286 CfgBuilder]: Removed 73 assue(true) statements. [2019-01-14 04:43:14,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:43:14 BoogieIcfgContainer [2019-01-14 04:43:14,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:43:14,474 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:43:14,475 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:43:14,481 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:43:14,482 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:43:14,483 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:43:12" (1/3) ... [2019-01-14 04:43:14,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7884352b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:43:14, skipping insertion in model container [2019-01-14 04:43:14,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:43:14,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:43:12" (2/3) ... [2019-01-14 04:43:14,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7884352b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:43:14, skipping insertion in model container [2019-01-14 04:43:14,490 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:43:14,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:43:14" (3/3) ... [2019-01-14 04:43:14,494 INFO L375 chiAutomizerObserver]: Analyzing ICFG transmitter.01_false-unreach-call_false-termination.cil.c [2019-01-14 04:43:14,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:43:14,565 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:43:14,565 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:43:14,565 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:43:14,565 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:43:14,566 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:43:14,566 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:43:14,567 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:43:14,567 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:43:14,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2019-01-14 04:43:14,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-14 04:43:14,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:14,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:14,644 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:14,644 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:14,644 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:43:14,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2019-01-14 04:43:14,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-14 04:43:14,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:14,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:14,658 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:14,658 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:14,670 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRYtrue ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 14#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 123#L357true havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 40#L144true assume !(1 == ~m_i~0);~m_st~0 := 2; 111#L151-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 117#L156-1true assume !(0 == ~M_E~0); 55#L240-1true assume !(0 == ~T1_E~0); 92#L245-1true assume !(0 == ~E_1~0); 115#L250-1true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 66#L105true assume !(1 == ~m_pc~0); 61#L105-2true is_master_triggered_~__retres1~0 := 0; 68#L116true is_master_triggered_#res := is_master_triggered_~__retres1~0; 35#L117true activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 51#L290true assume !(0 != activate_threads_~tmp~1); 47#L290-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 88#L124true assume 1 == ~t1_pc~0; 27#L125true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 89#L135true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 29#L136true activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 72#L298true assume !(0 != activate_threads_~tmp___0~0); 42#L298-2true assume !(1 == ~M_E~0); 4#L263-1true assume !(1 == ~T1_E~0); 48#L268-1true assume !(1 == ~E_1~0); 73#L394-1true [2019-01-14 04:43:14,671 INFO L796 eck$LassoCheckResult]: Loop: 73#L394-1true assume !false; 30#L395true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 98#L215true assume !true; 5#L230true start_simulation_~kernel_st~0 := 2; 38#L144-1true start_simulation_~kernel_st~0 := 3; 80#L240-2true assume 0 == ~M_E~0;~M_E~0 := 1; 77#L240-4true assume !(0 == ~T1_E~0); 90#L245-3true assume 0 == ~E_1~0;~E_1~0 := 1; 113#L250-3true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 79#L105-6true assume 1 == ~m_pc~0; 8#L106-2true assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 62#L116-2true is_master_triggered_#res := is_master_triggered_~__retres1~0; 9#L117-2true activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 23#L290-6true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 18#L290-8true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 95#L124-6true assume 1 == ~t1_pc~0; 21#L125-2true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 86#L135-2true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 22#L136-2true activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 54#L298-6true assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 53#L298-8true assume 1 == ~M_E~0;~M_E~0 := 2; 17#L263-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 33#L268-3true assume 1 == ~E_1~0;~E_1~0 := 2; 81#L273-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 31#L169-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 109#L181-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 93#L182-1true start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 96#L413true assume !(0 == start_simulation_~tmp~3); 101#L413-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 26#L169-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 108#L181-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 70#L182-2true stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 122#L368true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 60#L375true stop_simulation_#res := stop_simulation_~__retres2~0; 3#L376true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 118#L426true assume !(0 != start_simulation_~tmp___0~1); 73#L394-1true [2019-01-14 04:43:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1587080038, now seen corresponding path program 1 times [2019-01-14 04:43:14,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:14,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:14,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:14,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:14,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:14,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:14,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:14,875 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:14,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash -394546765, now seen corresponding path program 1 times [2019-01-14 04:43:14,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:14,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:14,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:14,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:14,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:14,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:14,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:43:14,899 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:14,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:14,924 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-01-14 04:43:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:14,970 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2019-01-14 04:43:14,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:14,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 177 transitions. [2019-01-14 04:43:14,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2019-01-14 04:43:14,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 116 states and 172 transitions. [2019-01-14 04:43:15,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-14 04:43:15,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-14 04:43:15,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 172 transitions. [2019-01-14 04:43:15,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:15,008 INFO L706 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-01-14 04:43:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 172 transitions. [2019-01-14 04:43:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-14 04:43:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 04:43:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-01-14 04:43:15,056 INFO L729 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-01-14 04:43:15,056 INFO L609 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-01-14 04:43:15,057 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:43:15,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 172 transitions. [2019-01-14 04:43:15,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2019-01-14 04:43:15,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:15,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:15,061 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:15,062 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:15,062 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 276#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 277#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 327#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 328#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 366#L156-1 assume !(0 == ~M_E~0); 339#L240-1 assume !(0 == ~T1_E~0); 340#L245-1 assume !(0 == ~E_1~0); 358#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 345#L105 assume !(1 == ~m_pc~0); 319#L105-2 is_master_triggered_~__retres1~0 := 0; 318#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 320#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 321#L290 assume !(0 != activate_threads_~tmp~1); 332#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 333#L124 assume 1 == ~t1_pc~0; 302#L125 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 303#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 307#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 308#L298 assume !(0 != activate_threads_~tmp___0~0); 329#L298-2 assume !(1 == ~M_E~0); 253#L263-1 assume !(1 == ~T1_E~0); 254#L268-1 assume !(1 == ~E_1~0); 334#L394-1 [2019-01-14 04:43:15,063 INFO L796 eck$LassoCheckResult]: Loop: 334#L394-1 assume !false; 309#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 273#L215 assume !false; 364#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 313#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 314#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 361#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 356#L196 assume !(0 != eval_~tmp~0); 255#L230 start_simulation_~kernel_st~0 := 2; 256#L144-1 start_simulation_~kernel_st~0 := 3; 324#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 351#L240-4 assume !(0 == ~T1_E~0); 352#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 357#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 355#L105-6 assume 1 == ~m_pc~0; 262#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 264#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 267#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 268#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 282#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 283#L124-6 assume 1 == ~t1_pc~0; 289#L125-2 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 290#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 292#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 293#L298-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 338#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 280#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 281#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 316#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 310#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 312#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 359#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 360#L413 assume !(0 == start_simulation_~tmp~3); 362#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 299#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 300#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 347#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 348#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 343#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 251#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 252#L426 assume !(0 != start_simulation_~tmp___0~1); 334#L394-1 [2019-01-14 04:43:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1890238808, now seen corresponding path program 1 times [2019-01-14 04:43:15,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:15,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:15,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:43:15,178 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash 500242205, now seen corresponding path program 1 times [2019-01-14 04:43:15,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:15,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:15,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:15,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:15,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:43:15,297 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:15,298 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. cyclomatic complexity: 57 Second operand 3 states. [2019-01-14 04:43:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:15,424 INFO L93 Difference]: Finished difference Result 203 states and 294 transitions. [2019-01-14 04:43:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:15,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 294 transitions. [2019-01-14 04:43:15,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2019-01-14 04:43:15,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 203 states and 294 transitions. [2019-01-14 04:43:15,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2019-01-14 04:43:15,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2019-01-14 04:43:15,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 294 transitions. [2019-01-14 04:43:15,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:15,447 INFO L706 BuchiCegarLoop]: Abstraction has 203 states and 294 transitions. [2019-01-14 04:43:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 294 transitions. [2019-01-14 04:43:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-01-14 04:43:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-14 04:43:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 289 transitions. [2019-01-14 04:43:15,468 INFO L729 BuchiCegarLoop]: Abstraction has 199 states and 289 transitions. [2019-01-14 04:43:15,469 INFO L609 BuchiCegarLoop]: Abstraction has 199 states and 289 transitions. [2019-01-14 04:43:15,469 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:43:15,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 289 transitions. [2019-01-14 04:43:15,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 175 [2019-01-14 04:43:15,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:15,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:15,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:15,476 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:15,476 INFO L794 eck$LassoCheckResult]: Stem: 705#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 604#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 605#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 655#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 656#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 707#L156-1 assume !(0 == ~M_E~0); 667#L240-1 assume !(0 == ~T1_E~0); 668#L245-1 assume !(0 == ~E_1~0); 696#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 677#L105 assume !(1 == ~m_pc~0); 646#L105-2 is_master_triggered_~__retres1~0 := 0; 645#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 647#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 648#L290 assume !(0 != activate_threads_~tmp~1); 660#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 661#L124 assume !(1 == ~t1_pc~0); 691#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 692#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 638#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 639#L298 assume !(0 != activate_threads_~tmp___0~0); 657#L298-2 assume !(1 == ~M_E~0); 581#L263-1 assume !(1 == ~T1_E~0); 582#L268-1 assume !(1 == ~E_1~0); 662#L394-1 [2019-01-14 04:43:15,478 INFO L796 eck$LassoCheckResult]: Loop: 662#L394-1 assume !false; 636#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 637#L215 assume !false; 703#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 641#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 642#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 742#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 739#L196 assume !(0 != eval_~tmp~0); 738#L230 start_simulation_~kernel_st~0 := 2; 737#L144-1 start_simulation_~kernel_st~0 := 3; 736#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 735#L240-4 assume !(0 == ~T1_E~0); 734#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 733#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 732#L105-6 assume !(1 == ~m_pc~0); 730#L105-8 is_master_triggered_~__retres1~0 := 0; 728#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 716#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 622#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 613#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 614#L124-6 assume !(1 == ~t1_pc~0); 680#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 681#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 620#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 621#L298-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 664#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 608#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 609#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 640#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 633#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 635#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 725#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 723#L413 assume !(0 == start_simulation_~tmp~3); 702#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 626#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 627#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 678#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 679#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 673#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 579#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 580#L426 assume !(0 != start_simulation_~tmp___0~1); 662#L394-1 [2019-01-14 04:43:15,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:15,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 1 times [2019-01-14 04:43:15,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:15,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:15,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2145764385, now seen corresponding path program 1 times [2019-01-14 04:43:15,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:15,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:43:15,806 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:43:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:43:15,807 INFO L87 Difference]: Start difference. First operand 199 states and 289 transitions. cyclomatic complexity: 92 Second operand 5 states. [2019-01-14 04:43:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:16,063 INFO L93 Difference]: Finished difference Result 333 states and 470 transitions. [2019-01-14 04:43:16,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:43:16,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 470 transitions. [2019-01-14 04:43:16,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 309 [2019-01-14 04:43:16,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 333 states and 470 transitions. [2019-01-14 04:43:16,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 333 [2019-01-14 04:43:16,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 333 [2019-01-14 04:43:16,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 333 states and 470 transitions. [2019-01-14 04:43:16,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:16,080 INFO L706 BuchiCegarLoop]: Abstraction has 333 states and 470 transitions. [2019-01-14 04:43:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states and 470 transitions. [2019-01-14 04:43:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2019-01-14 04:43:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-14 04:43:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2019-01-14 04:43:16,099 INFO L729 BuchiCegarLoop]: Abstraction has 205 states and 295 transitions. [2019-01-14 04:43:16,099 INFO L609 BuchiCegarLoop]: Abstraction has 205 states and 295 transitions. [2019-01-14 04:43:16,099 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:43:16,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 295 transitions. [2019-01-14 04:43:16,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 181 [2019-01-14 04:43:16,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:16,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:16,104 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:16,105 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:16,105 INFO L794 eck$LassoCheckResult]: Stem: 1271#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 1152#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1153#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 1202#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 1203#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1272#L156-1 assume !(0 == ~M_E~0); 1218#L240-1 assume !(0 == ~T1_E~0); 1219#L245-1 assume !(0 == ~E_1~0); 1257#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1230#L105 assume !(1 == ~m_pc~0); 1194#L105-2 is_master_triggered_~__retres1~0 := 0; 1193#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1195#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1196#L290 assume !(0 != activate_threads_~tmp~1); 1207#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1208#L124 assume !(1 == ~t1_pc~0); 1250#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 1251#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1185#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1186#L298 assume !(0 != activate_threads_~tmp___0~0); 1204#L298-2 assume !(1 == ~M_E~0); 1129#L263-1 assume !(1 == ~T1_E~0); 1130#L268-1 assume !(1 == ~E_1~0); 1209#L394-1 [2019-01-14 04:43:16,105 INFO L796 eck$LassoCheckResult]: Loop: 1209#L394-1 assume !false; 1183#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1184#L215 assume !false; 1266#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1189#L169 assume !(0 == ~m_st~0); 1191#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 1274#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1294#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 1292#L196 assume !(0 != eval_~tmp~0); 1131#L230 start_simulation_~kernel_st~0 := 2; 1132#L144-1 start_simulation_~kernel_st~0 := 3; 1199#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1237#L240-4 assume !(0 == ~T1_E~0); 1238#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1256#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1273#L105-6 assume 1 == ~m_pc~0; 1138#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 1140#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1143#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1144#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1161#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1162#L124-6 assume !(1 == ~t1_pc~0); 1233#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 1234#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1168#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1169#L298-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1214#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 1215#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1187#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1188#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1180#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1182#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1258#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 1259#L413 assume !(0 == start_simulation_~tmp~3); 1260#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1173#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1174#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1231#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 1232#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1224#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 1127#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1128#L426 assume !(0 != start_simulation_~tmp___0~1); 1209#L394-1 [2019-01-14 04:43:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:16,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 2 times [2019-01-14 04:43:16,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:16,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:16,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:16,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash 695328525, now seen corresponding path program 1 times [2019-01-14 04:43:16,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:16,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:16,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:16,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:16,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:43:16,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:43:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:43:16,325 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. cyclomatic complexity: 92 Second operand 5 states. [2019-01-14 04:43:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:17,150 INFO L93 Difference]: Finished difference Result 345 states and 490 transitions. [2019-01-14 04:43:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:43:17,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 490 transitions. [2019-01-14 04:43:17,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 321 [2019-01-14 04:43:17,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 345 states and 490 transitions. [2019-01-14 04:43:17,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2019-01-14 04:43:17,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2019-01-14 04:43:17,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 345 states and 490 transitions. [2019-01-14 04:43:17,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:17,168 INFO L706 BuchiCegarLoop]: Abstraction has 345 states and 490 transitions. [2019-01-14 04:43:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states and 490 transitions. [2019-01-14 04:43:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 214. [2019-01-14 04:43:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-14 04:43:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 300 transitions. [2019-01-14 04:43:17,207 INFO L729 BuchiCegarLoop]: Abstraction has 214 states and 300 transitions. [2019-01-14 04:43:17,207 INFO L609 BuchiCegarLoop]: Abstraction has 214 states and 300 transitions. [2019-01-14 04:43:17,207 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:43:17,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 300 transitions. [2019-01-14 04:43:17,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 190 [2019-01-14 04:43:17,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:17,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:17,214 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:17,215 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:17,215 INFO L794 eck$LassoCheckResult]: Stem: 1820#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 1716#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1717#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 1765#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 1766#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1821#L156-1 assume !(0 == ~M_E~0); 1780#L240-1 assume !(0 == ~T1_E~0); 1781#L245-1 assume !(0 == ~E_1~0); 1808#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1789#L105 assume !(1 == ~m_pc~0); 1756#L105-2 is_master_triggered_~__retres1~0 := 0; 1755#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1757#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1758#L290 assume !(0 != activate_threads_~tmp~1); 1771#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1772#L124 assume !(1 == ~t1_pc~0); 1802#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 1803#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1748#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1749#L298 assume !(0 != activate_threads_~tmp___0~0); 1768#L298-2 assume !(1 == ~M_E~0); 1695#L263-1 assume !(1 == ~T1_E~0); 1696#L268-1 assume !(1 == ~E_1~0); 1773#L394-1 [2019-01-14 04:43:17,215 INFO L796 eck$LassoCheckResult]: Loop: 1773#L394-1 assume !false; 1862#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1861#L215 assume !false; 1860#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1859#L169 assume !(0 == ~m_st~0); 1858#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 1856#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1854#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 1852#L196 assume !(0 != eval_~tmp~0); 1850#L230 start_simulation_~kernel_st~0 := 2; 1847#L144-1 start_simulation_~kernel_st~0 := 3; 1843#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1841#L240-4 assume !(0 == ~T1_E~0); 1839#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1838#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1835#L105-6 assume !(1 == ~m_pc~0); 1831#L105-8 is_master_triggered_~__retres1~0 := 0; 1829#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1827#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1825#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1823#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1814#L124-6 assume !(1 == ~t1_pc~0); 1815#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 1902#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1901#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1900#L298-6 assume !(0 != activate_threads_~tmp___0~0); 1899#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 1898#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1896#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1894#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1892#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1889#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1886#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 1881#L413 assume !(0 == start_simulation_~tmp~3); 1879#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1876#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1874#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1872#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 1870#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1868#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 1866#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1865#L426 assume !(0 != start_simulation_~tmp___0~1); 1773#L394-1 [2019-01-14 04:43:17,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 3 times [2019-01-14 04:43:17,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:17,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:17,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1729430288, now seen corresponding path program 1 times [2019-01-14 04:43:17,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:17,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:17,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:17,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:17,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:17,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:17,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:43:17,391 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:17,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:43:17,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:43:17,392 INFO L87 Difference]: Start difference. First operand 214 states and 300 transitions. cyclomatic complexity: 88 Second operand 5 states. [2019-01-14 04:43:17,639 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:43:17,905 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:43:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:18,200 INFO L93 Difference]: Finished difference Result 561 states and 769 transitions. [2019-01-14 04:43:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:43:18,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 769 transitions. [2019-01-14 04:43:18,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 516 [2019-01-14 04:43:18,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 561 states and 769 transitions. [2019-01-14 04:43:18,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2019-01-14 04:43:18,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2019-01-14 04:43:18,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 769 transitions. [2019-01-14 04:43:18,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:18,223 INFO L706 BuchiCegarLoop]: Abstraction has 561 states and 769 transitions. [2019-01-14 04:43:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 769 transitions. [2019-01-14 04:43:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 235. [2019-01-14 04:43:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 04:43:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 321 transitions. [2019-01-14 04:43:18,236 INFO L729 BuchiCegarLoop]: Abstraction has 235 states and 321 transitions. [2019-01-14 04:43:18,236 INFO L609 BuchiCegarLoop]: Abstraction has 235 states and 321 transitions. [2019-01-14 04:43:18,237 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:43:18,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 321 transitions. [2019-01-14 04:43:18,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 208 [2019-01-14 04:43:18,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:18,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:18,244 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:18,244 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:18,244 INFO L794 eck$LassoCheckResult]: Stem: 2621#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 2504#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2505#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 2555#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 2556#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2622#L156-1 assume !(0 == ~M_E~0); 2571#L240-1 assume !(0 == ~T1_E~0); 2572#L245-1 assume !(0 == ~E_1~0); 2608#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2584#L105 assume !(1 == ~m_pc~0); 2546#L105-2 is_master_triggered_~__retres1~0 := 0; 2578#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2589#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2570#L290 assume !(0 != activate_threads_~tmp~1); 2562#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2563#L124 assume !(1 == ~t1_pc~0); 2604#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 2605#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2538#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2539#L298 assume !(0 != activate_threads_~tmp___0~0); 2557#L298-2 assume !(1 == ~M_E~0); 2483#L263-1 assume !(1 == ~T1_E~0); 2484#L268-1 assume !(1 == ~E_1~0); 2564#L394-1 [2019-01-14 04:43:18,244 INFO L796 eck$LassoCheckResult]: Loop: 2564#L394-1 assume !false; 2536#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2537#L215 assume !false; 2616#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2624#L169 assume !(0 == ~m_st~0); 2680#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2679#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2678#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 2677#L196 assume !(0 != eval_~tmp~0); 2481#L230 start_simulation_~kernel_st~0 := 2; 2482#L144-1 start_simulation_~kernel_st~0 := 3; 2552#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2601#L240-4 assume !(0 == ~T1_E~0); 2660#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2655#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2654#L105-6 assume 1 == ~m_pc~0; 2490#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 2492#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2495#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2496#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2510#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2511#L124-6 assume !(1 == ~t1_pc~0); 2585#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 2586#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2520#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2521#L298-6 assume !(0 != activate_threads_~tmp___0~0); 2569#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 2508#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2509#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2543#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2533#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2535#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2609#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 2610#L413 assume !(0 == start_simulation_~tmp~3); 2612#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2618#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2705#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2704#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 2626#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2577#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 2479#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 2480#L426 assume !(0 != start_simulation_~tmp___0~1); 2564#L394-1 [2019-01-14 04:43:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 4 times [2019-01-14 04:43:18,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:18,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:18,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:18,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:18,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:18,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash -893019377, now seen corresponding path program 1 times [2019-01-14 04:43:18,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:18,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:18,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1597620181, now seen corresponding path program 1 times [2019-01-14 04:43:18,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:18,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:18,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:18,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:18,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:18,941 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-14 04:43:19,152 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 04:43:19,170 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:43:19,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:43:19,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:43:19,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:43:19,172 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:43:19,173 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:19,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:43:19,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:43:19,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.01_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-14 04:43:19,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:43:19,174 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:43:19,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:19,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:43:19,720 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:19,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:19,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:19,749 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:43:19,750 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:19,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:19,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:19,830 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:43:19,830 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret3=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:43:19,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:19,889 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:19,898 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:43:19,898 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t1_pc~0=4} Honda state: {~t1_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:19,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:19,988 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:19,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:43:19,995 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet1=0} Honda state: {ULTIMATE.start_eval_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:20,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:43:20,021 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:20,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:43:20,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:43:20,103 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:43:20,136 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:43:20,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:43:20,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:43:20,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:43:20,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:43:20,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:43:20,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:43:20,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:43:20,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.01_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-14 04:43:20,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:43:20,140 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:43:20,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:43:20,919 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:43:21,357 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:43:21,546 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:43:21,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:43:21,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:43:21,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:21,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:21,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:21,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:21,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:43:21,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:21,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:43:21,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:21,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:43:21,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:21,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:21,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:21,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:21,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:43:21,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:21,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:43:21,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:21,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:43:21,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:21,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:21,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:21,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:21,719 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:43:21,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:21,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:43:21,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:21,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:43:21,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:21,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:21,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:21,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:21,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:43:21,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:21,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:43:21,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:21,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:43:21,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:43:21,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:43:21,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:43:21,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:43:21,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:43:21,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:43:21,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:43:21,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:43:21,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:43:21,751 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:43:21,752 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:43:21,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:43:21,756 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:43:21,756 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:43:21,757 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M_E~0) = -1*~M_E~0 + 1 Supporting invariants [] [2019-01-14 04:43:21,758 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:43:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:21,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:43:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:21,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:43:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:21,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:43:21,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 235 states and 321 transitions. cyclomatic complexity: 88 Second operand 5 states. [2019-01-14 04:43:22,154 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 235 states and 321 transitions. cyclomatic complexity: 88. Second operand 5 states. Result 785 states and 1080 transitions. Complement of second has 5 states. [2019-01-14 04:43:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:43:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:43:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2019-01-14 04:43:22,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 280 transitions. Stem has 23 letters. Loop has 42 letters. [2019-01-14 04:43:22,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:43:22,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 280 transitions. Stem has 65 letters. Loop has 42 letters. [2019-01-14 04:43:22,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:43:22,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 280 transitions. Stem has 23 letters. Loop has 84 letters. [2019-01-14 04:43:22,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:43:22,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 1080 transitions. [2019-01-14 04:43:22,185 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 582 [2019-01-14 04:43:22,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 785 states and 1080 transitions. [2019-01-14 04:43:22,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2019-01-14 04:43:22,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 615 [2019-01-14 04:43:22,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1080 transitions. [2019-01-14 04:43:22,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:22,198 INFO L706 BuchiCegarLoop]: Abstraction has 785 states and 1080 transitions. [2019-01-14 04:43:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1080 transitions. [2019-01-14 04:43:22,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 572. [2019-01-14 04:43:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-01-14 04:43:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 787 transitions. [2019-01-14 04:43:22,225 INFO L729 BuchiCegarLoop]: Abstraction has 572 states and 787 transitions. [2019-01-14 04:43:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:22,226 INFO L87 Difference]: Start difference. First operand 572 states and 787 transitions. Second operand 3 states. [2019-01-14 04:43:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:22,350 INFO L93 Difference]: Finished difference Result 904 states and 1199 transitions. [2019-01-14 04:43:22,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:22,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1199 transitions. [2019-01-14 04:43:22,364 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 608 [2019-01-14 04:43:22,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 904 states and 1199 transitions. [2019-01-14 04:43:22,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2019-01-14 04:43:22,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 636 [2019-01-14 04:43:22,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 904 states and 1199 transitions. [2019-01-14 04:43:22,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:22,377 INFO L706 BuchiCegarLoop]: Abstraction has 904 states and 1199 transitions. [2019-01-14 04:43:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states and 1199 transitions. [2019-01-14 04:43:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 838. [2019-01-14 04:43:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-01-14 04:43:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1124 transitions. [2019-01-14 04:43:22,403 INFO L729 BuchiCegarLoop]: Abstraction has 838 states and 1124 transitions. [2019-01-14 04:43:22,403 INFO L609 BuchiCegarLoop]: Abstraction has 838 states and 1124 transitions. [2019-01-14 04:43:22,404 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:43:22,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 838 states and 1124 transitions. [2019-01-14 04:43:22,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 564 [2019-01-14 04:43:22,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:22,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:22,416 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:22,416 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:22,417 INFO L794 eck$LassoCheckResult]: Stem: 5439#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 5236#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5237#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 5311#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 5312#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5449#L156-1 assume !(0 == ~M_E~0); 5341#L240-1 assume !(0 == ~T1_E~0); 5342#L245-1 assume !(0 == ~E_1~0); 5413#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5363#L105 assume !(1 == ~m_pc~0); 5300#L105-2 is_master_triggered_~__retres1~0 := 0; 5354#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5301#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 5302#L290 assume !(0 != activate_threads_~tmp~1); 5321#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5322#L124 assume !(1 == ~t1_pc~0); 5400#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 5401#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5284#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5285#L298 assume !(0 != activate_threads_~tmp___0~0); 5314#L298-2 assume !(1 == ~M_E~0); 5197#L263-1 assume !(1 == ~T1_E~0); 5198#L268-1 assume 1 == ~E_1~0;~E_1~0 := 2; 5323#L394-1 [2019-01-14 04:43:22,417 INFO L796 eck$LassoCheckResult]: Loop: 5323#L394-1 assume !false; 5986#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5856#L215 assume !false; 5855#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5719#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5714#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5660#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 5397#L196 assume 0 != eval_~tmp~0; 5385#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 5386#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 5665#L31 assume !(0 == ~m_pc~0); 5664#L34 assume 1 == ~m_pc~0; 5462#L35 assume !false; 5463#L51 ~m_pc~0 := 1;~m_st~0 := 2; 5639#L201 assume !(0 == ~t1_st~0); 5725#L215 assume !false; 5726#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5717#L169 assume !(0 == ~m_st~0); 5718#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 5807#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5805#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 5802#L196 assume !(0 != eval_~tmp~0); 5803#L230 start_simulation_~kernel_st~0 := 2; 5890#L144-1 start_simulation_~kernel_st~0 := 3; 5888#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 5887#L240-4 assume !(0 == ~T1_E~0); 5886#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 5885#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5878#L105-6 assume 1 == ~m_pc~0; 5208#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 5210#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6012#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6011#L290-6 assume !(0 != activate_threads_~tmp~1); 5908#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5906#L124-6 assume !(1 == ~t1_pc~0); 5904#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 5903#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5902#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5900#L298-6 assume !(0 != activate_threads_~tmp___0~0); 5898#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 5733#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 5727#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 5724#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5721#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5707#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5706#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 5704#L413 assume !(0 == start_simulation_~tmp~3); 5434#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5276#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5277#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5440#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 5992#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5991#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 5989#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 5988#L426 assume !(0 != start_simulation_~tmp___0~1); 5323#L394-1 [2019-01-14 04:43:22,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413563, now seen corresponding path program 1 times [2019-01-14 04:43:22,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:22,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:22,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 04:43:22,500 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1663850066, now seen corresponding path program 1 times [2019-01-14 04:43:22,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:22,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 04:43:22,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:22,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 04:43:22,617 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:22,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:22,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:22,618 INFO L87 Difference]: Start difference. First operand 838 states and 1124 transitions. cyclomatic complexity: 292 Second operand 3 states. [2019-01-14 04:43:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:22,759 INFO L93 Difference]: Finished difference Result 814 states and 1060 transitions. [2019-01-14 04:43:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:22,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 814 states and 1060 transitions. [2019-01-14 04:43:22,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 546 [2019-01-14 04:43:22,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 814 states to 814 states and 1060 transitions. [2019-01-14 04:43:22,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 574 [2019-01-14 04:43:22,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 574 [2019-01-14 04:43:22,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 814 states and 1060 transitions. [2019-01-14 04:43:22,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:22,778 INFO L706 BuchiCegarLoop]: Abstraction has 814 states and 1060 transitions. [2019-01-14 04:43:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states and 1060 transitions. [2019-01-14 04:43:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2019-01-14 04:43:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-01-14 04:43:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1060 transitions. [2019-01-14 04:43:22,800 INFO L729 BuchiCegarLoop]: Abstraction has 814 states and 1060 transitions. [2019-01-14 04:43:22,800 INFO L609 BuchiCegarLoop]: Abstraction has 814 states and 1060 transitions. [2019-01-14 04:43:22,800 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:43:22,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 814 states and 1060 transitions. [2019-01-14 04:43:22,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 546 [2019-01-14 04:43:22,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:22,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:22,809 INFO L867 BuchiCegarLoop]: Counterexample stem 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] [2019-01-14 04:43:22,810 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:22,812 INFO L794 eck$LassoCheckResult]: Stem: 7092#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 6898#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 6899#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 6972#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 6973#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 7100#L156-1 assume !(0 == ~M_E~0); 7000#L240-1 assume !(0 == ~T1_E~0); 7001#L245-1 assume !(0 == ~E_1~0); 7063#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 7024#L105 assume !(1 == ~m_pc~0); 6960#L105-2 is_master_triggered_~__retres1~0 := 0; 7010#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6961#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6962#L290 assume !(0 != activate_threads_~tmp~1); 6982#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6983#L124 assume !(1 == ~t1_pc~0); 7053#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 7054#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6950#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6951#L298 assume !(0 != activate_threads_~tmp___0~0); 6975#L298-2 assume !(1 == ~M_E~0); 6863#L263-1 assume !(1 == ~T1_E~0); 6864#L268-1 assume !(1 == ~E_1~0); 6984#L394-1 assume !false; 7282#L395 [2019-01-14 04:43:22,812 INFO L796 eck$LassoCheckResult]: Loop: 7282#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 7522#L215 assume !false; 7519#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7516#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7497#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7510#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 7507#L196 assume 0 != eval_~tmp~0; 7438#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 7212#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 7214#L31 assume !(0 == ~m_pc~0); 7201#L34 assume 1 == ~m_pc~0; 7202#L35 assume !false; 7505#L51 ~m_pc~0 := 1;~m_st~0 := 2; 7503#L201 assume !(0 == ~t1_st~0); 7499#L215 assume !false; 7498#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7496#L169 assume !(0 == ~m_st~0); 7494#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 7493#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7492#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 7490#L196 assume !(0 != eval_~tmp~0); 7489#L230 start_simulation_~kernel_st~0 := 2; 7488#L144-1 start_simulation_~kernel_st~0 := 3; 7487#L240-2 assume !(0 == ~M_E~0); 7486#L240-4 assume !(0 == ~T1_E~0); 7283#L245-3 assume !(0 == ~E_1~0); 7485#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 7484#L105-6 assume 1 == ~m_pc~0; 7482#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 7481#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7393#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7394#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 7479#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7070#L124-6 assume !(1 == ~t1_pc~0); 7071#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 7538#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 7536#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7534#L298-6 assume !(0 != activate_threads_~tmp___0~0); 7532#L298-8 assume !(1 == ~M_E~0); 7529#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 7372#L268-3 assume !(1 == ~E_1~0); 7373#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7366#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7354#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7470#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 7325#L413 assume !(0 == start_simulation_~tmp~3); 7326#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7539#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7527#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7537#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 7535#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7533#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 7531#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 7530#L426 assume !(0 != start_simulation_~tmp___0~1); 7528#L394-1 assume !false; 7282#L395 [2019-01-14 04:43:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash -663180023, now seen corresponding path program 1 times [2019-01-14 04:43:22,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:22,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash -990001554, now seen corresponding path program 1 times [2019-01-14 04:43:22,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:22,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:22,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:22,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 04:43:22,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:22,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:22,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:22,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:22,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:22,907 INFO L87 Difference]: Start difference. First operand 814 states and 1060 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-01-14 04:43:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:23,201 INFO L93 Difference]: Finished difference Result 1231 states and 1561 transitions. [2019-01-14 04:43:23,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:23,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1231 states and 1561 transitions. [2019-01-14 04:43:23,217 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 748 [2019-01-14 04:43:23,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1231 states to 1171 states and 1489 transitions. [2019-01-14 04:43:23,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 798 [2019-01-14 04:43:23,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 798 [2019-01-14 04:43:23,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1171 states and 1489 transitions. [2019-01-14 04:43:23,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:43:23,234 INFO L706 BuchiCegarLoop]: Abstraction has 1171 states and 1489 transitions. [2019-01-14 04:43:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states and 1489 transitions. [2019-01-14 04:43:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1163. [2019-01-14 04:43:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-01-14 04:43:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1479 transitions. [2019-01-14 04:43:23,271 INFO L729 BuchiCegarLoop]: Abstraction has 1163 states and 1479 transitions. [2019-01-14 04:43:23,272 INFO L609 BuchiCegarLoop]: Abstraction has 1163 states and 1479 transitions. [2019-01-14 04:43:23,272 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:43:23,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1163 states and 1479 transitions. [2019-01-14 04:43:23,287 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 742 [2019-01-14 04:43:23,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:23,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:23,289 INFO L867 BuchiCegarLoop]: Counterexample stem 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] [2019-01-14 04:43:23,289 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:23,290 INFO L794 eck$LassoCheckResult]: Stem: 9148#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 8944#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 8945#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 9017#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 9018#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 9154#L156-1 assume 0 == ~M_E~0;~M_E~0 := 1; 9045#L240-1 assume !(0 == ~T1_E~0); 9046#L245-1 assume !(0 == ~E_1~0); 9164#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 9165#L105 assume !(1 == ~m_pc~0); 9060#L105-2 is_master_triggered_~__retres1~0 := 0; 9061#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9007#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 9008#L290 assume !(0 != activate_threads_~tmp~1); 9024#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9025#L124 assume !(1 == ~t1_pc~0); 9112#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 9113#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8996#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 8997#L298 assume !(0 != activate_threads_~tmp___0~0); 9019#L298-2 assume 1 == ~M_E~0;~M_E~0 := 2; 8914#L263-1 assume !(1 == ~T1_E~0); 8915#L268-1 assume !(1 == ~E_1~0); 9026#L394-1 assume !false; 8992#L395 [2019-01-14 04:43:23,295 INFO L796 eck$LassoCheckResult]: Loop: 8992#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 8993#L215 assume !false; 10029#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9703#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9701#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9699#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 9697#L196 assume 0 != eval_~tmp~0; 9695#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 9681#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 9693#L31 assume !(0 == ~m_pc~0); 9687#L34 assume 1 == ~m_pc~0; 9684#L35 assume !false; 9682#L51 ~m_pc~0 := 1;~m_st~0 := 2; 9679#L201 assume !(0 == ~t1_st~0); 9677#L215 assume !false; 10027#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10028#L169 assume !(0 == ~m_st~0); 10037#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 10035#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9997#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 9998#L196 assume !(0 != eval_~tmp~0); 8910#L230 start_simulation_~kernel_st~0 := 2; 8911#L144-1 start_simulation_~kernel_st~0 := 3; 9011#L240-2 assume !(0 == ~M_E~0); 9092#L240-4 assume !(0 == ~T1_E~0); 9093#L245-3 assume !(0 == ~E_1~0); 9118#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 9100#L105-6 assume !(1 == ~m_pc~0); 8921#L105-8 is_master_triggered_~__retres1~0 := 0; 9946#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9944#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 9942#L290-6 assume !(0 != activate_threads_~tmp~1); 9938#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9936#L124-6 assume !(1 == ~t1_pc~0); 9933#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 9932#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9925#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9043#L298-6 assume !(0 != activate_threads_~tmp___0~0); 9031#L298-8 assume !(1 == ~M_E~0); 9032#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 9483#L268-3 assume !(1 == ~E_1~0); 9464#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9465#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9468#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10039#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 9129#L413 assume !(0 == start_simulation_~tmp~3); 9130#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8976#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8977#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10041#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 9171#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 9057#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 9058#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 9167#L426 assume !(0 != start_simulation_~tmp___0~1); 9168#L394-1 assume !false; 8992#L395 [2019-01-14 04:43:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:23,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1025704137, now seen corresponding path program 1 times [2019-01-14 04:43:23,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:23,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:23,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:23,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:23,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:43:23,380 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1432454069, now seen corresponding path program 1 times [2019-01-14 04:43:23,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:23,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:23,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:23,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:23,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:23,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:23,482 INFO L87 Difference]: Start difference. First operand 1163 states and 1479 transitions. cyclomatic complexity: 324 Second operand 3 states. [2019-01-14 04:43:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:23,690 INFO L93 Difference]: Finished difference Result 700 states and 871 transitions. [2019-01-14 04:43:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:23,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 871 transitions. [2019-01-14 04:43:23,697 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 476 [2019-01-14 04:43:23,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 501 states and 623 transitions. [2019-01-14 04:43:23,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 501 [2019-01-14 04:43:23,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 501 [2019-01-14 04:43:23,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 501 states and 623 transitions. [2019-01-14 04:43:23,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:23,709 INFO L706 BuchiCegarLoop]: Abstraction has 501 states and 623 transitions. [2019-01-14 04:43:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states and 623 transitions. [2019-01-14 04:43:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 301. [2019-01-14 04:43:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-14 04:43:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 371 transitions. [2019-01-14 04:43:23,720 INFO L729 BuchiCegarLoop]: Abstraction has 301 states and 371 transitions. [2019-01-14 04:43:23,720 INFO L609 BuchiCegarLoop]: Abstraction has 301 states and 371 transitions. [2019-01-14 04:43:23,721 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:43:23,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 371 transitions. [2019-01-14 04:43:23,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 277 [2019-01-14 04:43:23,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:23,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:23,726 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:23,726 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:23,729 INFO L794 eck$LassoCheckResult]: Stem: 10912#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 10798#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 10799#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 10844#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 10845#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 10917#L156-1 assume !(0 == ~M_E~0); 10861#L240-1 assume !(0 == ~T1_E~0); 10862#L245-1 assume !(0 == ~E_1~0); 10900#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 10878#L105 assume !(1 == ~m_pc~0); 10834#L105-2 is_master_triggered_~__retres1~0 := 0; 10870#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10835#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10836#L290 assume !(0 != activate_threads_~tmp~1); 10853#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10854#L124 assume !(1 == ~t1_pc~0); 10895#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 10896#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10828#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10829#L298 assume !(0 != activate_threads_~tmp___0~0); 10847#L298-2 assume !(1 == ~M_E~0); 10780#L263-1 assume !(1 == ~T1_E~0); 10781#L268-1 assume !(1 == ~E_1~0); 10855#L394-1 [2019-01-14 04:43:23,730 INFO L796 eck$LassoCheckResult]: Loop: 10855#L394-1 assume !false; 11038#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 11012#L215 assume !false; 10924#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10831#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10832#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11068#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 10893#L196 assume 0 != eval_~tmp~0; 10894#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 10982#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 10980#L31 assume !(0 == ~m_pc~0); 10978#L34 assume 1 == ~m_pc~0; 10979#L35 assume !false; 10788#L51 ~m_pc~0 := 1;~m_st~0 := 2; 10789#L201 assume !(0 == ~t1_st~0); 10827#L215 assume !false; 10909#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10995#L169 assume !(0 == ~m_st~0); 10988#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 10987#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10986#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 10984#L196 assume !(0 != eval_~tmp~0); 10981#L230 start_simulation_~kernel_st~0 := 2; 10976#L144-1 start_simulation_~kernel_st~0 := 3; 10974#L240-2 assume !(0 == ~M_E~0); 10971#L240-4 assume !(0 == ~T1_E~0); 10967#L245-3 assume !(0 == ~E_1~0); 10963#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 10956#L105-6 assume !(1 == ~m_pc~0); 10948#L105-8 is_master_triggered_~__retres1~0 := 0; 10942#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10790#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10791#L290-6 assume !(0 != activate_threads_~tmp~1); 10804#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10805#L124-6 assume !(1 == ~t1_pc~0); 10879#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 10880#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10812#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10813#L298-6 assume !(0 != activate_threads_~tmp___0~0); 10858#L298-8 assume !(1 == ~M_E~0); 10802#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 10803#L268-3 assume !(1 == ~E_1~0); 10830#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10823#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10825#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11069#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 10905#L413 assume !(0 == start_simulation_~tmp~3); 10906#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10819#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10820#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10881#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 10882#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 10869#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 10776#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 10777#L426 assume !(0 != start_simulation_~tmp___0~1); 10855#L394-1 [2019-01-14 04:43:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 5 times [2019-01-14 04:43:23,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:23,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 46950099, now seen corresponding path program 2 times [2019-01-14 04:43:23,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:23,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:23,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:23,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:23,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:23,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:23,851 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:23,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:23,855 INFO L87 Difference]: Start difference. First operand 301 states and 371 transitions. cyclomatic complexity: 72 Second operand 3 states. [2019-01-14 04:43:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:24,043 INFO L93 Difference]: Finished difference Result 358 states and 433 transitions. [2019-01-14 04:43:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:24,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 358 states and 433 transitions. [2019-01-14 04:43:24,052 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-01-14 04:43:24,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 358 states to 358 states and 433 transitions. [2019-01-14 04:43:24,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2019-01-14 04:43:24,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2019-01-14 04:43:24,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 358 states and 433 transitions. [2019-01-14 04:43:24,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:24,057 INFO L706 BuchiCegarLoop]: Abstraction has 358 states and 433 transitions. [2019-01-14 04:43:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states and 433 transitions. [2019-01-14 04:43:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2019-01-14 04:43:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-01-14 04:43:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 400 transitions. [2019-01-14 04:43:24,072 INFO L729 BuchiCegarLoop]: Abstraction has 328 states and 400 transitions. [2019-01-14 04:43:24,072 INFO L609 BuchiCegarLoop]: Abstraction has 328 states and 400 transitions. [2019-01-14 04:43:24,072 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:43:24,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 400 transitions. [2019-01-14 04:43:24,077 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-01-14 04:43:24,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:24,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:24,080 INFO L867 BuchiCegarLoop]: Counterexample stem 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] [2019-01-14 04:43:24,081 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:24,081 INFO L794 eck$LassoCheckResult]: Stem: 11588#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 11463#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 11464#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 11508#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 11509#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 11593#L156-1 assume !(0 == ~M_E~0); 11525#L240-1 assume !(0 == ~T1_E~0); 11526#L245-1 assume !(0 == ~E_1~0); 11573#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 11542#L105 assume 1 == ~m_pc~0; 11497#L106 assume !(1 == ~M_E~0); 11498#L105-2 is_master_triggered_~__retres1~0 := 0; 11547#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 11499#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 11500#L290 assume !(0 != activate_threads_~tmp~1); 11521#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 11567#L124 assume !(1 == ~t1_pc~0); 11568#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 11569#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 11492#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 11493#L298 assume !(0 != activate_threads_~tmp___0~0); 11511#L298-2 assume !(1 == ~M_E~0); 11443#L263-1 assume !(1 == ~T1_E~0); 11444#L268-1 assume !(1 == ~E_1~0); 11516#L394-1 [2019-01-14 04:43:24,081 INFO L796 eck$LassoCheckResult]: Loop: 11516#L394-1 assume !false; 11759#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 11758#L215 assume !false; 11754#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11753#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11723#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11578#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 11579#L196 assume 0 != eval_~tmp~0; 11752#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 11580#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 11582#L31 assume !(0 == ~m_pc~0); 11522#L34 assume 1 == ~m_pc~0; 11507#L35 assume !false; 11455#L51 ~m_pc~0 := 1;~m_st~0 := 2; 11456#L201 assume !(0 == ~t1_st~0); 11528#L215 assume !false; 11724#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11722#L169 assume !(0 == ~m_st~0); 11595#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 11597#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11671#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 11660#L196 assume !(0 != eval_~tmp~0); 11661#L230 start_simulation_~kernel_st~0 := 2; 11504#L144-1 start_simulation_~kernel_st~0 := 3; 11505#L240-2 assume !(0 == ~M_E~0); 11554#L240-4 assume !(0 == ~T1_E~0); 11555#L245-3 assume !(0 == ~E_1~0); 11570#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 11556#L105-6 assume 1 == ~m_pc~0; 11451#L106-2 assume !(1 == ~M_E~0); 11452#L105-8 is_master_triggered_~__retres1~0 := 0; 11535#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 11453#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 11454#L290-6 assume !(0 != activate_threads_~tmp~1); 11469#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 11470#L124-6 assume !(1 == ~t1_pc~0); 11543#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 11544#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 11477#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 11478#L298-6 assume !(0 != activate_threads_~tmp___0~0); 11520#L298-8 assume !(1 == ~M_E~0); 11467#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 11468#L268-3 assume !(1 == ~E_1~0); 11494#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11695#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11696#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11735#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 11687#L413 assume !(0 == start_simulation_~tmp~3); 11583#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11584#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11589#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11590#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 11764#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11763#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 11762#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 11761#L426 assume !(0 != start_simulation_~tmp___0~1); 11516#L394-1 [2019-01-14 04:43:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 379540498, now seen corresponding path program 1 times [2019-01-14 04:43:24,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:24,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:24,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:24,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:43:24,152 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:24,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1425347569, now seen corresponding path program 1 times [2019-01-14 04:43:24,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:24,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 04:43:24,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:24,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:24,243 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:43:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:24,244 INFO L87 Difference]: Start difference. First operand 328 states and 400 transitions. cyclomatic complexity: 76 Second operand 3 states. [2019-01-14 04:43:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:24,274 INFO L93 Difference]: Finished difference Result 316 states and 382 transitions. [2019-01-14 04:43:24,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:24,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 382 transitions. [2019-01-14 04:43:24,278 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-01-14 04:43:24,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 382 transitions. [2019-01-14 04:43:24,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-01-14 04:43:24,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-01-14 04:43:24,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 382 transitions. [2019-01-14 04:43:24,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:24,285 INFO L706 BuchiCegarLoop]: Abstraction has 316 states and 382 transitions. [2019-01-14 04:43:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 382 transitions. [2019-01-14 04:43:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2019-01-14 04:43:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-14 04:43:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2019-01-14 04:43:24,293 INFO L729 BuchiCegarLoop]: Abstraction has 312 states and 378 transitions. [2019-01-14 04:43:24,293 INFO L609 BuchiCegarLoop]: Abstraction has 312 states and 378 transitions. [2019-01-14 04:43:24,293 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:43:24,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 312 states and 378 transitions. [2019-01-14 04:43:24,297 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-01-14 04:43:24,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:24,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:24,300 INFO L867 BuchiCegarLoop]: Counterexample stem 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] [2019-01-14 04:43:24,300 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:24,301 INFO L794 eck$LassoCheckResult]: Stem: 12228#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 12112#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12113#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 12156#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 12157#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 12231#L156-1 assume !(0 == ~M_E~0); 12170#L240-1 assume !(0 == ~T1_E~0); 12171#L245-1 assume !(0 == ~E_1~0); 12215#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 12187#L105 assume !(1 == ~m_pc~0); 12179#L105-2 is_master_triggered_~__retres1~0 := 0; 12180#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 12147#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12148#L290 assume !(0 != activate_threads_~tmp~1); 12163#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 12164#L124 assume !(1 == ~t1_pc~0); 12208#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 12209#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 12137#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12138#L298 assume !(0 != activate_threads_~tmp___0~0); 12158#L298-2 assume !(1 == ~M_E~0); 12094#L263-1 assume !(1 == ~T1_E~0); 12095#L268-1 assume !(1 == ~E_1~0); 12165#L394-1 assume !false; 12285#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 12280#L215 [2019-01-14 04:43:24,301 INFO L796 eck$LassoCheckResult]: Loop: 12280#L215 assume !false; 12276#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 12273#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 12270#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 12266#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 12263#L196 assume 0 != eval_~tmp~0; 12261#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 12258#L204 assume !(0 != eval_~tmp_ndt_1~0); 12259#L201 assume !(0 == ~t1_st~0); 12280#L215 [2019-01-14 04:43:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 1 times [2019-01-14 04:43:24,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:24,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:24,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1324144305, now seen corresponding path program 1 times [2019-01-14 04:43:24,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:24,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:24,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:24,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:24,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1901692119, now seen corresponding path program 1 times [2019-01-14 04:43:24,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:24,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:24,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:24,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:24,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:24,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:43:24,785 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 04:43:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:24,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:24,805 INFO L87 Difference]: Start difference. First operand 312 states and 378 transitions. cyclomatic complexity: 70 Second operand 3 states. [2019-01-14 04:43:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:24,885 INFO L93 Difference]: Finished difference Result 522 states and 619 transitions. [2019-01-14 04:43:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:24,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 522 states and 619 transitions. [2019-01-14 04:43:24,892 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 357 [2019-01-14 04:43:24,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 522 states to 522 states and 619 transitions. [2019-01-14 04:43:24,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2019-01-14 04:43:24,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2019-01-14 04:43:24,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 619 transitions. [2019-01-14 04:43:24,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:24,902 INFO L706 BuchiCegarLoop]: Abstraction has 522 states and 619 transitions. [2019-01-14 04:43:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 619 transitions. [2019-01-14 04:43:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 458. [2019-01-14 04:43:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-01-14 04:43:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 545 transitions. [2019-01-14 04:43:24,916 INFO L729 BuchiCegarLoop]: Abstraction has 458 states and 545 transitions. [2019-01-14 04:43:24,916 INFO L609 BuchiCegarLoop]: Abstraction has 458 states and 545 transitions. [2019-01-14 04:43:24,916 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:43:24,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 458 states and 545 transitions. [2019-01-14 04:43:24,923 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 333 [2019-01-14 04:43:24,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:24,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:24,925 INFO L867 BuchiCegarLoop]: Counterexample stem 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] [2019-01-14 04:43:24,925 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:24,930 INFO L794 eck$LassoCheckResult]: Stem: 13075#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 12954#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12955#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 12998#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 12999#L151-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 13079#L156-1 assume !(0 == ~M_E~0); 13015#L240-1 assume !(0 == ~T1_E~0); 13016#L245-1 assume !(0 == ~E_1~0); 13276#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 13274#L105 assume !(1 == ~m_pc~0); 13271#L105-2 is_master_triggered_~__retres1~0 := 0; 13270#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13269#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 13011#L290 assume !(0 != activate_threads_~tmp~1); 13012#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13054#L124 assume !(1 == ~t1_pc~0); 13055#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 13056#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13057#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 13035#L298 assume !(0 != activate_threads_~tmp___0~0); 13036#L298-2 assume !(1 == ~M_E~0); 12936#L263-1 assume !(1 == ~T1_E~0); 12937#L268-1 assume !(1 == ~E_1~0); 13258#L394-1 assume !false; 13233#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 13234#L215 [2019-01-14 04:43:24,930 INFO L796 eck$LassoCheckResult]: Loop: 13234#L215 assume !false; 13211#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13212#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13208#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13207#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 13206#L196 assume 0 != eval_~tmp~0; 13205#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 13202#L204 assume !(0 != eval_~tmp_ndt_1~0); 13203#L201 assume !(0 == ~t1_st~0); 13234#L215 [2019-01-14 04:43:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1338957707, now seen corresponding path program 1 times [2019-01-14 04:43:24,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:24,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:43:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:43:25,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:43:25,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:43:25,001 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:43:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1324144305, now seen corresponding path program 2 times [2019-01-14 04:43:25,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:25,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,458 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 04:43:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:43:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:43:25,511 INFO L87 Difference]: Start difference. First operand 458 states and 545 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-01-14 04:43:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:43:25,516 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2019-01-14 04:43:25,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:43:25,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 355 transitions. [2019-01-14 04:43:25,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 221 [2019-01-14 04:43:25,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 297 states and 355 transitions. [2019-01-14 04:43:25,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2019-01-14 04:43:25,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2019-01-14 04:43:25,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 355 transitions. [2019-01-14 04:43:25,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:43:25,529 INFO L706 BuchiCegarLoop]: Abstraction has 297 states and 355 transitions. [2019-01-14 04:43:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 355 transitions. [2019-01-14 04:43:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-01-14 04:43:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-14 04:43:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2019-01-14 04:43:25,541 INFO L729 BuchiCegarLoop]: Abstraction has 297 states and 355 transitions. [2019-01-14 04:43:25,541 INFO L609 BuchiCegarLoop]: Abstraction has 297 states and 355 transitions. [2019-01-14 04:43:25,541 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:43:25,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 297 states and 355 transitions. [2019-01-14 04:43:25,548 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 221 [2019-01-14 04:43:25,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:43:25,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:43:25,549 INFO L867 BuchiCegarLoop]: Counterexample stem 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] [2019-01-14 04:43:25,549 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:43:25,549 INFO L794 eck$LassoCheckResult]: Stem: 13814#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 13715#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 13716#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 13758#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 13759#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 13819#L156-1 assume !(0 == ~M_E~0); 13771#L240-1 assume !(0 == ~T1_E~0); 13772#L245-1 assume !(0 == ~E_1~0); 13803#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 13783#L105 assume !(1 == ~m_pc~0); 13778#L105-2 is_master_triggered_~__retres1~0 := 0; 13779#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13750#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 13751#L290 assume !(0 != activate_threads_~tmp~1); 13763#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13764#L124 assume !(1 == ~t1_pc~0); 13798#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 13799#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13740#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 13741#L298 assume !(0 != activate_threads_~tmp___0~0); 13760#L298-2 assume !(1 == ~M_E~0); 13697#L263-1 assume !(1 == ~T1_E~0); 13698#L268-1 assume !(1 == ~E_1~0); 13765#L394-1 assume !false; 13742#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 13743#L215 [2019-01-14 04:43:25,549 INFO L796 eck$LassoCheckResult]: Loop: 13743#L215 assume !false; 13977#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13976#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13973#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13971#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 13970#L196 assume 0 != eval_~tmp~0; 13969#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 13809#L204 assume !(0 != eval_~tmp_ndt_1~0); 13802#L201 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 13773#L218 assume !(0 != eval_~tmp_ndt_2~0); 13743#L215 [2019-01-14 04:43:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 2 times [2019-01-14 04:43:25,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:25,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1901200370, now seen corresponding path program 1 times [2019-01-14 04:43:25,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:25,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:43:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:43:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1177085590, now seen corresponding path program 1 times [2019-01-14 04:43:25,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:43:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:43:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:43:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:43:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:25,782 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-14 04:43:26,073 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-01-14 04:43:26,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:43:26 BoogieIcfgContainer [2019-01-14 04:43:26,156 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:43:26,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:43:26,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:43:26,157 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:43:26,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:43:14" (3/4) ... [2019-01-14 04:43:26,167 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:43:26,244 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:43:26,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:43:26,247 INFO L168 Benchmark]: Toolchain (without parser) took 14055.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 952.7 MB in the beginning and 859.8 MB in the end (delta: 92.8 MB). Peak memory consumption was 284.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:26,249 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:43:26,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.56 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:26,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.95 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:43:26,253 INFO L168 Benchmark]: Boogie Preprocessor took 170.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:26,254 INFO L168 Benchmark]: RCFGBuilder took 1453.28 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:26,255 INFO L168 Benchmark]: BuchiAutomizer took 11682.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 859.8 MB in the end (delta: 199.8 MB). Peak memory consumption was 280.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:26,256 INFO L168 Benchmark]: Witness Printer took 87.48 ms. Allocated memory is still 1.2 GB. Free memory is still 859.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:43:26,260 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 548.56 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.95 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 170.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1453.28 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11682.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 859.8 MB in the end (delta: 199.8 MB). Peak memory consumption was 280.0 MB. Max. memory is 11.5 GB. * Witness Printer took 87.48 ms. Allocated memory is still 1.2 GB. Free memory is still 859.8 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 14 terminating modules (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * M_E + 1 and consists of 3 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 297 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.5s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 2.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 4. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1174 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1163 states and ocurred in iteration 8. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2521 SDtfs, 2475 SDslu, 2610 SDs, 0 SdLazy, 263 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc1 concLT1 SILN1 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital83 mio100 ax100 hnf100 lsp13 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf120 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 191]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d1b89e=0, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1853658=0, tmp=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@783b3e57=0, kernel_st=1, __retres1=0, tmp___0=0, t1_pc=0, __retres1=1, T1_E=2, \result=0, E_1=2, tmp_ndt_1=0, M_E=2, tmp_ndt_2=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d372906=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@549686b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@aa462a6=0, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@655ea36e=0, t1_st=0, m_st=0, tmp___0=0, tmp=0, __retres1=0, t1_i=1, m_pc=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 191]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 [L151] COND TRUE m_i == 1 [L152] m_st = 0 [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 [L240] COND FALSE !(M_E == 0) [L245] COND FALSE !(T1_E == 0) [L250] COND FALSE !(E_1 == 0) [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; [L105] COND FALSE !(m_pc == 1) [L115] __retres1 = 0 [L117] return (__retres1); [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) [L121] int __retres1 ; [L124] COND FALSE !(t1_pc == 1) [L134] __retres1 = 0 [L136] return (__retres1); [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) [L263] COND FALSE !(M_E == 1) [L268] COND FALSE !(T1_E == 1) [L273] COND FALSE !(E_1 == 1) [L394] COND TRUE 1 [L397] kernel_st = 1 [L187] int tmp ; Loop: [L191] COND TRUE 1 [L166] int __retres1 ; [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 [L182] return (__retres1); [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...