./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/transmitter.01.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 278371fb5fb32cd768dabde497dd9d5964ee74d9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-5485861 [2020-10-26 05:47:56,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:47:56,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:47:56,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:47:56,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:47:56,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:47:56,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:47:56,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:47:56,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:47:56,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:47:56,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:47:56,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:47:56,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:47:56,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:47:56,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:47:56,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:47:56,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:47:56,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:47:56,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:47:56,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:47:56,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:47:56,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:47:56,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:47:56,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:47:56,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:47:56,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:47:56,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:47:56,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:47:56,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:47:56,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:47:56,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:47:56,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:47:56,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:47:56,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:47:56,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:47:56,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:47:56,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:47:56,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:47:56,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:47:56,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:47:56,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:47:56,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 05:47:56,457 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:47:56,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:47:56,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:47:56,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:47:56,462 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:47:56,462 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:47:56,463 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:47:56,463 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:47:56,464 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:47:56,464 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:47:56,465 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:47:56,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:47:56,466 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:47:56,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:47:56,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:47:56,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:47:56,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:47:56,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:47:56,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:47:56,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:47:56,468 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:47:56,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:47:56,468 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:47:56,469 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:47:56,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:47:56,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:47:56,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:47:56,470 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:47:56,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:47:56,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:47:56,471 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:47:56,471 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:47:56,473 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:47:56,474 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 278371fb5fb32cd768dabde497dd9d5964ee74d9 [2020-10-26 05:47:56,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:47:56,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:47:56,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:47:56,964 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:47:56,969 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:47:56,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2020-10-26 05:47:57,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169f8782b/9258fdee707d4f0f86fab820634089a9/FLAG1169f4a02 [2020-10-26 05:47:57,771 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:47:57,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2020-10-26 05:47:57,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169f8782b/9258fdee707d4f0f86fab820634089a9/FLAG1169f4a02 [2020-10-26 05:47:58,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169f8782b/9258fdee707d4f0f86fab820634089a9 [2020-10-26 05:47:58,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:47:58,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:47:58,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:47:58,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:47:58,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:47:58,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d06a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58, skipping insertion in model container [2020-10-26 05:47:58,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:47:58,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:47:58,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:47:58,505 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:47:58,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:47:58,568 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:47:58,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58 WrapperNode [2020-10-26 05:47:58,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:47:58,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:47:58,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:47:58,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:47:58,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:47:58,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:47:58,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:47:58,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:47:58,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (1/1) ... [2020-10-26 05:47:58,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:47:58,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:47:58,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:47:58,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:47:58,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (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 [2020-10-26 05:47:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:47:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:47:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:47:58,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:47:59,536 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:47:59,538 INFO L298 CfgBuilder]: Removed 75 assume(true) statements. [2020-10-26 05:47:59,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:47:59 BoogieIcfgContainer [2020-10-26 05:47:59,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:47:59,543 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:47:59,544 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:47:59,548 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:47:59,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:47:59,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:47:58" (1/3) ... [2020-10-26 05:47:59,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11ae77b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:47:59, skipping insertion in model container [2020-10-26 05:47:59,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:47:59,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:47:58" (2/3) ... [2020-10-26 05:47:59,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11ae77b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:47:59, skipping insertion in model container [2020-10-26 05:47:59,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:47:59,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:47:59" (3/3) ... [2020-10-26 05:47:59,555 INFO L373 chiAutomizerObserver]: Analyzing ICFG transmitter.01.cil.c [2020-10-26 05:47:59,648 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:47:59,648 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:47:59,648 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:47:59,649 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:47:59,649 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:47:59,649 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:47:59,649 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:47:59,649 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:47:59,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2020-10-26 05:47:59,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2020-10-26 05:47:59,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:47:59,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:47:59,759 INFO L852 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] [2020-10-26 05:47:59,759 INFO L853 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] [2020-10-26 05:47:59,759 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:47:59,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2020-10-26 05:47:59,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2020-10-26 05:47:59,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:47:59,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:47:59,784 INFO L852 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] [2020-10-26 05:47:59,784 INFO L853 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] [2020-10-26 05:47:59,796 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 5#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 16#L359true havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 51#L146true assume !(1 == ~m_i~0);~m_st~0 := 2; 7#L153-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 12#L158-1true assume !(0 == ~M_E~0); 79#L242-1true assume !(0 == ~T1_E~0); 123#L247-1true assume !(0 == ~E_1~0); 4#L252-1true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 110#L107true assume !(1 == ~m_pc~0); 85#L107-2true is_master_triggered_~__retres1~0 := 0; 111#L118true is_master_triggered_#res := is_master_triggered_~__retres1~0; 46#L119true activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 69#L292true assume !(0 != activate_threads_~tmp~1); 63#L292-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 103#L126true assume 1 == ~t1_pc~0; 54#L127true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 104#L137true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 56#L138true activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 91#L300true assume !(0 != activate_threads_~tmp___0~0); 87#L300-2true assume !(1 == ~M_E~0); 21#L265-1true assume !(1 == ~T1_E~0); 64#L270-1true assume !(1 == ~E_1~0); 101#L396-1true [2020-10-26 05:47:59,798 INFO L796 eck$LassoCheckResult]: Loop: 101#L396-1true assume !false; 29#L397true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 119#L217true assume !true; 22#L232true start_simulation_~kernel_st~0 := 2; 49#L146-1true start_simulation_~kernel_st~0 := 3; 75#L242-2true assume 0 == ~M_E~0;~M_E~0 := 1; 95#L242-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 105#L247-3true assume 0 == ~E_1~0;~E_1~0 := 1; 9#L252-3true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 74#L107-6true assume 1 == ~m_pc~0; 39#L108-2true assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 86#L118-2true is_master_triggered_#res := is_master_triggered_~__retres1~0; 40#L119-2true activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 35#L292-6true assume !(0 != activate_threads_~tmp~1); 30#L292-8true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 117#L126-6true assume !(1 == ~t1_pc~0); 112#L126-8true is_transmit1_triggered_~__retres1~1 := 0; 100#L137-2true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 34#L138-2true activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 48#L300-6true assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 71#L300-8true assume 1 == ~M_E~0;~M_E~0 := 2; 20#L265-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 59#L270-3true assume 1 == ~E_1~0;~E_1~0 := 2; 76#L275-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 57#L171-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L183-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 114#L184-1true start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 121#L415true assume !(0 == start_simulation_~tmp~3); 108#L415-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 38#L171-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13#L183-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 113#L184-2true stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 15#L370true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 72#L377true stop_simulation_#res := stop_simulation_~__retres2~0; 27#L378true start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 11#L428true assume !(0 != start_simulation_~tmp___0~1); 101#L396-1true [2020-10-26 05:47:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:47:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1587080038, now seen corresponding path program 1 times [2020-10-26 05:47:59,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:47:59,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761362187] [2020-10-26 05:47:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:47:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:00,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761362187] [2020-10-26 05:48:00,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:00,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:48:00,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140042226] [2020-10-26 05:48:00,020 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:48:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1935749640, now seen corresponding path program 1 times [2020-10-26 05:48:00,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:00,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335358945] [2020-10-26 05:48:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:00,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335358945] [2020-10-26 05:48:00,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:00,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:48:00,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745724812] [2020-10-26 05:48:00,045 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:48:00,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:48:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:48:00,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:48:00,066 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2020-10-26 05:48:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:48:00,101 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2020-10-26 05:48:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:48:00,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 177 transitions. [2020-10-26 05:48:00,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2020-10-26 05:48:00,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 116 states and 172 transitions. [2020-10-26 05:48:00,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-10-26 05:48:00,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-10-26 05:48:00,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 172 transitions. [2020-10-26 05:48:00,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:48:00,118 INFO L691 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2020-10-26 05:48:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 172 transitions. [2020-10-26 05:48:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-10-26 05:48:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-26 05:48:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2020-10-26 05:48:00,157 INFO L714 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2020-10-26 05:48:00,157 INFO L594 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2020-10-26 05:48:00,158 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:48:00,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 172 transitions. [2020-10-26 05:48:00,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2020-10-26 05:48:00,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:48:00,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:48:00,161 INFO L852 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] [2020-10-26 05:48:00,161 INFO L853 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] [2020-10-26 05:48:00,162 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 256#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 257#L359 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 275#L146 assume 1 == ~m_i~0;~m_st~0 := 0; 260#L153-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 261#L158-1 assume !(0 == ~M_E~0); 270#L242-1 assume !(0 == ~T1_E~0); 357#L247-1 assume !(0 == ~E_1~0); 254#L252-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 255#L107 assume !(1 == ~m_pc~0); 330#L107-2 is_master_triggered_~__retres1~0 := 0; 329#L118 is_master_triggered_#res := is_master_triggered_~__retres1~0; 331#L119 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 332#L292 assume !(0 != activate_threads_~tmp~1); 348#L292-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 349#L126 assume 1 == ~t1_pc~0; 337#L127 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 338#L137 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 342#L138 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 343#L300 assume !(0 != activate_threads_~tmp___0~0); 361#L300-2 assume !(1 == ~M_E~0); 283#L265-1 assume !(1 == ~T1_E~0); 284#L270-1 assume !(1 == ~E_1~0); 269#L396-1 [2020-10-26 05:48:00,162 INFO L796 eck$LassoCheckResult]: Loop: 269#L396-1 assume !false; 296#L397 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 297#L217 assume !false; 277#L194 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 278#L171 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 253#L183 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 276#L184 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 356#L198 assume !(0 != eval_~tmp~0); 285#L232 start_simulation_~kernel_st~0 := 2; 286#L146-1 start_simulation_~kernel_st~0 := 3; 335#L242-2 assume 0 == ~M_E~0;~M_E~0 := 1; 355#L242-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 365#L247-3 assume 0 == ~E_1~0;~E_1~0 := 1; 264#L252-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 265#L107-6 assume 1 == ~m_pc~0; 317#L108-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 318#L118-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 321#L119-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 310#L292-6 assume !(0 != activate_threads_~tmp~1); 298#L292-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 299#L126-6 assume 1 == ~t1_pc~0; 305#L127-2 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 306#L137-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 308#L138-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 309#L300-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 334#L300-8 assume 1 == ~M_E~0;~M_E~0 := 2; 281#L265-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 282#L270-3 assume 1 == ~E_1~0;~E_1~0 := 2; 345#L275-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 344#L171-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 263#L183-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 272#L184-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 367#L415 assume !(0 == start_simulation_~tmp~3); 366#L415-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 316#L171-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 259#L183-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 271#L184-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 273#L370 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 274#L377 stop_simulation_#res := stop_simulation_~__retres2~0; 294#L378 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 268#L428 assume !(0 != start_simulation_~tmp___0~1); 269#L396-1 [2020-10-26 05:48:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:00,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1890238808, now seen corresponding path program 1 times [2020-10-26 05:48:00,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:00,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240424207] [2020-10-26 05:48:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:00,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240424207] [2020-10-26 05:48:00,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:00,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:48:00,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241439649] [2020-10-26 05:48:00,229 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:48:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2118455709, now seen corresponding path program 1 times [2020-10-26 05:48:00,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:00,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95202832] [2020-10-26 05:48:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:00,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95202832] [2020-10-26 05:48:00,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:00,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:48:00,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808790461] [2020-10-26 05:48:00,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:48:00,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:48:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 05:48:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 05:48:00,321 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. cyclomatic complexity: 57 Second operand 4 states. [2020-10-26 05:48:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:48:00,473 INFO L93 Difference]: Finished difference Result 285 states and 404 transitions. [2020-10-26 05:48:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 05:48:00,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 404 transitions. [2020-10-26 05:48:00,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 240 [2020-10-26 05:48:00,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 404 transitions. [2020-10-26 05:48:00,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2020-10-26 05:48:00,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2020-10-26 05:48:00,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 404 transitions. [2020-10-26 05:48:00,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:48:00,491 INFO L691 BuchiCegarLoop]: Abstraction has 285 states and 404 transitions. [2020-10-26 05:48:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 404 transitions. [2020-10-26 05:48:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 266. [2020-10-26 05:48:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-10-26 05:48:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 381 transitions. [2020-10-26 05:48:00,526 INFO L714 BuchiCegarLoop]: Abstraction has 266 states and 381 transitions. [2020-10-26 05:48:00,526 INFO L594 BuchiCegarLoop]: Abstraction has 266 states and 381 transitions. [2020-10-26 05:48:00,526 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:48:00,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 381 transitions. [2020-10-26 05:48:00,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 238 [2020-10-26 05:48:00,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:48:00,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:48:00,532 INFO L852 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] [2020-10-26 05:48:00,533 INFO L853 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] [2020-10-26 05:48:00,533 INFO L794 eck$LassoCheckResult]: Stem: 777#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 669#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 670#L359 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 688#L146 assume 1 == ~m_i~0;~m_st~0 := 0; 673#L153-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 674#L158-1 assume !(0 == ~M_E~0); 683#L242-1 assume !(0 == ~T1_E~0); 767#L247-1 assume !(0 == ~E_1~0); 667#L252-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 668#L107 assume !(1 == ~m_pc~0); 773#L107-2 is_master_triggered_~__retres1~0 := 0; 774#L118 is_master_triggered_#res := is_master_triggered_~__retres1~0; 741#L119 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 742#L292 assume !(0 != activate_threads_~tmp~1); 755#L292-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 756#L126 assume !(1 == ~t1_pc~0); 784#L126-2 is_transmit1_triggered_~__retres1~1 := 0; 785#L137 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 750#L138 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 751#L300 assume !(0 != activate_threads_~tmp___0~0); 776#L300-2 assume !(1 == ~M_E~0); 698#L265-1 assume !(1 == ~T1_E~0); 699#L270-1 assume !(1 == ~E_1~0); 757#L396-1 [2020-10-26 05:48:00,536 INFO L796 eck$LassoCheckResult]: Loop: 757#L396-1 assume !false; 887#L397 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 885#L217 assume !false; 883#L194 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 879#L171 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 876#L183 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 875#L184 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 873#L198 assume !(0 != eval_~tmp~0); 874#L232 start_simulation_~kernel_st~0 := 2; 927#L146-1 start_simulation_~kernel_st~0 := 3; 926#L242-2 assume 0 == ~M_E~0;~M_E~0 := 1; 925#L242-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 787#L247-3 assume 0 == ~E_1~0;~E_1~0 := 1; 677#L252-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 678#L107-6 assume !(1 == ~m_pc~0); 763#L107-8 is_master_triggered_~__retres1~0 := 0; 775#L118-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 734#L119-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 726#L292-6 assume !(0 != activate_threads_~tmp~1); 711#L292-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 712#L126-6 assume !(1 == ~t1_pc~0); 789#L126-8 is_transmit1_triggered_~__retres1~1 := 0; 786#L137-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 721#L138-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 722#L300-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 744#L300-8 assume 1 == ~M_E~0;~M_E~0 := 2; 694#L265-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 695#L270-3 assume 1 == ~E_1~0;~E_1~0 := 2; 752#L275-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 749#L171-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 676#L183-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 685#L184-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 790#L415 assume !(0 == start_simulation_~tmp~3); 793#L415-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 902#L171-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 900#L183-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 898#L184-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 896#L370 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 895#L377 stop_simulation_#res := stop_simulation_~__retres2~0; 892#L378 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 890#L428 assume !(0 != start_simulation_~tmp___0~1); 757#L396-1 [2020-10-26 05:48:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:00,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 1 times [2020-10-26 05:48:00,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:00,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345461224] [2020-10-26 05:48:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:00,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:00,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:00,663 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -469495003, now seen corresponding path program 1 times [2020-10-26 05:48:00,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:00,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037454659] [2020-10-26 05:48:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:00,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037454659] [2020-10-26 05:48:00,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:00,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:48:00,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662964797] [2020-10-26 05:48:00,795 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:48:00,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:48:00,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:48:00,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:48:00,798 INFO L87 Difference]: Start difference. First operand 266 states and 381 transitions. cyclomatic complexity: 117 Second operand 5 states. [2020-10-26 05:48:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:48:00,938 INFO L93 Difference]: Finished difference Result 449 states and 625 transitions. [2020-10-26 05:48:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 05:48:00,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 449 states and 625 transitions. [2020-10-26 05:48:00,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2020-10-26 05:48:00,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 449 states to 449 states and 625 transitions. [2020-10-26 05:48:00,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2020-10-26 05:48:00,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2020-10-26 05:48:00,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 449 states and 625 transitions. [2020-10-26 05:48:00,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:48:00,958 INFO L691 BuchiCegarLoop]: Abstraction has 449 states and 625 transitions. [2020-10-26 05:48:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states and 625 transitions. [2020-10-26 05:48:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 275. [2020-10-26 05:48:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-10-26 05:48:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 390 transitions. [2020-10-26 05:48:00,990 INFO L714 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2020-10-26 05:48:00,992 INFO L594 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2020-10-26 05:48:00,992 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:48:00,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 390 transitions. [2020-10-26 05:48:00,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 247 [2020-10-26 05:48:00,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:48:00,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:48:00,997 INFO L852 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] [2020-10-26 05:48:01,005 INFO L853 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] [2020-10-26 05:48:01,005 INFO L794 eck$LassoCheckResult]: Stem: 1518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 1401#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1402#L359 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 1420#L146 assume 1 == ~m_i~0;~m_st~0 := 0; 1405#L153-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1406#L158-1 assume !(0 == ~M_E~0); 1415#L242-1 assume !(0 == ~T1_E~0); 1507#L247-1 assume !(0 == ~E_1~0); 1399#L252-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 1400#L107 assume !(1 == ~m_pc~0); 1513#L107-2 is_master_triggered_~__retres1~0 := 0; 1514#L118 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1477#L119 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1478#L292 assume !(0 != activate_threads_~tmp~1); 1493#L292-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1494#L126 assume !(1 == ~t1_pc~0); 1524#L126-2 is_transmit1_triggered_~__retres1~1 := 0; 1525#L137 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1488#L138 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1489#L300 assume !(0 != activate_threads_~tmp___0~0); 1517#L300-2 assume !(1 == ~M_E~0); 1431#L265-1 assume !(1 == ~T1_E~0); 1432#L270-1 assume !(1 == ~E_1~0); 1495#L396-1 [2020-10-26 05:48:01,006 INFO L796 eck$LassoCheckResult]: Loop: 1495#L396-1 assume !false; 1601#L397 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1600#L217 assume !false; 1577#L194 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1575#L171 assume !(0 == ~m_st~0); 1572#L175 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 1570#L183 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1565#L184 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 1562#L198 assume !(0 != eval_~tmp~0); 1559#L232 start_simulation_~kernel_st~0 := 2; 1482#L146-1 start_simulation_~kernel_st~0 := 3; 1483#L242-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1505#L242-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1522#L247-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1409#L252-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 1410#L107-6 assume !(1 == ~m_pc~0); 1502#L107-8 is_master_triggered_~__retres1~0 := 0; 1515#L118-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1516#L119-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1456#L292-6 assume !(0 != activate_threads_~tmp~1); 1457#L292-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1532#L126-6 assume !(1 == ~t1_pc~0); 1529#L126-8 is_transmit1_triggered_~__retres1~1 := 0; 1526#L137-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1454#L138-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1455#L300-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1660#L300-8 assume 1 == ~M_E~0;~M_E~0 := 2; 1427#L265-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1428#L270-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1490#L275-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1487#L171-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1408#L183-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1417#L184-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 1530#L415 assume !(0 == start_simulation_~tmp~3); 1528#L415-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 1463#L171-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1404#L183-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1416#L184-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 1418#L370 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1419#L377 stop_simulation_#res := stop_simulation_~__retres2~0; 1626#L378 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1625#L428 assume !(0 != start_simulation_~tmp___0~1); 1495#L396-1 [2020-10-26 05:48:01,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 2 times [2020-10-26 05:48:01,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448937887] [2020-10-26 05:48:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,079 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash 699080276, now seen corresponding path program 1 times [2020-10-26 05:48:01,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472424936] [2020-10-26 05:48:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:01,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472424936] [2020-10-26 05:48:01,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:01,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:48:01,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066877404] [2020-10-26 05:48:01,155 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:48:01,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:48:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:48:01,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:48:01,157 INFO L87 Difference]: Start difference. First operand 275 states and 390 transitions. cyclomatic complexity: 117 Second operand 3 states. [2020-10-26 05:48:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:48:01,203 INFO L93 Difference]: Finished difference Result 446 states and 613 transitions. [2020-10-26 05:48:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:48:01,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 446 states and 613 transitions. [2020-10-26 05:48:01,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 418 [2020-10-26 05:48:01,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 446 states to 446 states and 613 transitions. [2020-10-26 05:48:01,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 446 [2020-10-26 05:48:01,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 446 [2020-10-26 05:48:01,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 613 transitions. [2020-10-26 05:48:01,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:48:01,214 INFO L691 BuchiCegarLoop]: Abstraction has 446 states and 613 transitions. [2020-10-26 05:48:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 613 transitions. [2020-10-26 05:48:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 427. [2020-10-26 05:48:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-26 05:48:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 590 transitions. [2020-10-26 05:48:01,224 INFO L714 BuchiCegarLoop]: Abstraction has 427 states and 590 transitions. [2020-10-26 05:48:01,224 INFO L594 BuchiCegarLoop]: Abstraction has 427 states and 590 transitions. [2020-10-26 05:48:01,224 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:48:01,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 590 transitions. [2020-10-26 05:48:01,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 399 [2020-10-26 05:48:01,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:48:01,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:48:01,229 INFO L852 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] [2020-10-26 05:48:01,229 INFO L853 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] [2020-10-26 05:48:01,229 INFO L794 eck$LassoCheckResult]: Stem: 2250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 2128#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2129#L359 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 2148#L146 assume 1 == ~m_i~0;~m_st~0 := 0; 2132#L153-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2133#L158-1 assume !(0 == ~M_E~0); 2142#L242-1 assume !(0 == ~T1_E~0); 2239#L247-1 assume !(0 == ~E_1~0); 2126#L252-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 2127#L107 assume !(1 == ~m_pc~0); 2247#L107-2 is_master_triggered_~__retres1~0 := 0; 2248#L118 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2205#L119 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2206#L292 assume !(0 != activate_threads_~tmp~1); 2221#L292-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2222#L126 assume !(1 == ~t1_pc~0); 2256#L126-2 is_transmit1_triggered_~__retres1~1 := 0; 2257#L137 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2214#L138 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2215#L300 assume !(0 != activate_threads_~tmp___0~0); 2249#L300-2 assume !(1 == ~M_E~0); 2156#L265-1 assume !(1 == ~T1_E~0); 2157#L270-1 assume !(1 == ~E_1~0); 2223#L396-1 [2020-10-26 05:48:01,230 INFO L796 eck$LassoCheckResult]: Loop: 2223#L396-1 assume !false; 2305#L397 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2303#L217 assume !false; 2301#L194 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2298#L171 assume !(0 == ~m_st~0); 2299#L175 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2473#L183 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2471#L184 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 2468#L198 assume !(0 != eval_~tmp~0); 2465#L232 start_simulation_~kernel_st~0 := 2; 2463#L146-1 start_simulation_~kernel_st~0 := 3; 2233#L242-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2234#L242-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2253#L247-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2136#L252-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 2137#L107-6 assume !(1 == ~m_pc~0); 2232#L107-8 is_master_triggered_~__retres1~0 := 0; 2404#L118-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2402#L119-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2394#L292-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2389#L292-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2380#L126-6 assume !(1 == ~t1_pc~0); 2379#L126-8 is_transmit1_triggered_~__retres1~1 := 0; 2378#L137-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2372#L138-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2367#L300-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 2362#L300-8 assume 1 == ~M_E~0;~M_E~0 := 2; 2358#L265-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2354#L270-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2349#L275-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2344#L171-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2340#L183-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2335#L184-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 2331#L415 assume !(0 == start_simulation_~tmp~3); 2328#L415-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 2325#L171-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2323#L183-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2321#L184-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 2319#L370 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2317#L377 stop_simulation_#res := stop_simulation_~__retres2~0; 2313#L378 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2310#L428 assume !(0 != start_simulation_~tmp___0~1); 2223#L396-1 [2020-10-26 05:48:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 3 times [2020-10-26 05:48:01,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340675595] [2020-10-26 05:48:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,256 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1790448686, now seen corresponding path program 1 times [2020-10-26 05:48:01,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554757561] [2020-10-26 05:48:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:01,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554757561] [2020-10-26 05:48:01,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:01,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:48:01,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735292958] [2020-10-26 05:48:01,330 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:48:01,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:48:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:48:01,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:48:01,331 INFO L87 Difference]: Start difference. First operand 427 states and 590 transitions. cyclomatic complexity: 165 Second operand 5 states. [2020-10-26 05:48:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:48:01,437 INFO L93 Difference]: Finished difference Result 784 states and 1063 transitions. [2020-10-26 05:48:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 05:48:01,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 784 states and 1063 transitions. [2020-10-26 05:48:01,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 754 [2020-10-26 05:48:01,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 784 states to 784 states and 1063 transitions. [2020-10-26 05:48:01,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 784 [2020-10-26 05:48:01,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 784 [2020-10-26 05:48:01,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 784 states and 1063 transitions. [2020-10-26 05:48:01,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:48:01,455 INFO L691 BuchiCegarLoop]: Abstraction has 784 states and 1063 transitions. [2020-10-26 05:48:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states and 1063 transitions. [2020-10-26 05:48:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 414. [2020-10-26 05:48:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-26 05:48:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2020-10-26 05:48:01,467 INFO L714 BuchiCegarLoop]: Abstraction has 414 states and 561 transitions. [2020-10-26 05:48:01,467 INFO L594 BuchiCegarLoop]: Abstraction has 414 states and 561 transitions. [2020-10-26 05:48:01,467 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 05:48:01,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 561 transitions. [2020-10-26 05:48:01,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 384 [2020-10-26 05:48:01,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:48:01,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:48:01,472 INFO L852 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] [2020-10-26 05:48:01,472 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:48:01,472 INFO L794 eck$LassoCheckResult]: Stem: 3469#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 3352#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 3353#L359 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 3371#L146 assume 1 == ~m_i~0;~m_st~0 := 0; 3356#L153-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3357#L158-1 assume !(0 == ~M_E~0); 3366#L242-1 assume !(0 == ~T1_E~0); 3456#L247-1 assume !(0 == ~E_1~0); 3350#L252-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 3351#L107 assume !(1 == ~m_pc~0); 3464#L107-2 is_master_triggered_~__retres1~0 := 0; 3465#L118 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3426#L119 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 3427#L292 assume !(0 != activate_threads_~tmp~1); 3442#L292-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3443#L126 assume !(1 == ~t1_pc~0); 3479#L126-2 is_transmit1_triggered_~__retres1~1 := 0; 3480#L137 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3435#L138 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3436#L300 assume !(0 != activate_threads_~tmp___0~0); 3468#L300-2 assume !(1 == ~M_E~0); 3379#L265-1 assume !(1 == ~T1_E~0); 3380#L270-1 assume !(1 == ~E_1~0); 3444#L396-1 assume !false; 3517#L397 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 3518#L217 [2020-10-26 05:48:01,473 INFO L796 eck$LassoCheckResult]: Loop: 3518#L217 assume !false; 3513#L194 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3514#L171 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3534#L183 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3532#L184 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 3529#L198 assume 0 != eval_~tmp~0; 3526#L198-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 3523#L206 assume !(0 != eval_~tmp_ndt_1~0); 3520#L203 assume !(0 == ~t1_st~0); 3518#L217 [2020-10-26 05:48:01,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 1 times [2020-10-26 05:48:01,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3213446] [2020-10-26 05:48:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,499 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1324144307, now seen corresponding path program 1 times [2020-10-26 05:48:01,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667374505] [2020-10-26 05:48:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,510 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1901692117, now seen corresponding path program 1 times [2020-10-26 05:48:01,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372210008] [2020-10-26 05:48:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:01,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372210008] [2020-10-26 05:48:01,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:01,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:48:01,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460778914] [2020-10-26 05:48:01,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:48:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:48:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:48:01,603 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. cyclomatic complexity: 150 Second operand 3 states. [2020-10-26 05:48:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:48:01,646 INFO L93 Difference]: Finished difference Result 718 states and 961 transitions. [2020-10-26 05:48:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:48:01,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 718 states and 961 transitions. [2020-10-26 05:48:01,653 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 628 [2020-10-26 05:48:01,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 718 states to 718 states and 961 transitions. [2020-10-26 05:48:01,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2020-10-26 05:48:01,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 718 [2020-10-26 05:48:01,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 718 states and 961 transitions. [2020-10-26 05:48:01,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:48:01,661 INFO L691 BuchiCegarLoop]: Abstraction has 718 states and 961 transitions. [2020-10-26 05:48:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states and 961 transitions. [2020-10-26 05:48:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 649. [2020-10-26 05:48:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2020-10-26 05:48:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 879 transitions. [2020-10-26 05:48:01,675 INFO L714 BuchiCegarLoop]: Abstraction has 649 states and 879 transitions. [2020-10-26 05:48:01,675 INFO L594 BuchiCegarLoop]: Abstraction has 649 states and 879 transitions. [2020-10-26 05:48:01,676 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 05:48:01,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 649 states and 879 transitions. [2020-10-26 05:48:01,680 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 583 [2020-10-26 05:48:01,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:48:01,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:48:01,681 INFO L852 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] [2020-10-26 05:48:01,681 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:48:01,681 INFO L794 eck$LassoCheckResult]: Stem: 4614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 4491#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 4492#L359 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 4511#L146 assume 1 == ~m_i~0;~m_st~0 := 0; 4495#L153-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 4496#L158-1 assume !(0 == ~M_E~0); 4506#L242-1 assume !(0 == ~T1_E~0); 4603#L247-1 assume !(0 == ~E_1~0); 4489#L252-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 4490#L107 assume !(1 == ~m_pc~0); 4610#L107-2 is_master_triggered_~__retres1~0 := 0; 4611#L118 is_master_triggered_#res := is_master_triggered_~__retres1~0; 4566#L119 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 4567#L292 assume !(0 != activate_threads_~tmp~1); 4586#L292-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 4587#L126 assume !(1 == ~t1_pc~0); 4620#L126-2 is_transmit1_triggered_~__retres1~1 := 0; 4621#L137 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 4695#L138 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 4693#L300 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 4616#L300-2 assume !(1 == ~M_E~0); 4689#L265-1 assume !(1 == ~T1_E~0); 4588#L270-1 assume !(1 == ~E_1~0); 4589#L396-1 assume !false; 5132#L397 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5121#L217 [2020-10-26 05:48:01,682 INFO L796 eck$LassoCheckResult]: Loop: 5121#L217 assume !false; 5131#L194 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5130#L171 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5128#L183 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5126#L184 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 5124#L198 assume 0 != eval_~tmp~0; 5123#L198-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 4628#L206 assume !(0 != eval_~tmp_ndt_1~0); 4629#L203 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 4659#L220 assume !(0 != eval_~tmp_ndt_2~0); 5121#L217 [2020-10-26 05:48:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1281699405, now seen corresponding path program 1 times [2020-10-26 05:48:01,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511643731] [2020-10-26 05:48:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:48:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:48:01,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511643731] [2020-10-26 05:48:01,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:48:01,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:48:01,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229638830] [2020-10-26 05:48:01,702 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:48:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1901200368, now seen corresponding path program 1 times [2020-10-26 05:48:01,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474493305] [2020-10-26 05:48:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,712 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:01,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:48:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:48:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:48:01,774 INFO L87 Difference]: Start difference. First operand 649 states and 879 transitions. cyclomatic complexity: 234 Second operand 3 states. [2020-10-26 05:48:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:48:01,784 INFO L93 Difference]: Finished difference Result 543 states and 738 transitions. [2020-10-26 05:48:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:48:01,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 543 states and 738 transitions. [2020-10-26 05:48:01,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 513 [2020-10-26 05:48:01,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 543 states to 543 states and 738 transitions. [2020-10-26 05:48:01,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 543 [2020-10-26 05:48:01,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2020-10-26 05:48:01,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 543 states and 738 transitions. [2020-10-26 05:48:01,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:48:01,806 INFO L691 BuchiCegarLoop]: Abstraction has 543 states and 738 transitions. [2020-10-26 05:48:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states and 738 transitions. [2020-10-26 05:48:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2020-10-26 05:48:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-10-26 05:48:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 738 transitions. [2020-10-26 05:48:01,818 INFO L714 BuchiCegarLoop]: Abstraction has 543 states and 738 transitions. [2020-10-26 05:48:01,818 INFO L594 BuchiCegarLoop]: Abstraction has 543 states and 738 transitions. [2020-10-26 05:48:01,818 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 05:48:01,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 543 states and 738 transitions. [2020-10-26 05:48:01,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 513 [2020-10-26 05:48:01,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:48:01,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:48:01,824 INFO L852 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] [2020-10-26 05:48:01,824 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:48:01,824 INFO L794 eck$LassoCheckResult]: Stem: 5818#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_1~0 := 2; 5689#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5690#L359 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 5709#L146 assume 1 == ~m_i~0;~m_st~0 := 0; 5693#L153-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5694#L158-1 assume !(0 == ~M_E~0); 5703#L242-1 assume !(0 == ~T1_E~0); 5803#L247-1 assume !(0 == ~E_1~0); 5687#L252-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 5688#L107 assume !(1 == ~m_pc~0); 5813#L107-2 is_master_triggered_~__retres1~0 := 0; 5814#L118 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5765#L119 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5766#L292 assume !(0 != activate_threads_~tmp~1); 5786#L292-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5787#L126 assume !(1 == ~t1_pc~0); 5825#L126-2 is_transmit1_triggered_~__retres1~1 := 0; 5826#L137 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5778#L138 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5779#L300 assume !(0 != activate_threads_~tmp___0~0); 5817#L300-2 assume !(1 == ~M_E~0); 5717#L265-1 assume !(1 == ~T1_E~0); 5718#L270-1 assume !(1 == ~E_1~0); 5788#L396-1 assume !false; 6088#L397 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 6087#L217 [2020-10-26 05:48:01,824 INFO L796 eck$LassoCheckResult]: Loop: 6087#L217 assume !false; 6086#L194 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6085#L171 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 6084#L183 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6083#L184 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 6082#L198 assume 0 != eval_~tmp~0; 6081#L198-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 5838#L206 assume !(0 != eval_~tmp_ndt_1~0); 5839#L203 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 5841#L220 assume !(0 != eval_~tmp_ndt_2~0); 6087#L217 [2020-10-26 05:48:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 2 times [2020-10-26 05:48:01,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274766990] [2020-10-26 05:48:01,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,871 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1901200368, now seen corresponding path program 2 times [2020-10-26 05:48:01,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35483174] [2020-10-26 05:48:01,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,896 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:48:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1177085592, now seen corresponding path program 1 times [2020-10-26 05:48:01,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:48:01,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954307275] [2020-10-26 05:48:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:48:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:48:01,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:48:01,920 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:48:02,405 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2020-10-26 05:48:02,589 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-26 05:48:02,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:48:02 BoogieIcfgContainer [2020-10-26 05:48:02,625 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:48:02,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:48:02,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:48:02,626 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:48:02,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:47:59" (3/4) ... [2020-10-26 05:48:02,630 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 05:48:02,686 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 05:48:02,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:48:02,688 INFO L168 Benchmark]: Toolchain (without parser) took 4568.70 ms. Allocated memory was 50.3 MB in the beginning and 96.5 MB in the end (delta: 46.1 MB). Free memory was 27.4 MB in the beginning and 58.7 MB in the end (delta: -31.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:48:02,689 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 50.3 MB. Free memory was 30.8 MB in the beginning and 30.8 MB in the end (delta: 39.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:48:02,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.61 ms. Allocated memory is still 50.3 MB. Free memory was 26.8 MB in the beginning and 27.2 MB in the end (delta: -408.7 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-26 05:48:02,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 50.3 MB. Free memory was 27.2 MB in the beginning and 24.9 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:48:02,695 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 50.3 MB. Free memory was 24.8 MB in the beginning and 23.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 05:48:02,696 INFO L168 Benchmark]: RCFGBuilder took 875.33 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 23.0 MB in the beginning and 28.1 MB in the end (delta: -5.2 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2020-10-26 05:48:02,697 INFO L168 Benchmark]: BuchiAutomizer took 3081.77 ms. Allocated memory was 60.8 MB in the beginning and 96.5 MB in the end (delta: 35.7 MB). Free memory was 27.7 MB in the beginning and 60.7 MB in the end (delta: -33.0 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. [2020-10-26 05:48:02,697 INFO L168 Benchmark]: Witness Printer took 61.11 ms. Allocated memory is still 96.5 MB. Free memory was 60.7 MB in the beginning and 58.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:48:02,705 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 50.3 MB. Free memory was 30.8 MB in the beginning and 30.8 MB in the end (delta: 39.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 439.61 ms. Allocated memory is still 50.3 MB. Free memory was 26.8 MB in the beginning and 27.2 MB in the end (delta: -408.7 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 50.3 MB. Free memory was 27.2 MB in the beginning and 24.9 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory is still 50.3 MB. Free memory was 24.8 MB in the beginning and 23.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 875.33 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 23.0 MB in the beginning and 28.1 MB in the end (delta: -5.2 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3081.77 ms. Allocated memory was 60.8 MB in the beginning and 96.5 MB in the end (delta: 35.7 MB). Free memory was 27.7 MB in the beginning and 60.7 MB in the end (delta: -33.0 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. * Witness Printer took 61.11 ms. Allocated memory is still 96.5 MB. Free memory was 60.7 MB in the beginning and 58.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 543 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 651 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 649 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1231 SDtfs, 1604 SDslu, 1552 SDs, 0 SdLazy, 177 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 193]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10b53be9=0, NULL=2, NULL=0, \result=0, __retres1=0, NULL=1, tmp=1, \result=0, kernel_st=1, __retres1=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4da74e5c=0, t1_pc=0, __retres1=1, T1_E=2, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41399499=0, \result=0, E_1=2, NULL=0, tmp_ndt_1=0, NULL=0, NULL=0, M_E=2, tmp_ndt_2=0, tmp=0, NULL=4, m_i=1, t1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@306ef5f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b9c8a12=0, m_st=0, NULL=0, tmp___0=0, tmp=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2793c870=0, t1_i=1, m_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ed3ac95=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 193]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int E_1 = 2; [L441] int __retres1 ; [L356] m_i = 1 [L357] t1_i = 1 [L382] int kernel_st ; [L383] int tmp ; [L384] int tmp___0 ; [L388] kernel_st = 0 [L153] COND TRUE m_i == 1 [L154] m_st = 0 [L158] COND TRUE t1_i == 1 [L159] t1_st = 0 [L242] COND FALSE !(M_E == 0) [L247] COND FALSE !(T1_E == 0) [L252] COND FALSE !(E_1 == 0) [L285] int tmp ; [L286] int tmp___0 ; [L104] int __retres1 ; [L107] COND FALSE !(m_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) [L123] int __retres1 ; [L126] COND FALSE !(t1_pc == 1) [L136] __retres1 = 0 [L138] return (__retres1); [L298] tmp___0 = is_transmit1_triggered() [L300] COND FALSE !(\read(tmp___0)) [L265] COND FALSE !(M_E == 1) [L270] COND FALSE !(T1_E == 1) [L275] COND FALSE !(E_1 == 1) [L396] COND TRUE 1 [L399] kernel_st = 1 [L189] int tmp ; Loop: [L193] COND TRUE 1 [L168] int __retres1 ; [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 [L184] return (__retres1); [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND FALSE !(\read(tmp_ndt_1)) [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...