./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/token_ring.01_true-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 2216fd6115b2bb44c4633e353be739828d7cac46 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2019-01-01 23:58:11,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:58:11,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:58:11,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:58:11,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:58:11,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:58:11,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:58:11,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:58:11,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:58:11,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:58:11,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:58:11,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:58:11,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:58:11,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:58:11,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:58:11,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:58:11,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:58:11,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:58:11,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:58:11,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:58:11,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:58:11,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:58:11,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:58:11,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:58:11,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:58:11,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:58:11,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:58:11,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:58:11,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:58:11,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:58:11,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:58:11,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:58:11,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:58:11,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:58:11,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:58:11,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:58:11,146 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:58:11,164 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:58:11,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:58:11,165 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:58:11,166 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:58:11,166 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:58:11,166 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:58:11,166 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:58:11,167 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:58:11,167 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:58:11,167 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:58:11,167 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:58:11,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:58:11,168 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:58:11,168 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:58:11,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:58:11,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:58:11,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:58:11,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:58:11,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:58:11,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:58:11,170 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:58:11,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:58:11,170 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:58:11,171 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:58:11,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:58:11,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:58:11,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:58:11,172 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:58:11,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:58:11,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:58:11,173 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:58:11,174 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:58:11,174 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 -> 2216fd6115b2bb44c4633e353be739828d7cac46 [2019-01-01 23:58:11,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:58:11,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:58:11,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:58:11,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:58:11,252 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:58:11,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2019-01-01 23:58:11,332 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f574bca/ca53cff783ba4267ae9badaffad05103/FLAG1b3aef14f [2019-01-01 23:58:11,842 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:58:11,843 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2019-01-01 23:58:11,853 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f574bca/ca53cff783ba4267ae9badaffad05103/FLAG1b3aef14f [2019-01-01 23:58:12,168 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f574bca/ca53cff783ba4267ae9badaffad05103 [2019-01-01 23:58:12,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:58:12,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:58:12,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:58:12,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:58:12,179 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:58:12,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c03e545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12, skipping insertion in model container [2019-01-01 23:58:12,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:58:12,250 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:58:12,543 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:58:12,551 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:58:12,593 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:58:12,616 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:58:12,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12 WrapperNode [2019-01-01 23:58:12,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:58:12,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:58:12,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:58:12,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:58:12,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:58:12,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:58:12,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:58:12,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:58:12,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (1/1) ... [2019-01-01 23:58:12,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:58:12,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:58:12,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:58:12,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:58:12,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58: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-01 23:58:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:58:12,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:58:13,927 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:58:13,928 INFO L280 CfgBuilder]: Removed 80 assue(true) statements. [2019-01-01 23:58:13,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:58:13 BoogieIcfgContainer [2019-01-01 23:58:13,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:58:13,929 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:58:13,929 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:58:13,933 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:58:13,934 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:58:13,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:58:12" (1/3) ... [2019-01-01 23:58:13,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fbca438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:58:13, skipping insertion in model container [2019-01-01 23:58:13,936 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:58:13,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:58:12" (2/3) ... [2019-01-01 23:58:13,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fbca438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:58:13, skipping insertion in model container [2019-01-01 23:58:13,936 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:58:13,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:58:13" (3/3) ... [2019-01-01 23:58:13,939 INFO L375 chiAutomizerObserver]: Analyzing ICFG token_ring.01_true-unreach-call_false-termination.cil.c [2019-01-01 23:58:14,000 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:58:14,001 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:58:14,001 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:58:14,001 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:58:14,002 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:58:14,002 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:58:14,002 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:58:14,002 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:58:14,002 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:58:14,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-01 23:58:14,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-01-01 23:58:14,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:14,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:14,071 INFO L866 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-01 23:58:14,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:14,071 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:58:14,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-01 23:58:14,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-01-01 23:58:14,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:14,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:14,083 INFO L866 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-01 23:58:14,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:14,093 INFO L794 eck$LassoCheckResult]: Stem: 105#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 7#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 32#L381true havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 10#L153true assume !(1 == ~m_i~0);~m_st~0 := 2; 94#L160-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 106#L165-1true assume !(0 == ~M_E~0); 41#L249-1true assume !(0 == ~T1_E~0); 54#L254-1true assume !(0 == ~E_M~0); 100#L259-1true assume !(0 == ~E_1~0); 104#L264-1true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 23#L114true assume !(1 == ~m_pc~0); 16#L114-2true is_master_triggered_~__retres1~0 := 0; 24#L125true is_master_triggered_#res := is_master_triggered_~__retres1~0; 121#L126true activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 82#L309true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 61#L309-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 47#L133true assume 1 == ~t1_pc~0; 129#L134true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 48#L144true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 130#L145true activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 85#L317true assume !(0 != activate_threads_~tmp___0~0); 87#L317-2true assume !(1 == ~M_E~0); 135#L277-1true assume !(1 == ~T1_E~0); 43#L282-1true assume !(1 == ~E_M~0); 55#L287-1true assume 1 == ~E_1~0;~E_1~0 := 2; 116#L418-1true [2019-01-01 23:58:14,094 INFO L796 eck$LassoCheckResult]: Loop: 116#L418-1true assume !false; 79#L419true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 62#L224true assume !true; 108#L239true start_simulation_~kernel_st~0 := 2; 9#L153-1true start_simulation_~kernel_st~0 := 3; 36#L249-2true assume 0 == ~M_E~0;~M_E~0 := 1; 30#L249-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 49#L254-3true assume 0 == ~E_M~0;~E_M~0 := 1; 96#L259-3true assume !(0 == ~E_1~0); 102#L264-3true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 6#L114-9true assume !(1 == ~m_pc~0); 5#L114-11true is_master_triggered_~__retres1~0 := 0; 13#L125-3true is_master_triggered_#res := is_master_triggered_~__retres1~0; 112#L126-3true activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 52#L309-9true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 56#L309-11true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 22#L133-9true assume 1 == ~t1_pc~0; 139#L134-3true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 70#L144-3true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 141#L145-3true activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 58#L317-9true assume !(0 != activate_threads_~tmp___0~0); 65#L317-11true assume 1 == ~M_E~0;~M_E~0 := 2; 133#L277-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 37#L282-3true assume 1 == ~E_M~0;~E_M~0 := 2; 51#L287-3true assume 1 == ~E_1~0;~E_1~0 := 2; 98#L292-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 131#L178-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 91#L190-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 27#L191-1true start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 134#L437true assume !(0 == start_simulation_~tmp~3); 122#L437-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 128#L178-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 90#L190-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 26#L191-2true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 31#L392true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 107#L399true stop_simulation_#res := stop_simulation_~__retres2~0; 74#L400true start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 20#L450true assume !(0 != start_simulation_~tmp___0~1); 116#L418-1true [2019-01-01 23:58:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 22332154, now seen corresponding path program 1 times [2019-01-01 23:58:14,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:14,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:14,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:14,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:14,274 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-01 23:58:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:14,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:14,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:58:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1921652372, now seen corresponding path program 1 times [2019-01-01 23:58:14,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:14,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:14,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:14,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:14,300 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-01 23:58:14,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:14,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:58:14,303 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:14,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:14,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:14,325 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-01-01 23:58:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:14,379 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2019-01-01 23:58:14,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:14,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 208 transitions. [2019-01-01 23:58:14,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2019-01-01 23:58:14,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 135 states and 203 transitions. [2019-01-01 23:58:14,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2019-01-01 23:58:14,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-01-01 23:58:14,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 203 transitions. [2019-01-01 23:58:14,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:14,402 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2019-01-01 23:58:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 203 transitions. [2019-01-01 23:58:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-01 23:58:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-01 23:58:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2019-01-01 23:58:14,445 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2019-01-01 23:58:14,446 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2019-01-01 23:58:14,446 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:58:14,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 203 transitions. [2019-01-01 23:58:14,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2019-01-01 23:58:14,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:14,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:14,452 INFO L866 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-01 23:58:14,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:14,452 INFO L794 eck$LassoCheckResult]: Stem: 421#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 297#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 298#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 301#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 302#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 414#L165-1 assume !(0 == ~M_E~0); 354#L249-1 assume !(0 == ~T1_E~0); 355#L254-1 assume !(0 == ~E_M~0); 376#L259-1 assume !(0 == ~E_1~0); 419#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 327#L114 assume !(1 == ~m_pc~0); 313#L114-2 is_master_triggered_~__retres1~0 := 0; 314#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 331#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 403#L309 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 382#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 365#L133 assume 1 == ~t1_pc~0; 366#L134 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 368#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 369#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 407#L317 assume !(0 != activate_threads_~tmp___0~0); 408#L317-2 assume !(1 == ~M_E~0); 409#L277-1 assume !(1 == ~T1_E~0); 361#L282-1 assume !(1 == ~E_M~0); 362#L287-1 assume 1 == ~E_1~0;~E_1~0 := 2; 319#L418-1 [2019-01-01 23:58:14,453 INFO L796 eck$LassoCheckResult]: Loop: 319#L418-1 assume !false; 399#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 358#L224 assume !false; 383#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 413#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 412#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 377#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 352#L205 assume !(0 != eval_~tmp~0); 353#L239 start_simulation_~kernel_st~0 := 2; 299#L153-1 start_simulation_~kernel_st~0 := 3; 300#L249-2 assume 0 == ~M_E~0;~M_E~0 := 1; 339#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 340#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 370#L259-3 assume !(0 == ~E_1~0); 416#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 295#L114-9 assume !(1 == ~m_pc~0); 293#L114-11 is_master_triggered_~__retres1~0 := 0; 294#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 307#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 374#L309-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 375#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 325#L133-9 assume !(1 == ~t1_pc~0); 308#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 309#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 393#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 379#L317-9 assume !(0 != activate_threads_~tmp___0~0); 380#L317-11 assume 1 == ~M_E~0;~M_E~0 := 2; 387#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 350#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 351#L287-3 assume 1 == ~E_1~0;~E_1~0 := 2; 373#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 418#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 411#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 334#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 335#L437 assume !(0 == start_simulation_~tmp~3); 422#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 423#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 405#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 330#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 341#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 395#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 318#L450 assume !(0 != start_simulation_~tmp___0~1); 319#L418-1 [2019-01-01 23:58:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -196522564, now seen corresponding path program 1 times [2019-01-01 23:58:14,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:14,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:14,542 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-01 23:58:14,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:14,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:58:14,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:58:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash 872296882, now seen corresponding path program 1 times [2019-01-01 23:58:14,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:14,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:14,635 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-01 23:58:14,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:58:14,636 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:14,637 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. cyclomatic complexity: 69 Second operand 3 states. [2019-01-01 23:58:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:14,847 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2019-01-01 23:58:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:14,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 330 transitions. [2019-01-01 23:58:14,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 196 [2019-01-01 23:58:14,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 224 states and 330 transitions. [2019-01-01 23:58:14,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2019-01-01 23:58:14,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2019-01-01 23:58:14,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 330 transitions. [2019-01-01 23:58:14,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:14,862 INFO L705 BuchiCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-01-01 23:58:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 330 transitions. [2019-01-01 23:58:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-01-01 23:58:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-01 23:58:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2019-01-01 23:58:14,889 INFO L728 BuchiCegarLoop]: Abstraction has 222 states and 328 transitions. [2019-01-01 23:58:14,889 INFO L608 BuchiCegarLoop]: Abstraction has 222 states and 328 transitions. [2019-01-01 23:58:14,889 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:58:14,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 328 transitions. [2019-01-01 23:58:14,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 194 [2019-01-01 23:58:14,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:14,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:14,896 INFO L866 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-01 23:58:14,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:14,897 INFO L794 eck$LassoCheckResult]: Stem: 792#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 665#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 666#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 669#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 670#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 785#L165-1 assume !(0 == ~M_E~0); 724#L249-1 assume !(0 == ~T1_E~0); 725#L254-1 assume !(0 == ~E_M~0); 744#L259-1 assume !(0 == ~E_1~0); 790#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 694#L114 assume !(1 == ~m_pc~0); 681#L114-2 is_master_triggered_~__retres1~0 := 0; 682#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 700#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 773#L309 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 752#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 734#L133 assume !(1 == ~t1_pc~0); 735#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 736#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 737#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 777#L317 assume !(0 != activate_threads_~tmp___0~0); 778#L317-2 assume !(1 == ~M_E~0); 779#L277-1 assume !(1 == ~T1_E~0); 730#L282-1 assume !(1 == ~E_M~0); 731#L287-1 assume 1 == ~E_1~0;~E_1~0 := 2; 745#L418-1 [2019-01-01 23:58:14,897 INFO L796 eck$LassoCheckResult]: Loop: 745#L418-1 assume !false; 833#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 728#L224 assume !false; 753#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 784#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 825#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 823#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 822#L205 assume !(0 != eval_~tmp~0); 821#L239 start_simulation_~kernel_st~0 := 2; 667#L153-1 start_simulation_~kernel_st~0 := 3; 668#L249-2 assume 0 == ~M_E~0;~M_E~0 := 1; 706#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 707#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 738#L259-3 assume !(0 == ~E_1~0); 787#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 663#L114-9 assume !(1 == ~m_pc~0); 661#L114-11 is_master_triggered_~__retres1~0 := 0; 662#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 677#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 742#L309-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 743#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 690#L133-9 assume !(1 == ~t1_pc~0); 691#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 870#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 869#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 868#L317-9 assume !(0 != activate_threads_~tmp___0~0); 867#L317-11 assume 1 == ~M_E~0;~M_E~0 := 2; 798#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 799#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 866#L287-3 assume 1 == ~E_1~0;~E_1~0 := 2; 865#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 864#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 862#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 861#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 859#L437 assume !(0 == start_simulation_~tmp~3); 860#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 873#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 871#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 838#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 837#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 836#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 835#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 834#L450 assume !(0 != start_simulation_~tmp___0~1); 745#L418-1 [2019-01-01 23:58:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:14,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1903125501, now seen corresponding path program 1 times [2019-01-01 23:58:14,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:14,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:14,965 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-01 23:58:14,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:14,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 23:58:14,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:58:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:14,967 INFO L82 PathProgramCache]: Analyzing trace with hash 872296882, now seen corresponding path program 2 times [2019-01-01 23:58:14,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:14,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:14,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:14,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:15,085 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-01 23:58:15,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:15,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:58:15,086 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:15,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:15,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:15,088 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. cyclomatic complexity: 108 Second operand 3 states. [2019-01-01 23:58:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:15,206 INFO L93 Difference]: Finished difference Result 222 states and 317 transitions. [2019-01-01 23:58:15,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:15,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 317 transitions. [2019-01-01 23:58:15,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 194 [2019-01-01 23:58:15,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 317 transitions. [2019-01-01 23:58:15,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2019-01-01 23:58:15,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2019-01-01 23:58:15,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 317 transitions. [2019-01-01 23:58:15,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:15,221 INFO L705 BuchiCegarLoop]: Abstraction has 222 states and 317 transitions. [2019-01-01 23:58:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 317 transitions. [2019-01-01 23:58:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2019-01-01 23:58:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-01 23:58:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 317 transitions. [2019-01-01 23:58:15,238 INFO L728 BuchiCegarLoop]: Abstraction has 222 states and 317 transitions. [2019-01-01 23:58:15,238 INFO L608 BuchiCegarLoop]: Abstraction has 222 states and 317 transitions. [2019-01-01 23:58:15,238 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:58:15,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 317 transitions. [2019-01-01 23:58:15,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 194 [2019-01-01 23:58:15,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:15,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:15,242 INFO L866 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-01 23:58:15,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:15,242 INFO L794 eck$LassoCheckResult]: Stem: 1245#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1118#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1119#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 1122#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 1123#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1237#L165-1 assume !(0 == ~M_E~0); 1175#L249-1 assume !(0 == ~T1_E~0); 1176#L254-1 assume !(0 == ~E_M~0); 1196#L259-1 assume !(0 == ~E_1~0); 1242#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 1147#L114 assume !(1 == ~m_pc~0); 1134#L114-2 is_master_triggered_~__retres1~0 := 0; 1135#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1153#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1225#L309 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1202#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1186#L133 assume !(1 == ~t1_pc~0); 1187#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 1188#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1189#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1229#L317 assume !(0 != activate_threads_~tmp___0~0); 1230#L317-2 assume !(1 == ~M_E~0); 1231#L277-1 assume !(1 == ~T1_E~0); 1182#L282-1 assume !(1 == ~E_M~0); 1183#L287-1 assume !(1 == ~E_1~0); 1140#L418-1 [2019-01-01 23:58:15,243 INFO L796 eck$LassoCheckResult]: Loop: 1140#L418-1 assume !false; 1317#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1179#L224 assume !false; 1235#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1236#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1234#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1199#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 1173#L205 assume !(0 != eval_~tmp~0); 1174#L239 start_simulation_~kernel_st~0 := 2; 1120#L153-1 start_simulation_~kernel_st~0 := 3; 1121#L249-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1159#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1160#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1190#L259-3 assume !(0 == ~E_1~0); 1239#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 1267#L114-9 assume !(1 == ~m_pc~0); 1265#L114-11 is_master_triggered_~__retres1~0 := 0; 1264#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1246#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1194#L309-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1195#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1143#L133-9 assume !(1 == ~t1_pc~0); 1144#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 1316#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1315#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1314#L317-9 assume !(0 != activate_threads_~tmp___0~0); 1313#L317-11 assume 1 == ~M_E~0;~M_E~0 := 2; 1312#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1169#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1170#L287-3 assume !(1 == ~E_1~0); 1193#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1241#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1233#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1154#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1155#L437 assume !(0 == start_simulation_~tmp~3); 1256#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 1324#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1322#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1321#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 1320#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1319#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 1318#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 1139#L450 assume !(0 != start_simulation_~tmp___0~1); 1140#L418-1 [2019-01-01 23:58:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:15,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1903125503, now seen corresponding path program 1 times [2019-01-01 23:58:15,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:15,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:15,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:15,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:15,350 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-01 23:58:15,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:15,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:58:15,351 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:58:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:15,353 INFO L82 PathProgramCache]: Analyzing trace with hash -138820368, now seen corresponding path program 1 times [2019-01-01 23:58:15,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:15,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:15,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:15,426 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-01 23:58:15,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:15,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:58:15,427 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:58:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:58:15,429 INFO L87 Difference]: Start difference. First operand 222 states and 317 transitions. cyclomatic complexity: 97 Second operand 5 states. [2019-01-01 23:58:15,669 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:58:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:16,428 INFO L93 Difference]: Finished difference Result 574 states and 803 transitions. [2019-01-01 23:58:16,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:58:16,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 574 states and 803 transitions. [2019-01-01 23:58:16,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 519 [2019-01-01 23:58:16,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 574 states to 574 states and 803 transitions. [2019-01-01 23:58:16,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 574 [2019-01-01 23:58:16,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 574 [2019-01-01 23:58:16,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 574 states and 803 transitions. [2019-01-01 23:58:16,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:16,447 INFO L705 BuchiCegarLoop]: Abstraction has 574 states and 803 transitions. [2019-01-01 23:58:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states and 803 transitions. [2019-01-01 23:58:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 246. [2019-01-01 23:58:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-01 23:58:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 341 transitions. [2019-01-01 23:58:16,479 INFO L728 BuchiCegarLoop]: Abstraction has 246 states and 341 transitions. [2019-01-01 23:58:16,479 INFO L608 BuchiCegarLoop]: Abstraction has 246 states and 341 transitions. [2019-01-01 23:58:16,479 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:58:16,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 341 transitions. [2019-01-01 23:58:16,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 215 [2019-01-01 23:58:16,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:16,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:16,486 INFO L866 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-01 23:58:16,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:16,487 INFO L794 eck$LassoCheckResult]: Stem: 2060#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1931#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1932#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 1935#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 1936#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2052#L165-1 assume !(0 == ~M_E~0); 1988#L249-1 assume !(0 == ~T1_E~0); 1989#L254-1 assume !(0 == ~E_M~0); 2010#L259-1 assume !(0 == ~E_1~0); 2057#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 1960#L114 assume !(1 == ~m_pc~0); 1948#L114-2 is_master_triggered_~__retres1~0 := 0; 1949#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1962#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2040#L309 assume !(0 != activate_threads_~tmp~1); 2018#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1998#L133 assume !(1 == ~t1_pc~0); 1999#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 2000#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2001#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2043#L317 assume !(0 != activate_threads_~tmp___0~0); 2044#L317-2 assume !(1 == ~M_E~0); 2046#L277-1 assume !(1 == ~T1_E~0); 1993#L282-1 assume !(1 == ~E_M~0); 1994#L287-1 assume !(1 == ~E_1~0); 2011#L418-1 [2019-01-01 23:58:16,487 INFO L796 eck$LassoCheckResult]: Loop: 2011#L418-1 assume !false; 2141#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1992#L224 assume !false; 2138#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2137#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2135#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2134#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 2133#L205 assume !(0 != eval_~tmp~0); 2063#L239 start_simulation_~kernel_st~0 := 2; 2064#L153-1 start_simulation_~kernel_st~0 := 3; 2139#L249-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2128#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2125#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2115#L259-3 assume !(0 == ~E_1~0); 2110#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 1928#L114-9 assume 1 == ~m_pc~0; 1929#L115-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 2108#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2106#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2104#L309-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2095#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1959#L133-9 assume !(1 == ~t1_pc~0); 1943#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 1944#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2029#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2014#L317-9 assume !(0 != activate_threads_~tmp___0~0); 2015#L317-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2023#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1981#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1982#L287-3 assume !(1 == ~E_1~0); 2005#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2056#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2049#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1967#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1968#L437 assume !(0 == start_simulation_~tmp~3); 2084#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 2161#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2159#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2158#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 2157#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2061#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 2062#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2143#L450 assume !(0 != start_simulation_~tmp___0~1); 2011#L418-1 [2019-01-01 23:58:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 1 times [2019-01-01 23:58:16,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash 169618641, now seen corresponding path program 1 times [2019-01-01 23:58:16,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:16,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:16,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:16,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:16,656 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-01 23:58:16,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:58:16,657 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:58:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:58:16,658 INFO L87 Difference]: Start difference. First operand 246 states and 341 transitions. cyclomatic complexity: 97 Second operand 5 states. [2019-01-01 23:58:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:16,854 INFO L93 Difference]: Finished difference Result 412 states and 560 transitions. [2019-01-01 23:58:16,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:58:16,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 560 transitions. [2019-01-01 23:58:16,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 379 [2019-01-01 23:58:16,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 412 states and 560 transitions. [2019-01-01 23:58:16,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2019-01-01 23:58:16,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2019-01-01 23:58:16,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 560 transitions. [2019-01-01 23:58:16,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:16,865 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 560 transitions. [2019-01-01 23:58:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 560 transitions. [2019-01-01 23:58:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 252. [2019-01-01 23:58:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-01 23:58:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 347 transitions. [2019-01-01 23:58:16,875 INFO L728 BuchiCegarLoop]: Abstraction has 252 states and 347 transitions. [2019-01-01 23:58:16,875 INFO L608 BuchiCegarLoop]: Abstraction has 252 states and 347 transitions. [2019-01-01 23:58:16,875 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:58:16,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 252 states and 347 transitions. [2019-01-01 23:58:16,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 221 [2019-01-01 23:58:16,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:16,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:16,880 INFO L866 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-01 23:58:16,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:16,881 INFO L794 eck$LassoCheckResult]: Stem: 2733#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2603#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2604#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 2607#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 2608#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2723#L165-1 assume !(0 == ~M_E~0); 2660#L249-1 assume !(0 == ~T1_E~0); 2661#L254-1 assume !(0 == ~E_M~0); 2682#L259-1 assume !(0 == ~E_1~0); 2730#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 2632#L114 assume !(1 == ~m_pc~0); 2620#L114-2 is_master_triggered_~__retres1~0 := 0; 2621#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2740#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2712#L309 assume !(0 != activate_threads_~tmp~1); 2689#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2671#L133 assume !(1 == ~t1_pc~0); 2672#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 2673#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2674#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2715#L317 assume !(0 != activate_threads_~tmp___0~0); 2716#L317-2 assume !(1 == ~M_E~0); 2718#L277-1 assume !(1 == ~T1_E~0); 2665#L282-1 assume !(1 == ~E_M~0); 2666#L287-1 assume !(1 == ~E_1~0); 2683#L418-1 [2019-01-01 23:58:16,881 INFO L796 eck$LassoCheckResult]: Loop: 2683#L418-1 assume !false; 2831#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2664#L224 assume !false; 2830#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2747#L178 assume !(0 == ~m_st~0); 2727#L182 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2728#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2805#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 2804#L205 assume !(0 != eval_~tmp~0); 2734#L239 start_simulation_~kernel_st~0 := 2; 2605#L153-1 start_simulation_~kernel_st~0 := 3; 2606#L249-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2795#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2675#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2676#L259-3 assume !(0 == ~E_1~0); 2731#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 2601#L114-9 assume !(1 == ~m_pc~0); 2599#L114-11 is_master_triggered_~__retres1~0 := 0; 2600#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2794#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2680#L309-9 assume !(0 != activate_threads_~tmp~1); 2681#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2631#L133-9 assume !(1 == ~t1_pc~0); 2615#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 2616#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2701#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2685#L317-9 assume !(0 != activate_threads_~tmp___0~0); 2686#L317-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2695#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2748#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2786#L287-3 assume !(1 == ~E_1~0); 2785#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2784#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2782#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2780#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 2777#L437 assume !(0 == start_simulation_~tmp~3); 2778#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 2746#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2714#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2638#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 2639#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2647#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 2703#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2704#L450 assume !(0 != start_simulation_~tmp___0~1); 2683#L418-1 [2019-01-01 23:58:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 2 times [2019-01-01 23:58:16,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:16,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:16,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1964847471, now seen corresponding path program 1 times [2019-01-01 23:58:16,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:16,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:16,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:16,995 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-01 23:58:16,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:16,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:16,997 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:16,997 INFO L87 Difference]: Start difference. First operand 252 states and 347 transitions. cyclomatic complexity: 97 Second operand 3 states. [2019-01-01 23:58:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:17,136 INFO L93 Difference]: Finished difference Result 401 states and 540 transitions. [2019-01-01 23:58:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:17,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 540 transitions. [2019-01-01 23:58:17,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 368 [2019-01-01 23:58:17,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 401 states and 540 transitions. [2019-01-01 23:58:17,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2019-01-01 23:58:17,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2019-01-01 23:58:17,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 540 transitions. [2019-01-01 23:58:17,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:17,149 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 540 transitions. [2019-01-01 23:58:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 540 transitions. [2019-01-01 23:58:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 386. [2019-01-01 23:58:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-01 23:58:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 521 transitions. [2019-01-01 23:58:17,159 INFO L728 BuchiCegarLoop]: Abstraction has 386 states and 521 transitions. [2019-01-01 23:58:17,160 INFO L608 BuchiCegarLoop]: Abstraction has 386 states and 521 transitions. [2019-01-01 23:58:17,160 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:58:17,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 521 transitions. [2019-01-01 23:58:17,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 353 [2019-01-01 23:58:17,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:17,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:17,165 INFO L866 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-01 23:58:17,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:17,167 INFO L794 eck$LassoCheckResult]: Stem: 3400#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 3262#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 3263#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 3266#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 3267#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3390#L165-1 assume !(0 == ~M_E~0); 3319#L249-1 assume !(0 == ~T1_E~0); 3320#L254-1 assume !(0 == ~E_M~0); 3341#L259-1 assume !(0 == ~E_1~0); 3397#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 3290#L114 assume !(1 == ~m_pc~0); 3278#L114-2 is_master_triggered_~__retres1~0 := 0; 3279#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3296#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3378#L309 assume !(0 != activate_threads_~tmp~1); 3352#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3331#L133 assume !(1 == ~t1_pc~0); 3332#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 3333#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3334#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3382#L317 assume !(0 != activate_threads_~tmp___0~0); 3383#L317-2 assume !(1 == ~M_E~0); 3384#L277-1 assume !(1 == ~T1_E~0); 3327#L282-1 assume !(1 == ~E_M~0); 3328#L287-1 assume !(1 == ~E_1~0); 3342#L418-1 [2019-01-01 23:58:17,167 INFO L796 eck$LassoCheckResult]: Loop: 3342#L418-1 assume !false; 3576#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 3562#L224 assume !false; 3569#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3565#L178 assume !(0 == ~m_st~0); 3426#L182 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3462#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3461#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 3460#L205 assume !(0 != eval_~tmp~0); 3459#L239 start_simulation_~kernel_st~0 := 2; 3458#L153-1 start_simulation_~kernel_st~0 := 3; 3315#L249-2 assume 0 == ~M_E~0;~M_E~0 := 1; 3316#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3454#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 3453#L259-3 assume !(0 == ~E_1~0); 3398#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 3260#L114-9 assume 1 == ~m_pc~0; 3261#L115-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 3405#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3406#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3407#L309-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 3343#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3287#L133-9 assume !(1 == ~t1_pc~0); 3272#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 3273#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3363#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3606#L317-9 assume !(0 != activate_threads_~tmp___0~0); 3603#L317-11 assume 1 == ~M_E~0;~M_E~0 := 2; 3424#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 3425#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 3597#L287-3 assume !(1 == ~E_1~0); 3594#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3578#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3575#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3572#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 3568#L437 assume !(0 == start_simulation_~tmp~3); 3564#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 3559#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3560#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3588#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 3586#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3584#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 3582#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 3580#L450 assume !(0 != start_simulation_~tmp___0~1); 3342#L418-1 [2019-01-01 23:58:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 3 times [2019-01-01 23:58:17,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:17,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:17,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:17,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:17,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1522394956, now seen corresponding path program 1 times [2019-01-01 23:58:17,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:17,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:17,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash -711810508, now seen corresponding path program 1 times [2019-01-01 23:58:17,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:17,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:17,320 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-01 23:58:17,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:17,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:17,836 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-01-01 23:58:17,943 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:58:17,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:58:17,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:58:17,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:58:17,945 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:58:17,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:17,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:58:17,946 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:58:17,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: token_ring.01_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2019-01-01 23:58:17,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:58:17,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:58:17,973 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-01 23:58:18,004 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-01 23:58:18,042 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-01 23:58:18,070 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-01 23:58:18,104 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-01 23:58:18,192 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-01 23:58:18,260 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-01 23:58:18,262 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-01 23:58:18,267 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-01 23:58:18,269 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-01 23:58:18,270 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-01 23:58:18,273 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-01 23:58:18,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:58:18,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-01 23:58:18,313 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-01 23:58:18,319 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-01 23:58:18,323 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-01 23:58:18,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-01 23:58:18,333 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-01 23:58:18,343 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-01 23:58:18,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-01 23:58:18,358 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-01 23:58:18,360 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-01 23:58:18,366 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-01 23:58:18,374 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-01 23:58:18,386 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-01 23:58:18,770 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:58:18,771 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-01 23:58:18,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:18,779 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:18,785 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:18,785 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} 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-01 23:58:18,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:18,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:18,815 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:18,815 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:18,855 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:18,855 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:18,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:18,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} 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) [2019-01-01 23:58:18,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:18,960 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:18,975 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:18,976 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:58:19,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,028 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,042 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~E_1~0=-5} Honda state: {~E_1~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 23:58:19,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,093 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,093 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_master_triggered_#res=1, ULTIMATE.start_is_master_triggered_~__retres1~0=1} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_master_triggered_#res=1, ULTIMATE.start_is_master_triggered_~__retres1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,128 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret6=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,157 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,185 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,211 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,211 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,236 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,236 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Honda state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,268 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,268 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,295 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t1_st~0=-1} Honda state: {~t1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,320 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:19,321 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret4=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:19,346 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:58:19,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:19,402 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:58:19,404 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:58:19,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:58:19,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:58:19,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:58:19,405 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:58:19,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:19,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:58:19,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:58:19,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: token_ring.01_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2019-01-01 23:58:19,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:58:19,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:58:19,408 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-01 23:58:19,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-01 23:58:19,477 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-01 23:58:19,481 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-01 23:58:19,484 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-01 23:58:19,489 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-01 23:58:19,497 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-01 23:58:19,516 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-01 23:58:19,547 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-01 23:58:19,579 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-01 23:58:19,688 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-01 23:58:19,713 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-01 23:58:19,741 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-01 23:58:19,769 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-01 23:58:19,799 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-01 23:58:19,808 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-01 23:58:19,810 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-01 23:58:19,815 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-01 23:58:19,821 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-01 23:58:19,830 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-01 23:58:19,836 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-01 23:58:19,862 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-01 23:58:19,886 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-01 23:58:19,896 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-01 23:58:19,901 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-01 23:58:19,905 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-01 23:58:20,298 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2019-01-01 23:58:20,543 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:58:20,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:58:20,646 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:58:20,648 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-01 23:58:20,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,656 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-01 23:58:20,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,660 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-01 23:58:20,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,665 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-01 23:58:20,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,667 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-01 23:58:20,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,668 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:20,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,669 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:20,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,670 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-01 23:58:20,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,671 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:20,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,672 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:20,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,673 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-01 23:58:20,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,680 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-01 23:58:20,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:20,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:20,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,702 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-01 23:58:20,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,710 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-01 23:58:20,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,713 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-01 23:58:20,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,719 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-01 23:58:20,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,720 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:20,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,721 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:20,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,722 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-01 23:58:20,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,723 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:20,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,726 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:20,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,733 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-01 23:58:20,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,741 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-01 23:58:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,746 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-01 23:58:20,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,756 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-01 23:58:20,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:20,764 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-01 23:58:20,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:20,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:20,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:20,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:20,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:20,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:20,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:20,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:58:20,781 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:58:20,782 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:58:20,784 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:58:20,784 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:58:20,785 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:58:20,785 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M_E~0) = -1*~M_E~0 + 1 Supporting invariants [] [2019-01-01 23:58:20,786 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:58:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:21,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:58:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:21,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:58:21,181 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-01 23:58:21,185 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-01 23:58:21,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 386 states and 521 transitions. cyclomatic complexity: 137 Second operand 5 states. [2019-01-01 23:58:21,312 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 386 states and 521 transitions. cyclomatic complexity: 137. Second operand 5 states. Result 950 states and 1288 transitions. Complement of second has 5 states. [2019-01-01 23:58:21,313 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-01 23:58:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:58:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2019-01-01 23:58:21,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 25 letters. Loop has 44 letters. [2019-01-01 23:58:21,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:58:21,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 69 letters. Loop has 44 letters. [2019-01-01 23:58:21,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:58:21,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 25 letters. Loop has 88 letters. [2019-01-01 23:58:21,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:58:21,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 950 states and 1288 transitions. [2019-01-01 23:58:21,338 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 624 [2019-01-01 23:58:21,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 950 states to 950 states and 1288 transitions. [2019-01-01 23:58:21,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2019-01-01 23:58:21,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 669 [2019-01-01 23:58:21,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 950 states and 1288 transitions. [2019-01-01 23:58:21,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:58:21,348 INFO L705 BuchiCegarLoop]: Abstraction has 950 states and 1288 transitions. [2019-01-01 23:58:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 1288 transitions. [2019-01-01 23:58:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 943. [2019-01-01 23:58:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-01-01 23:58:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1275 transitions. [2019-01-01 23:58:21,369 INFO L728 BuchiCegarLoop]: Abstraction has 943 states and 1275 transitions. [2019-01-01 23:58:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:21,369 INFO L87 Difference]: Start difference. First operand 943 states and 1275 transitions. Second operand 3 states. [2019-01-01 23:58:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:21,552 INFO L93 Difference]: Finished difference Result 988 states and 1308 transitions. [2019-01-01 23:58:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:21,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1308 transitions. [2019-01-01 23:58:21,563 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 654 [2019-01-01 23:58:21,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 988 states and 1308 transitions. [2019-01-01 23:58:21,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 692 [2019-01-01 23:58:21,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 692 [2019-01-01 23:58:21,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1308 transitions. [2019-01-01 23:58:21,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:58:21,573 INFO L705 BuchiCegarLoop]: Abstraction has 988 states and 1308 transitions. [2019-01-01 23:58:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1308 transitions. [2019-01-01 23:58:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 943. [2019-01-01 23:58:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-01-01 23:58:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1251 transitions. [2019-01-01 23:58:21,594 INFO L728 BuchiCegarLoop]: Abstraction has 943 states and 1251 transitions. [2019-01-01 23:58:21,594 INFO L608 BuchiCegarLoop]: Abstraction has 943 states and 1251 transitions. [2019-01-01 23:58:21,594 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:58:21,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 943 states and 1251 transitions. [2019-01-01 23:58:21,601 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 624 [2019-01-01 23:58:21,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:21,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:21,602 INFO L866 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, 1] [2019-01-01 23:58:21,602 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:21,602 INFO L794 eck$LassoCheckResult]: Stem: 7007#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 6765#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 6766#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 6771#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 6772#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 6988#L165-1 assume !(0 == ~M_E~0); 6865#L249-1 assume !(0 == ~T1_E~0); 6866#L254-1 assume !(0 == ~E_M~0); 6901#L259-1 assume !(0 == ~E_1~0); 7004#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 6815#L114 assume !(1 == ~m_pc~0); 6792#L114-2 is_master_triggered_~__retres1~0 := 0; 6793#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6825#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6967#L309 assume !(0 != activate_threads_~tmp~1); 6926#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6882#L133 assume !(1 == ~t1_pc~0); 6883#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 6884#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6885#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6973#L317 assume !(0 != activate_threads_~tmp___0~0); 6974#L317-2 assume !(1 == ~M_E~0); 6975#L277-1 assume !(1 == ~T1_E~0); 6876#L282-1 assume !(1 == ~E_M~0); 6877#L287-1 assume !(1 == ~E_1~0); 6902#L418-1 assume !false; 7188#L419 [2019-01-01 23:58:21,603 INFO L796 eck$LassoCheckResult]: Loop: 7188#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 7583#L224 assume !false; 7581#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7580#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7579#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7578#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 7577#L205 assume 0 != eval_~tmp~0; 7576#L205-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 7574#L213 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1;havoc master_#t~nondet0; 7572#L34 assume 0 == ~m_pc~0; 7570#L59 assume !false; 7569#L46 ~token~0 := master_#t~nondet0;havoc master_#t~nondet0;~local~0 := ~token~0;~E_1~0 := 1;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 7568#L114-3 assume !(1 == ~m_pc~0); 7565#L114-5 is_master_triggered_~__retres1~0 := 0; 7564#L125-1 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7563#L126-1 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7562#L309-3 assume !(0 != activate_threads_~tmp~1); 7560#L309-5 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7559#L133-3 assume !(1 == ~t1_pc~0); 7558#L133-5 is_transmit1_triggered_~__retres1~1 := 0; 7557#L144-1 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 7556#L145-1 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7555#L317-3 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 6958#L317-5 ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; 6844#L210 assume !(0 == ~t1_st~0); 6869#L224 assume !false; 7391#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7389#L178 assume !(0 == ~m_st~0); 7386#L182 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 7383#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7381#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 7379#L205 assume !(0 != eval_~tmp~0); 7376#L239 start_simulation_~kernel_st~0 := 2; 7374#L153-1 start_simulation_~kernel_st~0 := 3; 7372#L249-2 assume !(0 == ~M_E~0); 7370#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 7240#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 7367#L259-3 assume !(0 == ~E_1~0); 7365#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 7363#L114-9 assume 1 == ~m_pc~0; 7360#L115-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 7357#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7355#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7352#L309-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 7349#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7347#L133-9 assume !(1 == ~t1_pc~0); 7345#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 7343#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 7341#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7339#L317-9 assume !(0 != activate_threads_~tmp___0~0); 7336#L317-11 assume !(1 == ~M_E~0); 7337#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 7333#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 7600#L287-3 assume !(1 == ~E_1~0); 7599#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7598#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7597#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7596#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 7595#L437 assume !(0 == start_simulation_~tmp~3); 7594#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 7593#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7592#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7591#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 7590#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7589#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 7588#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 7587#L450 assume !(0 != start_simulation_~tmp___0~1); 7586#L418-1 assume !false; 7188#L419 [2019-01-01 23:58:21,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash -874485989, now seen corresponding path program 1 times [2019-01-01 23:58:21,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:21,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:21,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1093962113, now seen corresponding path program 1 times [2019-01-01 23:58:21,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:21,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:21,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:21,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:21,690 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-01 23:58:21,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:21,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:58:21,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:58:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:58:21,691 INFO L87 Difference]: Start difference. First operand 943 states and 1251 transitions. cyclomatic complexity: 314 Second operand 5 states. [2019-01-01 23:58:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:22,086 INFO L93 Difference]: Finished difference Result 1176 states and 1534 transitions. [2019-01-01 23:58:22,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:58:22,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1176 states and 1534 transitions. [2019-01-01 23:58:22,096 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 778 [2019-01-01 23:58:22,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1176 states to 1176 states and 1534 transitions. [2019-01-01 23:58:22,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 816 [2019-01-01 23:58:22,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 816 [2019-01-01 23:58:22,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1176 states and 1534 transitions. [2019-01-01 23:58:22,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:58:22,106 INFO L705 BuchiCegarLoop]: Abstraction has 1176 states and 1534 transitions. [2019-01-01 23:58:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states and 1534 transitions. [2019-01-01 23:58:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 952. [2019-01-01 23:58:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-01-01 23:58:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1234 transitions. [2019-01-01 23:58:22,128 INFO L728 BuchiCegarLoop]: Abstraction has 952 states and 1234 transitions. [2019-01-01 23:58:22,128 INFO L608 BuchiCegarLoop]: Abstraction has 952 states and 1234 transitions. [2019-01-01 23:58:22,128 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:58:22,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 952 states and 1234 transitions. [2019-01-01 23:58:22,134 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 630 [2019-01-01 23:58:22,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:22,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:22,135 INFO L866 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, 1] [2019-01-01 23:58:22,135 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:22,135 INFO L794 eck$LassoCheckResult]: Stem: 9131#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 8896#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 8897#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 8902#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 8903#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 9116#L165-1 assume !(0 == ~M_E~0); 8995#L249-1 assume !(0 == ~T1_E~0); 8996#L254-1 assume !(0 == ~E_M~0); 9027#L259-1 assume !(0 == ~E_1~0); 9128#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 8948#L114 assume !(1 == ~m_pc~0); 8925#L114-2 is_master_triggered_~__retres1~0 := 0; 8926#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8958#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9096#L309 assume !(0 != activate_threads_~tmp~1); 9053#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9011#L133 assume !(1 == ~t1_pc~0); 9012#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 9013#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9014#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 9102#L317 assume !(0 != activate_threads_~tmp___0~0); 9103#L317-2 assume !(1 == ~M_E~0); 9104#L277-1 assume !(1 == ~T1_E~0); 9005#L282-1 assume !(1 == ~E_M~0); 9006#L287-1 assume !(1 == ~E_1~0); 9028#L418-1 assume !false; 9265#L419 [2019-01-01 23:58:22,135 INFO L796 eck$LassoCheckResult]: Loop: 9265#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 9723#L224 assume !false; 9722#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9721#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9720#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9719#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 9718#L205 assume 0 != eval_~tmp~0; 9717#L205-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 9715#L213 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1;havoc master_#t~nondet0; 9064#L34 assume 0 == ~m_pc~0; 8921#L59 assume !false; 8927#L46 ~token~0 := master_#t~nondet0;havoc master_#t~nondet0;~local~0 := ~token~0;~E_1~0 := 1;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 8906#L114-3 assume !(1 == ~m_pc~0); 8907#L114-5 is_master_triggered_~__retres1~0 := 0; 8994#L125-1 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9591#L126-1 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9057#L309-3 assume !(0 != activate_threads_~tmp~1); 9058#L309-5 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9679#L133-3 assume !(1 == ~t1_pc~0); 9677#L133-5 is_transmit1_triggered_~__retres1~1 := 0; 9675#L144-1 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9673#L145-1 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 9672#L317-3 assume !(0 != activate_threads_~tmp___0~0); 9659#L317-5 ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; 9648#L210 assume !(0 == ~t1_st~0); 9646#L224 assume !false; 9644#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9642#L178 assume !(0 == ~m_st~0); 9639#L182 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 9636#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9631#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 9628#L205 assume !(0 != eval_~tmp~0); 9626#L239 start_simulation_~kernel_st~0 := 2; 9624#L153-1 start_simulation_~kernel_st~0 := 3; 9610#L249-2 assume !(0 == ~M_E~0); 9607#L249-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 9602#L254-3 assume 0 == ~E_M~0;~E_M~0 := 1; 9603#L259-3 assume !(0 == ~E_1~0); 9714#L264-3 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 9713#L114-9 assume 1 == ~m_pc~0; 9693#L115-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 9692#L125-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9684#L126-3 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9681#L309-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 9670#L309-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9666#L133-9 assume !(1 == ~t1_pc~0); 9661#L133-11 is_transmit1_triggered_~__retres1~1 := 0; 9655#L144-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9187#L145-3 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 9036#L317-9 assume !(0 != activate_threads_~tmp___0~0); 9037#L317-11 assume !(1 == ~M_E~0); 9054#L277-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 9741#L282-3 assume 1 == ~E_M~0;~E_M~0 := 2; 9740#L287-3 assume !(1 == ~E_1~0); 9739#L292-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9738#L178-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9737#L190-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9736#L191-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 9735#L437 assume !(0 == start_simulation_~tmp~3); 9734#L437-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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; 9733#L178-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9732#L190-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9731#L191-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 9730#L392 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 9729#L399 stop_simulation_#res := stop_simulation_~__retres2~0; 9728#L400 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 9727#L450 assume !(0 != start_simulation_~tmp___0~1); 9726#L418-1 assume !false; 9265#L419 [2019-01-01 23:58:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -874485989, now seen corresponding path program 2 times [2019-01-01 23:58:22,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:22,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:22,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:22,147 INFO L82 PathProgramCache]: Analyzing trace with hash 834310589, now seen corresponding path program 1 times [2019-01-01 23:58:22,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:22,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:22,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:22,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:22,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1621101527, now seen corresponding path program 1 times [2019-01-01 23:58:22,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:22,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:58:22,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:22,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:23,246 WARN L181 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 114 [2019-01-01 23:58:23,457 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-01 23:58:23,459 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:58:23,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:58:23,460 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:58:23,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:58:23,460 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:58:23,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:23,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:58:23,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:58:23,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: token_ring.01_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2019-01-01 23:58:23,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:58:23,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:58:23,464 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-01 23:58:23,479 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-01 23:58:23,487 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-01 23:58:23,490 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-01 23:58:23,497 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-01 23:58:23,501 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-01 23:58:23,533 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-01 23:58:23,536 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-01 23:58:23,541 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-01 23:58:23,545 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-01 23:58:23,552 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-01 23:58:23,560 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-01 23:58:23,569 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-01 23:58:23,571 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-01 23:58:23,575 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-01 23:58:23,659 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-01 23:58:23,682 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-01 23:58:23,706 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-01 23:58:23,724 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-01 23:58:23,730 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-01 23:58:23,745 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-01 23:58:23,749 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-01 23:58:23,752 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-01 23:58:23,756 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-01 23:58:23,758 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-01 23:58:23,787 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-01 23:58:23,812 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-01 23:58:23,814 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-01 23:58:24,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:58:24,088 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:24,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:24,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:24,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:24,104 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:24,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:24,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:24,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:24,131 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~0=0, ULTIMATE.start_is_transmit1_triggered_~__retres1~1=0, ULTIMATE.start_is_transmit1_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~0=0, ULTIMATE.start_is_transmit1_triggered_~__retres1~1=0, ULTIMATE.start_is_transmit1_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:24,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:24,153 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:24,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:58:24,156 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:24,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:58:24,195 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:24,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:58:24,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:58:24,233 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:58:24,251 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:58:24,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:58:24,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:58:24,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:58:24,252 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:58:24,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:58:24,252 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:58:24,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:58:24,252 INFO L131 ssoRankerPreferences]: Filename of dumped script: token_ring.01_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2019-01-01 23:58:24,252 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:58:24,252 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:58:24,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-01 23:58:24,264 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-01 23:58:24,269 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-01 23:58:24,271 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-01 23:58:24,276 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-01 23:58:24,279 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-01 23:58:24,285 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-01 23:58:24,288 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-01 23:58:24,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-01 23:58:24,297 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-01 23:58:24,304 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-01 23:58:24,331 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-01 23:58:24,333 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-01 23:58:24,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-01 23:58:24,340 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-01 23:58:24,346 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-01 23:58:24,355 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-01 23:58:24,358 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-01 23:58:24,360 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-01 23:58:24,364 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-01 23:58:24,376 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-01 23:58:24,378 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-01 23:58:24,379 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-01 23:58:24,382 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-01 23:58:24,386 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-01 23:58:24,389 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-01 23:58:24,396 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-01 23:58:24,398 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-01 23:58:24,672 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:58:25,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:58:25,026 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:58:25,027 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-01 23:58:25,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:25,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:25,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:25,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:25,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:25,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:25,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:25,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:25,034 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-01 23:58:25,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:25,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:25,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:25,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:25,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:25,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:25,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:25,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:25,043 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-01 23:58:25,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:25,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:25,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:25,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:25,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:25,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:25,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:25,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:25,051 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-01 23:58:25,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:58:25,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:25,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:25,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:25,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:58:25,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:58:25,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:25,054 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:58:25,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:58:25,060 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:58:25,060 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:58:25,060 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:58:25,060 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:58:25,060 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~E_M~0) = -1*~E_M~0 + 1 Supporting invariants [] [2019-01-01 23:58:25,063 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:58:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:25,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:58:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:25,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:58:25,233 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-01 23:58:25,233 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-01 23:58:25,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 952 states and 1234 transitions. cyclomatic complexity: 288 Second operand 5 states. [2019-01-01 23:58:25,401 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 952 states and 1234 transitions. cyclomatic complexity: 288. Second operand 5 states. Result 2248 states and 2914 transitions. Complement of second has 5 states. [2019-01-01 23:58:25,405 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-01 23:58:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:58:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2019-01-01 23:58:25,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 26 letters. Loop has 68 letters. [2019-01-01 23:58:25,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:58:25,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 94 letters. Loop has 68 letters. [2019-01-01 23:58:25,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:58:25,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 174 transitions. Stem has 26 letters. Loop has 136 letters. [2019-01-01 23:58:25,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:58:25,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2248 states and 2914 transitions. [2019-01-01 23:58:25,422 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 924 [2019-01-01 23:58:25,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2248 states to 2242 states and 2908 transitions. [2019-01-01 23:58:25,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 973 [2019-01-01 23:58:25,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 990 [2019-01-01 23:58:25,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 2908 transitions. [2019-01-01 23:58:25,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:58:25,441 INFO L705 BuchiCegarLoop]: Abstraction has 2242 states and 2908 transitions. [2019-01-01 23:58:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 2908 transitions. [2019-01-01 23:58:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2207. [2019-01-01 23:58:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-01-01 23:58:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 2867 transitions. [2019-01-01 23:58:25,483 INFO L728 BuchiCegarLoop]: Abstraction has 2207 states and 2867 transitions. [2019-01-01 23:58:25,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:25,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:25,485 INFO L87 Difference]: Start difference. First operand 2207 states and 2867 transitions. Second operand 3 states. [2019-01-01 23:58:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:25,572 INFO L93 Difference]: Finished difference Result 3230 states and 4100 transitions. [2019-01-01 23:58:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:25,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3230 states and 4100 transitions. [2019-01-01 23:58:25,597 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1254 [2019-01-01 23:58:25,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3230 states to 3230 states and 4100 transitions. [2019-01-01 23:58:25,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1435 [2019-01-01 23:58:25,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1435 [2019-01-01 23:58:25,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3230 states and 4100 transitions. [2019-01-01 23:58:25,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:58:25,623 INFO L705 BuchiCegarLoop]: Abstraction has 3230 states and 4100 transitions. [2019-01-01 23:58:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states and 4100 transitions. [2019-01-01 23:58:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3148. [2019-01-01 23:58:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-01-01 23:58:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4012 transitions. [2019-01-01 23:58:25,677 INFO L728 BuchiCegarLoop]: Abstraction has 3148 states and 4012 transitions. [2019-01-01 23:58:25,678 INFO L608 BuchiCegarLoop]: Abstraction has 3148 states and 4012 transitions. [2019-01-01 23:58:25,678 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:58:25,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3148 states and 4012 transitions. [2019-01-01 23:58:25,695 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1254 [2019-01-01 23:58:25,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:25,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:25,696 INFO L866 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, 1, 1] [2019-01-01 23:58:25,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:25,697 INFO L794 eck$LassoCheckResult]: Stem: 18100#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 17845#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 17846#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 17851#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 17852#L160-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 18082#L165-1 assume !(0 == ~M_E~0); 17948#L249-1 assume !(0 == ~T1_E~0); 17949#L254-1 assume !(0 == ~E_M~0); 17988#L259-1 assume !(0 == ~E_1~0); 18096#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 17897#L114 assume !(1 == ~m_pc~0); 17874#L114-2 is_master_triggered_~__retres1~0 := 0; 17875#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 17907#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 18061#L309 assume !(0 != activate_threads_~tmp~1); 18014#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 17964#L133 assume !(1 == ~t1_pc~0); 17965#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 17966#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 17967#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 18141#L317 assume !(0 != activate_threads_~tmp___0~0); 19367#L317-2 assume !(1 == ~M_E~0); 19365#L277-1 assume !(1 == ~T1_E~0); 19363#L282-1 assume !(1 == ~E_M~0); 19351#L287-1 assume !(1 == ~E_1~0); 19352#L418-1 assume !false; 19885#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 18926#L224 [2019-01-01 23:58:25,697 INFO L796 eck$LassoCheckResult]: Loop: 18926#L224 assume !false; 19344#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 19342#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 19340#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 19338#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 19336#L205 assume 0 != eval_~tmp~0; 19334#L205-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 19332#L213 assume !(0 != eval_~tmp_ndt_1~0); 18925#L210 assume !(0 == ~t1_st~0); 18926#L224 [2019-01-01 23:58:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1150267205, now seen corresponding path program 1 times [2019-01-01 23:58:25,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:25,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:25,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:25,763 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-01 23:58:25,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:25,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:25,763 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:58:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1331441589, now seen corresponding path program 1 times [2019-01-01 23:58:25,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:25,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:25,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:25,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:25,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:25,899 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-01 23:58:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:25,918 INFO L87 Difference]: Start difference. First operand 3148 states and 4012 transitions. cyclomatic complexity: 888 Second operand 3 states. [2019-01-01 23:58:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:25,930 INFO L93 Difference]: Finished difference Result 2179 states and 2783 transitions. [2019-01-01 23:58:25,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:25,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2179 states and 2783 transitions. [2019-01-01 23:58:25,942 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 980 [2019-01-01 23:58:25,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2179 states to 2179 states and 2783 transitions. [2019-01-01 23:58:25,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1039 [2019-01-01 23:58:25,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1039 [2019-01-01 23:58:25,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2179 states and 2783 transitions. [2019-01-01 23:58:25,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:58:25,957 INFO L705 BuchiCegarLoop]: Abstraction has 2179 states and 2783 transitions. [2019-01-01 23:58:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states and 2783 transitions. [2019-01-01 23:58:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 2179. [2019-01-01 23:58:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2019-01-01 23:58:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2783 transitions. [2019-01-01 23:58:25,992 INFO L728 BuchiCegarLoop]: Abstraction has 2179 states and 2783 transitions. [2019-01-01 23:58:25,992 INFO L608 BuchiCegarLoop]: Abstraction has 2179 states and 2783 transitions. [2019-01-01 23:58:25,992 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:58:25,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2179 states and 2783 transitions. [2019-01-01 23:58:25,998 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 980 [2019-01-01 23:58:25,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:25,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:25,999 INFO L866 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, 1, 1] [2019-01-01 23:58:25,999 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:25,999 INFO L794 eck$LassoCheckResult]: Stem: 23430#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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 23177#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 23178#L381 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, 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; 23183#L153 assume 1 == ~m_i~0;~m_st~0 := 0; 23184#L160-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 23411#L165-1 assume !(0 == ~M_E~0); 23281#L249-1 assume !(0 == ~T1_E~0); 23282#L254-1 assume !(0 == ~E_M~0); 23319#L259-1 assume !(0 == ~E_1~0); 23426#L264-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, 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; 23230#L114 assume !(1 == ~m_pc~0); 23206#L114-2 is_master_triggered_~__retres1~0 := 0; 23207#L125 is_master_triggered_#res := is_master_triggered_~__retres1~0; 23232#L126 activate_threads_#t~ret4 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 23388#L309 assume !(0 != activate_threads_~tmp~1); 23338#L309-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 23299#L133 assume !(1 == ~t1_pc~0); 23300#L133-2 is_transmit1_triggered_~__retres1~1 := 0; 23301#L144 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 23302#L145 activate_threads_#t~ret5 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 23393#L317 assume !(0 != activate_threads_~tmp___0~0); 23394#L317-2 assume !(1 == ~M_E~0); 23397#L277-1 assume !(1 == ~T1_E~0); 23289#L282-1 assume !(1 == ~E_M~0); 23290#L287-1 assume !(1 == ~E_1~0); 23320#L418-1 assume !false; 23649#L419 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_~tmp_ndt_1~0, eval_#t~nondet3, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 24064#L224 [2019-01-01 23:58:25,999 INFO L796 eck$LassoCheckResult]: Loop: 24064#L224 assume !false; 25181#L201 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 25180#L178 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 25178#L190 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 25174#L191 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret1;havoc eval_#t~ret1; 25165#L205 assume 0 != eval_~tmp~0; 25164#L205-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 23333#L213 assume !(0 != eval_~tmp_ndt_1~0); 23335#L210 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 25163#L227 assume !(0 != eval_~tmp_ndt_2~0); 24064#L224 [2019-01-01 23:58:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 1 times [2019-01-01 23:58:26,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:26,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:26,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:26,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:26,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1674981463, now seen corresponding path program 1 times [2019-01-01 23:58:26,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:26,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:26,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:26,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:26,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1759978137, now seen corresponding path program 1 times [2019-01-01 23:58:26,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:26,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:26,548 WARN L181 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-01 23:58:26,786 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:58:26,946 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-01-01 23:58:27,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:58:27 BoogieIcfgContainer [2019-01-01 23:58:27,019 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:58:27,019 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:58:27,019 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:58:27,020 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:58:27,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:58:13" (3/4) ... [2019-01-01 23:58:27,027 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:58:27,099 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:58:27,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:58:27,101 INFO L168 Benchmark]: Toolchain (without parser) took 14927.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 947.3 MB in the beginning and 951.5 MB in the end (delta: -4.2 MB). Peak memory consumption was 295.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:27,105 INFO L168 Benchmark]: CDTParser took 0.26 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-01 23:58:27,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.46 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:27,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.93 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:58:27,106 INFO L168 Benchmark]: Boogie Preprocessor took 103.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:27,107 INFO L168 Benchmark]: RCFGBuilder took 1148.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:27,110 INFO L168 Benchmark]: BuchiAutomizer took 13090.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 951.5 MB in the end (delta: 120.2 MB). Peak memory consumption was 296.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:27,111 INFO L168 Benchmark]: Witness Printer took 80.40 ms. Allocated memory is still 1.3 GB. Free memory is still 951.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:58:27,119 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.26 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 442.46 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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 58.93 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1148.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13090.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 951.5 MB in the end (delta: 120.2 MB). Peak memory consumption was 296.3 MB. Max. memory is 11.5 GB. * Witness Printer took 80.40 ms. Allocated memory is still 1.3 GB. Free memory is still 951.5 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 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * M_E + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * E_M + 1 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 2179 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.0s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 1.9s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 898 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 3148 states and ocurred in iteration 9. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/6 HoareTripleCheckerStatistics: 2495 SDtfs, 2473 SDslu, 2679 SDs, 0 SdLazy, 269 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT2 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital94 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp57 tf109 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 200]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, token=0, __retres1=0, tmp=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71a0b295=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71872151=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@180c524d=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@19063e3b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48318afe=0, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1654489a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67e2f726=0, t1_st=0, local=0, m_st=0, E_M=2, tmp___0=0, tmp=0, __retres1=0, t1_i=1, m_pc=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 200]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; [L463] int __retres1 ; [L378] m_i = 1 [L379] t1_i = 1 [L404] int kernel_st ; [L405] int tmp ; [L406] int tmp___0 ; [L410] kernel_st = 0 [L160] COND TRUE m_i == 1 [L161] m_st = 0 [L165] COND TRUE t1_i == 1 [L166] t1_st = 0 [L249] COND FALSE !(M_E == 0) [L254] COND FALSE !(T1_E == 0) [L259] COND FALSE !(E_M == 0) [L264] COND FALSE !(E_1 == 0) [L302] int tmp ; [L303] int tmp___0 ; [L111] int __retres1 ; [L114] COND FALSE !(m_pc == 1) [L124] __retres1 = 0 [L126] return (__retres1); [L307] tmp = is_master_triggered() [L309] COND FALSE !(\read(tmp)) [L130] int __retres1 ; [L133] COND FALSE !(t1_pc == 1) [L143] __retres1 = 0 [L145] return (__retres1); [L315] tmp___0 = is_transmit1_triggered() [L317] COND FALSE !(\read(tmp___0)) [L277] COND FALSE !(M_E == 1) [L282] COND FALSE !(T1_E == 1) [L287] COND FALSE !(E_M == 1) [L292] COND FALSE !(E_1 == 1) [L418] COND TRUE 1 [L421] kernel_st = 1 [L196] int tmp ; Loop: [L200] COND TRUE 1 [L175] int __retres1 ; [L178] COND TRUE m_st == 0 [L179] __retres1 = 1 [L191] return (__retres1); [L203] tmp = exists_runnable_thread() [L205] COND TRUE \read(tmp) [L210] COND TRUE m_st == 0 [L211] int tmp_ndt_1; [L212] tmp_ndt_1 = __VERIFIER_nondet_int() [L213] COND FALSE !(\read(tmp_ndt_1)) [L224] COND TRUE t1_st == 0 [L225] int tmp_ndt_2; [L226] tmp_ndt_2 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...