./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-a4ecdab [2020-11-28 03:20:52,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:20:52,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:20:52,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:20:52,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:20:52,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:20:52,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:20:52,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:20:52,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:20:52,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:20:52,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:20:52,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:20:52,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:20:52,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:20:52,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:20:52,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:20:52,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:20:52,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:20:52,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:20:52,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:20:52,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:20:52,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:20:52,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:20:52,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:20:52,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:20:52,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:20:52,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:20:52,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:20:52,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:20:52,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:20:52,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:20:52,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:20:52,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:20:52,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:20:52,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:20:52,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:20:52,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:20:52,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:20:52,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:20:52,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:20:52,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:20:52,802 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:20:52,848 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:20:52,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:20:52,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:20:52,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:20:52,851 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:20:52,851 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:20:52,851 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:20:52,852 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:20:52,852 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:20:52,852 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:20:52,853 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:20:52,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:20:52,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:20:52,854 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:20:52,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:20:52,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:20:52,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:20:52,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:20:52,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:20:52,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:20:52,856 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:20:52,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:20:52,856 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:20:52,856 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:20:52,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:20:52,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:20:52,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:20:52,857 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:20:52,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:20:52,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:20:52,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:20:52,860 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:20:52,861 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:20:52,862 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:/tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 [2020-11-28 03:20:53,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:20:53,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:20:53,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:20:53,262 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:20:53,263 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:20:53,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-11-28 03:20:53,339 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/data/d2fe31770/f72dd7cd620349c2bb328281dc6f0f33/FLAG0395341ce [2020-11-28 03:20:53,886 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:20:53,886 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-11-28 03:20:53,906 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/data/d2fe31770/f72dd7cd620349c2bb328281dc6f0f33/FLAG0395341ce [2020-11-28 03:20:54,216 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/data/d2fe31770/f72dd7cd620349c2bb328281dc6f0f33 [2020-11-28 03:20:54,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:20:54,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:20:54,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:54,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:20:54,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:20:54,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1784f8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54, skipping insertion in model container [2020-11-28 03:20:54,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:20:54,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:20:54,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:54,566 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:20:54,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:54,625 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:20:54,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54 WrapperNode [2020-11-28 03:20:54,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:54,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:54,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:20:54,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:20:54,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:54,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:20:54,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:20:54,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:20:54,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... [2020-11-28 03:20:54,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:20:54,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:20:54,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:20:54,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:20:54,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:20:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:20:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:20:54,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:20:55,836 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:20:55,836 INFO L298 CfgBuilder]: Removed 86 assume(true) statements. [2020-11-28 03:20:55,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:55 BoogieIcfgContainer [2020-11-28 03:20:55,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:20:55,840 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:20:55,840 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:20:55,843 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:20:55,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:20:55,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:20:54" (1/3) ... [2020-11-28 03:20:55,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b29e853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:20:55, skipping insertion in model container [2020-11-28 03:20:55,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:20:55,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:54" (2/3) ... [2020-11-28 03:20:55,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b29e853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:20:55, skipping insertion in model container [2020-11-28 03:20:55,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:20:55,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:55" (3/3) ... [2020-11-28 03:20:55,848 INFO L373 chiAutomizerObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-11-28 03:20:55,913 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:20:55,913 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:20:55,913 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:20:55,913 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:20:55,914 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:20:55,914 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:20:55,914 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:20:55,914 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:20:55,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states. [2020-11-28 03:20:55,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2020-11-28 03:20:55,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:55,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:55,970 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-11-28 03:20:55,971 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] [2020-11-28 03:20:55,971 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:20:55,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states. [2020-11-28 03:20:55,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2020-11-28 03:20:55,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:55,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:55,982 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-11-28 03:20:55,982 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] [2020-11-28 03:20:55,990 INFO L794 eck$LassoCheckResult]: Stem: 114#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 22#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 40#L395true havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 141#L167true assume !(1 == ~m_i~0);~m_st~0 := 2; 89#L174-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 95#L179-1true assume !(0 == ~M_E~0); 10#L263-1true assume !(0 == ~T1_E~0); 74#L268-1true assume !(0 == ~E_M~0); 83#L273-1true assume !(0 == ~E_1~0); 113#L278-1true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 50#L128true assume !(1 == ~m_pc~0); 19#L128-2true is_master_triggered_~__retres1~0 := 0; 51#L139true is_master_triggered_#res := is_master_triggered_~__retres1~0; 139#L140true activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 64#L323true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 67#L323-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 41#L147true assume 1 == ~t1_pc~0; 131#L148true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 42#L158true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 145#L159true activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 85#L331true assume !(0 != activate_threads_~tmp___0~0); 71#L331-2true assume !(1 == ~M_E~0); 149#L291-1true assume !(1 == ~T1_E~0); 12#L296-1true assume !(1 == ~E_M~0); 77#L301-1true assume 1 == ~E_1~0;~E_1~0 := 2; 117#L432-1true [2020-11-28 03:20:55,991 INFO L796 eck$LassoCheckResult]: Loop: 117#L432-1true assume !false; 79#L433true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 61#L238true assume false; 108#L253true start_simulation_~kernel_st~0 := 2; 140#L167-1true start_simulation_~kernel_st~0 := 3; 5#L263-2true assume 0 == ~M_E~0;~M_E~0 := 1; 26#L263-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 44#L268-3true assume 0 == ~E_M~0;~E_M~0 := 1; 92#L273-3true assume 0 == ~E_1~0;~E_1~0 := 1; 96#L278-3true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 24#L128-9true assume !(1 == ~m_pc~0); 23#L128-11true is_master_triggered_~__retres1~0 := 0; 16#L139-3true is_master_triggered_#res := is_master_triggered_~__retres1~0; 112#L140-3true activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 63#L323-9true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 31#L323-11true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 47#L147-9true assume !(1 == ~t1_pc~0); 18#L147-11true is_transmit1_triggered_~__retres1~1 := 0; 32#L158-3true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 123#L159-3true activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 66#L331-9true assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 69#L331-11true assume 1 == ~M_E~0;~M_E~0 := 2; 148#L291-3true assume !(1 == ~T1_E~0); 6#L296-3true assume 1 == ~E_M~0;~E_M~0 := 2; 72#L301-3true assume 1 == ~E_1~0;~E_1~0 := 2; 94#L306-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 146#L192-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 98#L204-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 56#L205-1true start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 118#L451true assume !(0 == start_simulation_~tmp~3); 122#L451-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 129#L192-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 97#L204-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 53#L205-2true stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 39#L406true assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 99#L413true stop_simulation_#res := stop_simulation_~__retres2~0; 49#L414true start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 27#L464true assume !(0 != start_simulation_~tmp___0~1); 117#L432-1true [2020-11-28 03:20:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash 22332154, now seen corresponding path program 1 times [2020-11-28 03:20:56,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232686776] [2020-11-28 03:20:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:56,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232686776] [2020-11-28 03:20:56,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:56,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:56,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76984619] [2020-11-28 03:20:56,167 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -272371353, now seen corresponding path program 1 times [2020-11-28 03:20:56,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325570587] [2020-11-28 03:20:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:56,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325570587] [2020-11-28 03:20:56,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:56,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:56,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655696064] [2020-11-28 03:20:56,190 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:56,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:56,209 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2020-11-28 03:20:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:56,259 INFO L93 Difference]: Finished difference Result 146 states and 218 transitions. [2020-11-28 03:20:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:56,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 218 transitions. [2020-11-28 03:20:56,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2020-11-28 03:20:56,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 140 states and 212 transitions. [2020-11-28 03:20:56,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2020-11-28 03:20:56,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2020-11-28 03:20:56,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 212 transitions. [2020-11-28 03:20:56,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:56,276 INFO L691 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2020-11-28 03:20:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 212 transitions. [2020-11-28 03:20:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-11-28 03:20:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-28 03:20:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 212 transitions. [2020-11-28 03:20:56,315 INFO L714 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2020-11-28 03:20:56,315 INFO L594 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2020-11-28 03:20:56,315 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:20:56,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 212 transitions. [2020-11-28 03:20:56,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2020-11-28 03:20:56,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:56,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:56,320 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-11-28 03:20:56,320 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, 1] [2020-11-28 03:20:56,321 INFO L794 eck$LassoCheckResult]: Stem: 438#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 345#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 346#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 374#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 425#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 426#L179-1 assume !(0 == ~M_E~0); 319#L263-1 assume !(0 == ~T1_E~0); 320#L268-1 assume !(0 == ~E_M~0); 412#L273-1 assume !(0 == ~E_1~0); 419#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 384#L128 assume !(1 == ~m_pc~0); 338#L128-2 is_master_triggered_~__retres1~0 := 0; 339#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 387#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 402#L323 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 403#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 375#L147 assume 1 == ~t1_pc~0; 376#L148 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 364#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 377#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 422#L331 assume !(0 != activate_threads_~tmp___0~0); 410#L331-2 assume !(1 == ~M_E~0); 411#L291-1 assume !(1 == ~T1_E~0); 328#L296-1 assume !(1 == ~E_M~0); 329#L301-1 assume 1 == ~E_1~0;~E_1~0 := 2; 351#L432-1 [2020-11-28 03:20:56,321 INFO L796 eck$LassoCheckResult]: Loop: 351#L432-1 assume !false; 415#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 322#L238 assume !false; 399#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 433#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 432#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 395#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 315#L219 assume !(0 != eval_~tmp~0); 316#L253 start_simulation_~kernel_st~0 := 2; 437#L167-1 start_simulation_~kernel_st~0 := 3; 313#L263-2 assume 0 == ~M_E~0;~M_E~0 := 1; 314#L263-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 352#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 378#L273-3 assume 0 == ~E_1~0;~E_1~0 := 1; 429#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 348#L128-9 assume !(1 == ~m_pc~0); 347#L128-11 is_master_triggered_~__retres1~0 := 0; 334#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 335#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 400#L323-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 359#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 360#L147-9 assume !(1 == ~t1_pc~0); 336#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 337#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 358#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 404#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 405#L331-11 assume 1 == ~M_E~0;~M_E~0 := 2; 406#L291-3 assume !(1 == ~T1_E~0); 309#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 310#L301-3 assume 1 == ~E_1~0;~E_1~0 := 2; 409#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 430#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 428#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 393#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 394#L451 assume !(0 == start_simulation_~tmp~3); 440#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 441#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 424#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 386#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 370#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 371#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 382#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 350#L464 assume !(0 != start_simulation_~tmp___0~1); 351#L432-1 [2020-11-28 03:20:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash -196522564, now seen corresponding path program 1 times [2020-11-28 03:20:56,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373114196] [2020-11-28 03:20:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:56,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373114196] [2020-11-28 03:20:56,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:56,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:56,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252414794] [2020-11-28 03:20:56,423 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash 727187030, now seen corresponding path program 1 times [2020-11-28 03:20:56,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613297443] [2020-11-28 03:20:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:56,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613297443] [2020-11-28 03:20:56,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:56,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:56,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43666722] [2020-11-28 03:20:56,514 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:56,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:20:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:56,516 INFO L87 Difference]: Start difference. First operand 140 states and 212 transitions. cyclomatic complexity: 73 Second operand 5 states. [2020-11-28 03:20:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:56,730 INFO L93 Difference]: Finished difference Result 355 states and 531 transitions. [2020-11-28 03:20:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:20:56,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 531 transitions. [2020-11-28 03:20:56,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2020-11-28 03:20:56,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 355 states and 531 transitions. [2020-11-28 03:20:56,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2020-11-28 03:20:56,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2020-11-28 03:20:56,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 355 states and 531 transitions. [2020-11-28 03:20:56,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:56,761 INFO L691 BuchiCegarLoop]: Abstraction has 355 states and 531 transitions. [2020-11-28 03:20:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 531 transitions. [2020-11-28 03:20:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 155. [2020-11-28 03:20:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-11-28 03:20:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 227 transitions. [2020-11-28 03:20:56,790 INFO L714 BuchiCegarLoop]: Abstraction has 155 states and 227 transitions. [2020-11-28 03:20:56,790 INFO L594 BuchiCegarLoop]: Abstraction has 155 states and 227 transitions. [2020-11-28 03:20:56,790 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:20:56,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 227 transitions. [2020-11-28 03:20:56,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 125 [2020-11-28 03:20:56,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:56,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:56,794 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-11-28 03:20:56,794 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, 1] [2020-11-28 03:20:56,795 INFO L794 eck$LassoCheckResult]: Stem: 953#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 853#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 854#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 882#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 934#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 935#L179-1 assume !(0 == ~M_E~0); 827#L263-1 assume !(0 == ~T1_E~0); 828#L268-1 assume !(0 == ~E_M~0); 923#L273-1 assume !(0 == ~E_1~0); 928#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 892#L128 assume !(1 == ~m_pc~0); 846#L128-2 is_master_triggered_~__retres1~0 := 0; 847#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 965#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 911#L323 assume !(0 != activate_threads_~tmp~1); 912#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 883#L147 assume 1 == ~t1_pc~0; 884#L148 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 872#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 885#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 931#L331 assume !(0 != activate_threads_~tmp___0~0); 919#L331-2 assume !(1 == ~M_E~0); 920#L291-1 assume !(1 == ~T1_E~0); 836#L296-1 assume !(1 == ~E_M~0); 837#L301-1 assume 1 == ~E_1~0;~E_1~0 := 2; 860#L432-1 [2020-11-28 03:20:56,795 INFO L796 eck$LassoCheckResult]: Loop: 860#L432-1 assume !false; 924#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 830#L238 assume !false; 908#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 942#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 940#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 904#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 823#L219 assume !(0 != eval_~tmp~0); 824#L253 start_simulation_~kernel_st~0 := 2; 944#L167-1 start_simulation_~kernel_st~0 := 3; 817#L263-2 assume 0 == ~M_E~0;~M_E~0 := 1; 818#L263-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 858#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 886#L273-3 assume 0 == ~E_1~0;~E_1~0 := 1; 938#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 856#L128-9 assume !(1 == ~m_pc~0); 855#L128-11 is_master_triggered_~__retres1~0 := 0; 842#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 843#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 909#L323-9 assume !(0 != activate_threads_~tmp~1); 866#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 867#L147-9 assume 1 == ~t1_pc~0; 889#L148-3 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 845#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 868#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 913#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 914#L331-11 assume 1 == ~M_E~0;~M_E~0 := 2; 916#L291-3 assume !(1 == ~T1_E~0); 819#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 820#L301-3 assume 1 == ~E_1~0;~E_1~0 := 2; 918#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 941#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 937#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 902#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 903#L451 assume !(0 == start_simulation_~tmp~3); 955#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 956#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 933#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 895#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 880#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 881#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 891#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 859#L464 assume !(0 != start_simulation_~tmp___0~1); 860#L432-1 [2020-11-28 03:20:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash 504542014, now seen corresponding path program 1 times [2020-11-28 03:20:56,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789030537] [2020-11-28 03:20:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:56,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789030537] [2020-11-28 03:20:56,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:56,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:56,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50531000] [2020-11-28 03:20:56,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 706560181, now seen corresponding path program 1 times [2020-11-28 03:20:56,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324199236] [2020-11-28 03:20:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:56,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324199236] [2020-11-28 03:20:56,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:56,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:56,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856465008] [2020-11-28 03:20:56,954 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:56,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:56,956 INFO L87 Difference]: Start difference. First operand 155 states and 227 transitions. cyclomatic complexity: 73 Second operand 4 states. [2020-11-28 03:20:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:57,121 INFO L93 Difference]: Finished difference Result 345 states and 487 transitions. [2020-11-28 03:20:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:57,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 487 transitions. [2020-11-28 03:20:57,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 300 [2020-11-28 03:20:57,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 345 states and 487 transitions. [2020-11-28 03:20:57,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2020-11-28 03:20:57,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2020-11-28 03:20:57,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 345 states and 487 transitions. [2020-11-28 03:20:57,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:57,135 INFO L691 BuchiCegarLoop]: Abstraction has 345 states and 487 transitions. [2020-11-28 03:20:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states and 487 transitions. [2020-11-28 03:20:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 323. [2020-11-28 03:20:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-28 03:20:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 462 transitions. [2020-11-28 03:20:57,166 INFO L714 BuchiCegarLoop]: Abstraction has 323 states and 462 transitions. [2020-11-28 03:20:57,166 INFO L594 BuchiCegarLoop]: Abstraction has 323 states and 462 transitions. [2020-11-28 03:20:57,166 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:20:57,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 462 transitions. [2020-11-28 03:20:57,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 293 [2020-11-28 03:20:57,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:57,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:57,174 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-11-28 03:20:57,174 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, 1] [2020-11-28 03:20:57,174 INFO L794 eck$LassoCheckResult]: Stem: 1464#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1361#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1362#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 1390#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 1442#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1443#L179-1 assume !(0 == ~M_E~0); 1337#L263-1 assume !(0 == ~T1_E~0); 1338#L268-1 assume !(0 == ~E_M~0); 1429#L273-1 assume !(0 == ~E_1~0); 1435#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 1399#L128 assume !(1 == ~m_pc~0); 1354#L128-2 is_master_triggered_~__retres1~0 := 0; 1355#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1402#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1417#L323 assume !(0 != activate_threads_~tmp~1); 1418#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1391#L147 assume !(1 == ~t1_pc~0); 1379#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 1380#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1393#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1439#L331 assume !(0 != activate_threads_~tmp___0~0); 1425#L331-2 assume !(1 == ~M_E~0); 1426#L291-1 assume !(1 == ~T1_E~0); 1345#L296-1 assume !(1 == ~E_M~0); 1346#L301-1 assume 1 == ~E_1~0;~E_1~0 := 2; 1368#L432-1 [2020-11-28 03:20:57,175 INFO L796 eck$LassoCheckResult]: Loop: 1368#L432-1 assume !false; 1430#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1340#L238 assume !false; 1413#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1583#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1453#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1409#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 1335#L219 assume !(0 != eval_~tmp~0); 1336#L253 start_simulation_~kernel_st~0 := 2; 1627#L167-1 start_simulation_~kernel_st~0 := 3; 1624#L263-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1621#L263-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1618#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1615#L273-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1613#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 1611#L128-9 assume !(1 == ~m_pc~0); 1608#L128-11 is_master_triggered_~__retres1~0 := 0; 1604#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1601#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1597#L323-9 assume !(0 != activate_threads_~tmp~1); 1594#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1396#L147-9 assume !(1 == ~t1_pc~0); 1350#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 1351#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1376#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1419#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1420#L331-11 assume 1 == ~M_E~0;~M_E~0 := 2; 1422#L291-3 assume !(1 == ~T1_E~0); 1329#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1330#L301-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1424#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1449#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1445#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1407#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 1408#L451 assume !(0 == start_simulation_~tmp~3); 1466#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 1479#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1441#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1600#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 1596#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 1593#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 1398#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 1367#L464 assume !(0 != start_simulation_~tmp___0~1); 1368#L432-1 [2020-11-28 03:20:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777217, now seen corresponding path program 1 times [2020-11-28 03:20:57,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231228873] [2020-11-28 03:20:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:57,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231228873] [2020-11-28 03:20:57,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:57,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:57,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546467434] [2020-11-28 03:20:57,254 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 593173524, now seen corresponding path program 1 times [2020-11-28 03:20:57,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029918513] [2020-11-28 03:20:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:57,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029918513] [2020-11-28 03:20:57,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:57,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:57,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617914044] [2020-11-28 03:20:57,312 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:57,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:57,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:57,313 INFO L87 Difference]: Start difference. First operand 323 states and 462 transitions. cyclomatic complexity: 141 Second operand 4 states. [2020-11-28 03:20:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:57,440 INFO L93 Difference]: Finished difference Result 625 states and 877 transitions. [2020-11-28 03:20:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:57,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 625 states and 877 transitions. [2020-11-28 03:20:57,449 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 536 [2020-11-28 03:20:57,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 625 states to 625 states and 877 transitions. [2020-11-28 03:20:57,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 625 [2020-11-28 03:20:57,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 625 [2020-11-28 03:20:57,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 625 states and 877 transitions. [2020-11-28 03:20:57,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:57,459 INFO L691 BuchiCegarLoop]: Abstraction has 625 states and 877 transitions. [2020-11-28 03:20:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states and 877 transitions. [2020-11-28 03:20:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 597. [2020-11-28 03:20:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-11-28 03:20:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 835 transitions. [2020-11-28 03:20:57,489 INFO L714 BuchiCegarLoop]: Abstraction has 597 states and 835 transitions. [2020-11-28 03:20:57,492 INFO L594 BuchiCegarLoop]: Abstraction has 597 states and 835 transitions. [2020-11-28 03:20:57,492 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:20:57,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 597 states and 835 transitions. [2020-11-28 03:20:57,514 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 532 [2020-11-28 03:20:57,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:57,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:57,519 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-11-28 03:20:57,520 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, 1] [2020-11-28 03:20:57,520 INFO L794 eck$LassoCheckResult]: Stem: 2425#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2320#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2321#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 2348#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 2403#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2404#L179-1 assume 0 == ~M_E~0;~M_E~0 := 1; 2412#L263-1 assume !(0 == ~T1_E~0); 2657#L268-1 assume !(0 == ~E_M~0); 2656#L273-1 assume 0 == ~E_1~0;~E_1~0 := 1; 2394#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 2356#L128 assume !(1 == ~m_pc~0); 2313#L128-2 is_master_triggered_~__retres1~0 := 0; 2314#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2358#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2443#L323 assume !(0 != activate_threads_~tmp~1); 2648#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2646#L147 assume !(1 == ~t1_pc~0); 2642#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 2629#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2625#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2622#L331 assume !(0 != activate_threads_~tmp___0~0); 2619#L331-2 assume !(1 == ~M_E~0); 2616#L291-1 assume !(1 == ~T1_E~0); 2613#L296-1 assume !(1 == ~E_M~0); 2610#L301-1 assume 1 == ~E_1~0;~E_1~0 := 2; 2389#L432-1 [2020-11-28 03:20:57,522 INFO L796 eck$LassoCheckResult]: Loop: 2389#L432-1 assume !false; 2605#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2601#L238 assume !false; 2599#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2597#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2593#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2590#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 2587#L219 assume !(0 != eval_~tmp~0); 2582#L253 start_simulation_~kernel_st~0 := 2; 2580#L167-1 start_simulation_~kernel_st~0 := 3; 2578#L263-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2564#L263-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2574#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2572#L273-3 assume !(0 == ~E_1~0); 2569#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 2567#L128-9 assume !(1 == ~m_pc~0); 2565#L128-11 is_master_triggered_~__retres1~0 := 0; 2562#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2560#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2558#L323-9 assume !(0 != activate_threads_~tmp~1); 2555#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2553#L147-9 assume !(1 == ~t1_pc~0); 2551#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 2549#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2547#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2545#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 2530#L331-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2528#L291-3 assume !(1 == ~T1_E~0); 2525#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2524#L301-3 assume !(1 == ~E_1~0); 2522#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2503#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2486#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2487#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 2633#L451 assume !(0 == start_simulation_~tmp~3); 2631#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 2627#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2624#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2621#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 2618#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 2615#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 2612#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 2609#L464 assume !(0 != start_simulation_~tmp___0~1); 2389#L432-1 [2020-11-28 03:20:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,525 INFO L82 PathProgramCache]: Analyzing trace with hash 715219135, now seen corresponding path program 1 times [2020-11-28 03:20:57,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144092303] [2020-11-28 03:20:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:57,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144092303] [2020-11-28 03:20:57,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:57,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:57,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985123024] [2020-11-28 03:20:57,579 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash -395311472, now seen corresponding path program 1 times [2020-11-28 03:20:57,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514745931] [2020-11-28 03:20:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:57,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514745931] [2020-11-28 03:20:57,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:57,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:57,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934920116] [2020-11-28 03:20:57,620 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:57,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:57,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:57,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:57,621 INFO L87 Difference]: Start difference. First operand 597 states and 835 transitions. cyclomatic complexity: 242 Second operand 3 states. [2020-11-28 03:20:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:57,651 INFO L93 Difference]: Finished difference Result 884 states and 1231 transitions. [2020-11-28 03:20:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:57,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 884 states and 1231 transitions. [2020-11-28 03:20:57,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 833 [2020-11-28 03:20:57,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 884 states to 884 states and 1231 transitions. [2020-11-28 03:20:57,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 884 [2020-11-28 03:20:57,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 884 [2020-11-28 03:20:57,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 884 states and 1231 transitions. [2020-11-28 03:20:57,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:57,675 INFO L691 BuchiCegarLoop]: Abstraction has 884 states and 1231 transitions. [2020-11-28 03:20:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states and 1231 transitions. [2020-11-28 03:20:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 701. [2020-11-28 03:20:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2020-11-28 03:20:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 976 transitions. [2020-11-28 03:20:57,692 INFO L714 BuchiCegarLoop]: Abstraction has 701 states and 976 transitions. [2020-11-28 03:20:57,692 INFO L594 BuchiCegarLoop]: Abstraction has 701 states and 976 transitions. [2020-11-28 03:20:57,693 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:20:57,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 976 transitions. [2020-11-28 03:20:57,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 650 [2020-11-28 03:20:57,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:57,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:57,702 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-11-28 03:20:57,702 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, 1] [2020-11-28 03:20:57,702 INFO L794 eck$LassoCheckResult]: Stem: 3926#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 3808#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 3809#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 3835#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 3902#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3903#L179-1 assume !(0 == ~M_E~0); 3783#L263-1 assume !(0 == ~T1_E~0); 3784#L268-1 assume !(0 == ~E_M~0); 3882#L273-1 assume 0 == ~E_1~0;~E_1~0 := 1; 3891#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 3925#L128 assume !(1 == ~m_pc~0); 3801#L128-2 is_master_triggered_~__retres1~0 := 0; 3802#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3947#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3948#L323 assume !(0 != activate_threads_~tmp~1); 3873#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3874#L147 assume !(1 == ~t1_pc~0); 3824#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 3825#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3951#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 3952#L331 assume !(0 != activate_threads_~tmp___0~0); 3879#L331-2 assume !(1 == ~M_E~0); 3880#L291-1 assume !(1 == ~T1_E~0); 3788#L296-1 assume !(1 == ~E_M~0); 3789#L301-1 assume 1 == ~E_1~0;~E_1~0 := 2; 3814#L432-1 [2020-11-28 03:20:57,712 INFO L796 eck$LassoCheckResult]: Loop: 3814#L432-1 assume !false; 3886#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 3786#L238 assume !false; 3913#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3914#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 4379#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4031#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 4027#L219 assume !(0 != eval_~tmp~0); 3917#L253 start_simulation_~kernel_st~0 := 2; 3918#L167-1 start_simulation_~kernel_st~0 := 3; 3773#L263-2 assume !(0 == ~M_E~0); 3774#L263-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3812#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 3840#L273-3 assume 0 == ~E_1~0;~E_1~0 := 1; 3906#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 4461#L128-9 assume !(1 == ~m_pc~0); 4460#L128-11 is_master_triggered_~__retres1~0 := 0; 4459#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 4458#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 4457#L323-9 assume !(0 != activate_threads_~tmp~1); 4456#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 4455#L147-9 assume !(1 == ~t1_pc~0); 4454#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 4453#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 4452#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 4451#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 4450#L331-11 assume !(1 == ~M_E~0); 4267#L291-3 assume !(1 == ~T1_E~0); 4449#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 4448#L301-3 assume 1 == ~E_1~0;~E_1~0 := 2; 3881#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3910#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3905#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3855#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 3856#L451 assume !(0 == start_simulation_~tmp~3); 3971#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 3939#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3901#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3849#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 3833#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 3834#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 3843#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 3813#L464 assume !(0 != start_simulation_~tmp___0~1); 3814#L432-1 [2020-11-28 03:20:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash -102429315, now seen corresponding path program 1 times [2020-11-28 03:20:57,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334656259] [2020-11-28 03:20:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:57,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334656259] [2020-11-28 03:20:57,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:57,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:57,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056333101] [2020-11-28 03:20:57,760 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:57,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1067560936, now seen corresponding path program 1 times [2020-11-28 03:20:57,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848323854] [2020-11-28 03:20:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:57,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848323854] [2020-11-28 03:20:57,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:57,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:57,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169869057] [2020-11-28 03:20:57,801 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:57,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:57,802 INFO L87 Difference]: Start difference. First operand 701 states and 976 transitions. cyclomatic complexity: 277 Second operand 4 states. [2020-11-28 03:20:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:57,880 INFO L93 Difference]: Finished difference Result 780 states and 1083 transitions. [2020-11-28 03:20:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:57,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 780 states and 1083 transitions. [2020-11-28 03:20:57,889 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 721 [2020-11-28 03:20:57,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 780 states to 780 states and 1083 transitions. [2020-11-28 03:20:57,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 780 [2020-11-28 03:20:57,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 780 [2020-11-28 03:20:57,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 780 states and 1083 transitions. [2020-11-28 03:20:57,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:57,902 INFO L691 BuchiCegarLoop]: Abstraction has 780 states and 1083 transitions. [2020-11-28 03:20:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states and 1083 transitions. [2020-11-28 03:20:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 573. [2020-11-28 03:20:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2020-11-28 03:20:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 794 transitions. [2020-11-28 03:20:57,919 INFO L714 BuchiCegarLoop]: Abstraction has 573 states and 794 transitions. [2020-11-28 03:20:57,919 INFO L594 BuchiCegarLoop]: Abstraction has 573 states and 794 transitions. [2020-11-28 03:20:57,920 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:20:57,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 794 transitions. [2020-11-28 03:20:57,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 538 [2020-11-28 03:20:57,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:57,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:57,927 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-11-28 03:20:57,927 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, 1] [2020-11-28 03:20:57,928 INFO L794 eck$LassoCheckResult]: Stem: 5412#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 5299#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5300#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 5330#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 5391#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5392#L179-1 assume !(0 == ~M_E~0); 5274#L263-1 assume !(0 == ~T1_E~0); 5275#L268-1 assume !(0 == ~E_M~0); 5373#L273-1 assume !(0 == ~E_1~0); 5382#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 5341#L128 assume !(1 == ~m_pc~0); 5292#L128-2 is_master_triggered_~__retres1~0 := 0; 5293#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5342#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5360#L323 assume !(0 != activate_threads_~tmp~1); 5361#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5331#L147 assume !(1 == ~t1_pc~0); 5319#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 5320#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5332#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5385#L331 assume !(0 != activate_threads_~tmp___0~0); 5369#L331-2 assume !(1 == ~M_E~0); 5370#L291-1 assume !(1 == ~T1_E~0); 5279#L296-1 assume !(1 == ~E_M~0); 5280#L301-1 assume !(1 == ~E_1~0); 5376#L432-1 [2020-11-28 03:20:57,928 INFO L796 eck$LassoCheckResult]: Loop: 5376#L432-1 assume !false; 5798#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5277#L238 assume !false; 5797#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5796#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5794#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5793#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 5791#L219 assume !(0 != eval_~tmp~0); 5792#L253 start_simulation_~kernel_st~0 := 2; 5829#L167-1 start_simulation_~kernel_st~0 := 3; 5828#L263-2 assume !(0 == ~M_E~0); 5827#L263-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 5826#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 5820#L273-3 assume !(0 == ~E_1~0); 5819#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 5818#L128-9 assume !(1 == ~m_pc~0); 5817#L128-11 is_master_triggered_~__retres1~0 := 0; 5816#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5815#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5814#L323-9 assume !(0 != activate_threads_~tmp~1); 5813#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5812#L147-9 assume !(1 == ~t1_pc~0); 5811#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 5810#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5809#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5806#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 5804#L331-11 assume !(1 == ~M_E~0); 5733#L291-3 assume !(1 == ~T1_E~0); 5516#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 5508#L301-3 assume !(1 == ~E_1~0); 5507#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5505#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5504#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5503#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 5413#L451 assume !(0 == start_simulation_~tmp~3); 5415#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 5807#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5805#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5803#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 5802#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 5801#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 5800#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 5799#L464 assume !(0 != start_simulation_~tmp___0~1); 5376#L432-1 [2020-11-28 03:20:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 1 times [2020-11-28 03:20:57,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834762466] [2020-11-28 03:20:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:57,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:57,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:57,995 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2056045932, now seen corresponding path program 1 times [2020-11-28 03:20:57,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:57,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377200785] [2020-11-28 03:20:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:58,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377200785] [2020-11-28 03:20:58,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:58,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:58,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843458205] [2020-11-28 03:20:58,024 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:58,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:58,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:58,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:58,026 INFO L87 Difference]: Start difference. First operand 573 states and 794 transitions. cyclomatic complexity: 223 Second operand 3 states. [2020-11-28 03:20:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:58,053 INFO L93 Difference]: Finished difference Result 703 states and 955 transitions. [2020-11-28 03:20:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:58,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 703 states and 955 transitions. [2020-11-28 03:20:58,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 652 [2020-11-28 03:20:58,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 703 states to 703 states and 955 transitions. [2020-11-28 03:20:58,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 703 [2020-11-28 03:20:58,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 703 [2020-11-28 03:20:58,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 703 states and 955 transitions. [2020-11-28 03:20:58,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:58,070 INFO L691 BuchiCegarLoop]: Abstraction has 703 states and 955 transitions. [2020-11-28 03:20:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states and 955 transitions. [2020-11-28 03:20:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2020-11-28 03:20:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2020-11-28 03:20:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 955 transitions. [2020-11-28 03:20:58,087 INFO L714 BuchiCegarLoop]: Abstraction has 703 states and 955 transitions. [2020-11-28 03:20:58,087 INFO L594 BuchiCegarLoop]: Abstraction has 703 states and 955 transitions. [2020-11-28 03:20:58,088 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:20:58,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 703 states and 955 transitions. [2020-11-28 03:20:58,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 652 [2020-11-28 03:20:58,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:58,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:58,094 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-11-28 03:20:58,094 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, 1] [2020-11-28 03:20:58,094 INFO L794 eck$LassoCheckResult]: Stem: 6693#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 6583#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 6584#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 6614#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 6674#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 6675#L179-1 assume !(0 == ~M_E~0); 6556#L263-1 assume 0 == ~T1_E~0;~T1_E~0 := 1; 6557#L268-1 assume !(0 == ~E_M~0); 6745#L273-1 assume !(0 == ~E_1~0); 6744#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 6743#L128 assume !(1 == ~m_pc~0); 6742#L128-2 is_master_triggered_~__retres1~0 := 0; 6738#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6710#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6645#L323 assume !(0 != activate_threads_~tmp~1); 6646#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6728#L147 assume !(1 == ~t1_pc~0); 6727#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 6724#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6714#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 6671#L331 assume !(0 != activate_threads_~tmp___0~0); 6654#L331-2 assume !(1 == ~M_E~0); 6655#L291-1 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6566#L296-1 assume !(1 == ~E_M~0); 6567#L301-1 assume !(1 == ~E_1~0); 6660#L432-1 [2020-11-28 03:20:58,095 INFO L796 eck$LassoCheckResult]: Loop: 6660#L432-1 assume !false; 6976#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 6973#L238 assume !false; 6972#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6971#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 6968#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6967#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 6965#L219 assume !(0 != eval_~tmp~0); 6963#L253 start_simulation_~kernel_st~0 := 2; 6962#L167-1 start_simulation_~kernel_st~0 := 3; 6961#L263-2 assume !(0 == ~M_E~0); 6959#L263-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 6960#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 7112#L273-3 assume !(0 == ~E_1~0); 7111#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 7110#L128-9 assume !(1 == ~m_pc~0); 7109#L128-11 is_master_triggered_~__retres1~0 := 0; 7108#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7107#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 7106#L323-9 assume !(0 != activate_threads_~tmp~1); 7105#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7104#L147-9 assume !(1 == ~t1_pc~0); 7101#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 7100#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 7099#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 6925#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 6768#L331-11 assume !(1 == ~M_E~0); 6765#L291-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6763#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 6755#L301-3 assume !(1 == ~E_1~0); 6754#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6751#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 6752#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7035#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 7033#L451 assume !(0 == start_simulation_~tmp~3); 7030#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 7028#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 6986#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6982#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 6981#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 6980#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 6979#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 6978#L464 assume !(0 != start_simulation_~tmp___0~1); 6660#L432-1 [2020-11-28 03:20:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1835395, now seen corresponding path program 1 times [2020-11-28 03:20:58,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118942577] [2020-11-28 03:20:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:58,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118942577] [2020-11-28 03:20:58,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:58,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:58,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248976478] [2020-11-28 03:20:58,141 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1034977578, now seen corresponding path program 1 times [2020-11-28 03:20:58,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770516345] [2020-11-28 03:20:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:58,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770516345] [2020-11-28 03:20:58,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:58,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:58,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703521855] [2020-11-28 03:20:58,180 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:58,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:58,180 INFO L87 Difference]: Start difference. First operand 703 states and 955 transitions. cyclomatic complexity: 254 Second operand 4 states. [2020-11-28 03:20:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:58,238 INFO L93 Difference]: Finished difference Result 816 states and 1120 transitions. [2020-11-28 03:20:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:58,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 816 states and 1120 transitions. [2020-11-28 03:20:58,245 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 774 [2020-11-28 03:20:58,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 816 states to 816 states and 1120 transitions. [2020-11-28 03:20:58,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 816 [2020-11-28 03:20:58,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 816 [2020-11-28 03:20:58,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 816 states and 1120 transitions. [2020-11-28 03:20:58,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:58,255 INFO L691 BuchiCegarLoop]: Abstraction has 816 states and 1120 transitions. [2020-11-28 03:20:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states and 1120 transitions. [2020-11-28 03:20:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 573. [2020-11-28 03:20:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2020-11-28 03:20:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 787 transitions. [2020-11-28 03:20:58,268 INFO L714 BuchiCegarLoop]: Abstraction has 573 states and 787 transitions. [2020-11-28 03:20:58,268 INFO L594 BuchiCegarLoop]: Abstraction has 573 states and 787 transitions. [2020-11-28 03:20:58,269 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 03:20:58,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 787 transitions. [2020-11-28 03:20:58,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 538 [2020-11-28 03:20:58,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:58,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:58,273 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-11-28 03:20:58,273 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, 1] [2020-11-28 03:20:58,273 INFO L794 eck$LassoCheckResult]: Stem: 8212#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 8112#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 8113#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 8141#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 8192#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 8193#L179-1 assume !(0 == ~M_E~0); 8087#L263-1 assume !(0 == ~T1_E~0); 8088#L268-1 assume !(0 == ~E_M~0); 8178#L273-1 assume !(0 == ~E_1~0); 8186#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 8149#L128 assume !(1 == ~m_pc~0); 8105#L128-2 is_master_triggered_~__retres1~0 := 0; 8106#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8150#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8166#L323 assume !(0 != activate_threads_~tmp~1); 8167#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8142#L147 assume !(1 == ~t1_pc~0); 8130#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 8131#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8143#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 8188#L331 assume !(0 != activate_threads_~tmp___0~0); 8175#L331-2 assume !(1 == ~M_E~0); 8176#L291-1 assume !(1 == ~T1_E~0); 8092#L296-1 assume !(1 == ~E_M~0); 8093#L301-1 assume !(1 == ~E_1~0); 8181#L432-1 [2020-11-28 03:20:58,274 INFO L796 eck$LassoCheckResult]: Loop: 8181#L432-1 assume !false; 8598#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 8594#L238 assume !false; 8592#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8590#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8587#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8585#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 8582#L219 assume !(0 != eval_~tmp~0); 8205#L253 start_simulation_~kernel_st~0 := 2; 8206#L167-1 start_simulation_~kernel_st~0 := 3; 8077#L263-2 assume !(0 == ~M_E~0); 8078#L263-4 assume !(0 == ~T1_E~0); 8118#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 8144#L273-3 assume !(0 == ~E_1~0); 8196#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 8116#L128-9 assume !(1 == ~m_pc~0); 8117#L128-11 is_master_triggered_~__retres1~0 := 0; 8600#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8599#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8595#L323-9 assume !(0 != activate_threads_~tmp~1); 8593#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8591#L147-9 assume !(1 == ~t1_pc~0); 8588#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 8586#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8584#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 8581#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 8580#L331-11 assume !(1 == ~M_E~0); 8232#L291-3 assume !(1 == ~T1_E~0); 8079#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 8080#L301-3 assume !(1 == ~E_1~0); 8177#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8199#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8195#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8251#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 8213#L451 assume !(0 == start_simulation_~tmp~3); 8215#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 8609#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8608#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8607#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 8606#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 8603#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 8602#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 8601#L464 assume !(0 != start_simulation_~tmp___0~1); 8181#L432-1 [2020-11-28 03:20:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 2 times [2020-11-28 03:20:58,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707949731] [2020-11-28 03:20:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1781286318, now seen corresponding path program 1 times [2020-11-28 03:20:58,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751629006] [2020-11-28 03:20:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:58,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751629006] [2020-11-28 03:20:58,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:58,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:58,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639711317] [2020-11-28 03:20:58,364 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:58,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:20:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:58,365 INFO L87 Difference]: Start difference. First operand 573 states and 787 transitions. cyclomatic complexity: 216 Second operand 5 states. [2020-11-28 03:20:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:58,479 INFO L93 Difference]: Finished difference Result 977 states and 1326 transitions. [2020-11-28 03:20:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:20:58,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 977 states and 1326 transitions. [2020-11-28 03:20:58,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 932 [2020-11-28 03:20:58,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 977 states to 977 states and 1326 transitions. [2020-11-28 03:20:58,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 977 [2020-11-28 03:20:58,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 977 [2020-11-28 03:20:58,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 1326 transitions. [2020-11-28 03:20:58,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:58,499 INFO L691 BuchiCegarLoop]: Abstraction has 977 states and 1326 transitions. [2020-11-28 03:20:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 1326 transitions. [2020-11-28 03:20:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 591. [2020-11-28 03:20:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-11-28 03:20:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 805 transitions. [2020-11-28 03:20:58,514 INFO L714 BuchiCegarLoop]: Abstraction has 591 states and 805 transitions. [2020-11-28 03:20:58,514 INFO L594 BuchiCegarLoop]: Abstraction has 591 states and 805 transitions. [2020-11-28 03:20:58,514 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-28 03:20:58,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 591 states and 805 transitions. [2020-11-28 03:20:58,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 556 [2020-11-28 03:20:58,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:58,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:58,519 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-11-28 03:20:58,519 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, 1, 1] [2020-11-28 03:20:58,520 INFO L794 eck$LassoCheckResult]: Stem: 9790#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 9677#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 9678#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 9706#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 9764#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 9765#L179-1 assume !(0 == ~M_E~0); 9652#L263-1 assume !(0 == ~T1_E~0); 9653#L268-1 assume !(0 == ~E_M~0); 9748#L273-1 assume !(0 == ~E_1~0); 9756#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 9716#L128 assume !(1 == ~m_pc~0); 9670#L128-2 is_master_triggered_~__retres1~0 := 0; 9671#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9717#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 9736#L323 assume !(0 != activate_threads_~tmp~1); 9737#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9707#L147 assume !(1 == ~t1_pc~0); 9695#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 9696#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9708#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 9759#L331 assume !(0 != activate_threads_~tmp___0~0); 9744#L331-2 assume !(1 == ~M_E~0); 9745#L291-1 assume !(1 == ~T1_E~0); 9657#L296-1 assume !(1 == ~E_M~0); 9658#L301-1 assume !(1 == ~E_1~0); 9684#L432-1 [2020-11-28 03:20:58,520 INFO L796 eck$LassoCheckResult]: Loop: 9684#L432-1 assume !false; 9791#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 9655#L238 assume !false; 9777#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9778#L192 assume !(0 == ~m_st~0); 9770#L196 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 9772#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10101#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 10102#L219 assume !(0 != eval_~tmp~0); 9781#L253 start_simulation_~kernel_st~0 := 2; 9782#L167-1 start_simulation_~kernel_st~0 := 3; 9643#L263-2 assume !(0 == ~M_E~0); 9644#L263-4 assume !(0 == ~T1_E~0); 9682#L268-3 assume 0 == ~E_M~0;~E_M~0 := 1; 9768#L273-3 assume !(0 == ~E_1~0); 9769#L278-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 10198#L128-9 assume !(1 == ~m_pc~0); 10197#L128-11 is_master_triggered_~__retres1~0 := 0; 9664#L139-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9665#L140-3 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 10196#L323-9 assume !(0 != activate_threads_~tmp~1); 10195#L323-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9712#L147-9 assume !(1 == ~t1_pc~0); 9713#L147-11 is_transmit1_triggered_~__retres1~1 := 0; 10194#L158-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9799#L159-3 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 9739#L331-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 9740#L331-11 assume !(1 == ~M_E~0); 9742#L291-3 assume !(1 == ~T1_E~0); 9816#L296-3 assume 1 == ~E_M~0;~E_M~0 := 2; 9746#L301-3 assume !(1 == ~E_1~0); 9747#L306-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9815#L192-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9767#L204-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9726#L205-1 start_simulation_#t~ret15 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 9727#L451 assume !(0 == start_simulation_~tmp~3); 9793#L451-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret14, 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; 9798#L192-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10219#L204-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10218#L205-2 stop_simulation_#t~ret14 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret14;havoc stop_simulation_#t~ret14; 9704#L406 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 9705#L413 stop_simulation_#res := stop_simulation_~__retres2~0; 9715#L414 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 9683#L464 assume !(0 != start_simulation_~tmp___0~1); 9684#L432-1 [2020-11-28 03:20:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 3 times [2020-11-28 03:20:58,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135953611] [2020-11-28 03:20:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,553 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash 821667381, now seen corresponding path program 1 times [2020-11-28 03:20:58,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113988231] [2020-11-28 03:20:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:58,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113988231] [2020-11-28 03:20:58,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:58,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:58,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003240734] [2020-11-28 03:20:58,585 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:20:58,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:58,586 INFO L87 Difference]: Start difference. First operand 591 states and 805 transitions. cyclomatic complexity: 216 Second operand 3 states. [2020-11-28 03:20:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:58,628 INFO L93 Difference]: Finished difference Result 859 states and 1142 transitions. [2020-11-28 03:20:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:58,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 1142 transitions. [2020-11-28 03:20:58,635 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 827 [2020-11-28 03:20:58,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 859 states and 1142 transitions. [2020-11-28 03:20:58,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 859 [2020-11-28 03:20:58,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 859 [2020-11-28 03:20:58,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 859 states and 1142 transitions. [2020-11-28 03:20:58,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:58,646 INFO L691 BuchiCegarLoop]: Abstraction has 859 states and 1142 transitions. [2020-11-28 03:20:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states and 1142 transitions. [2020-11-28 03:20:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 829. [2020-11-28 03:20:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2020-11-28 03:20:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1104 transitions. [2020-11-28 03:20:58,662 INFO L714 BuchiCegarLoop]: Abstraction has 829 states and 1104 transitions. [2020-11-28 03:20:58,663 INFO L594 BuchiCegarLoop]: Abstraction has 829 states and 1104 transitions. [2020-11-28 03:20:58,663 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-28 03:20:58,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 829 states and 1104 transitions. [2020-11-28 03:20:58,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 797 [2020-11-28 03:20:58,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:58,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:58,669 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, 1, 1] [2020-11-28 03:20:58,669 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:58,669 INFO L794 eck$LassoCheckResult]: Stem: 11252#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 11133#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 11134#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 11164#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 11225#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 11226#L179-1 assume !(0 == ~M_E~0); 11107#L263-1 assume !(0 == ~T1_E~0); 11108#L268-1 assume !(0 == ~E_M~0); 11209#L273-1 assume !(0 == ~E_1~0); 11218#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 11175#L128 assume !(1 == ~m_pc~0); 11126#L128-2 is_master_triggered_~__retres1~0 := 0; 11127#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 11176#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 11196#L323 assume !(0 != activate_threads_~tmp~1); 11197#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 11165#L147 assume !(1 == ~t1_pc~0); 11153#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 11154#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 11166#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 11221#L331 assume !(0 != activate_threads_~tmp___0~0); 11206#L331-2 assume !(1 == ~M_E~0); 11207#L291-1 assume !(1 == ~T1_E~0); 11112#L296-1 assume !(1 == ~E_M~0); 11113#L301-1 assume !(1 == ~E_1~0); 11212#L432-1 assume !false; 11853#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 11850#L238 [2020-11-28 03:20:58,669 INFO L796 eck$LassoCheckResult]: Loop: 11850#L238 assume !false; 11849#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11848#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11843#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11844#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 11737#L219 assume 0 != eval_~tmp~0; 11738#L219-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 11732#L227 assume !(0 != eval_~tmp_ndt_1~0); 11734#L224 assume !(0 == ~t1_st~0); 11850#L238 [2020-11-28 03:20:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 1 times [2020-11-28 03:20:58,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674953594] [2020-11-28 03:20:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1331440437, now seen corresponding path program 1 times [2020-11-28 03:20:58,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761907004] [2020-11-28 03:20:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,711 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:58,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:58,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:58,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,721 INFO L82 PathProgramCache]: Analyzing trace with hash 610964041, now seen corresponding path program 1 times [2020-11-28 03:20:58,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823344542] [2020-11-28 03:20:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:58,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823344542] [2020-11-28 03:20:58,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:58,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:58,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921790779] [2020-11-28 03:20:58,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:58,848 INFO L87 Difference]: Start difference. First operand 829 states and 1104 transitions. cyclomatic complexity: 278 Second operand 3 states. [2020-11-28 03:20:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:58,905 INFO L93 Difference]: Finished difference Result 1370 states and 1806 transitions. [2020-11-28 03:20:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:58,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1370 states and 1806 transitions. [2020-11-28 03:20:58,938 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1250 [2020-11-28 03:20:58,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1370 states to 1370 states and 1806 transitions. [2020-11-28 03:20:58,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1370 [2020-11-28 03:20:58,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1370 [2020-11-28 03:20:58,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1370 states and 1806 transitions. [2020-11-28 03:20:58,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:58,953 INFO L691 BuchiCegarLoop]: Abstraction has 1370 states and 1806 transitions. [2020-11-28 03:20:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states and 1806 transitions. [2020-11-28 03:20:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1299. [2020-11-28 03:20:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-11-28 03:20:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1725 transitions. [2020-11-28 03:20:58,980 INFO L714 BuchiCegarLoop]: Abstraction has 1299 states and 1725 transitions. [2020-11-28 03:20:58,980 INFO L594 BuchiCegarLoop]: Abstraction has 1299 states and 1725 transitions. [2020-11-28 03:20:58,980 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-28 03:20:58,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1299 states and 1725 transitions. [2020-11-28 03:20:58,988 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1218 [2020-11-28 03:20:58,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:58,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:58,988 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, 1, 1] [2020-11-28 03:20:58,989 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:58,989 INFO L794 eck$LassoCheckResult]: Stem: 13468#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 13339#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 13340#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 13369#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 13442#L174-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 13443#L179-1 assume !(0 == ~M_E~0); 13451#L263-1 assume !(0 == ~T1_E~0); 13424#L268-1 assume !(0 == ~E_M~0); 13425#L273-1 assume !(0 == ~E_1~0); 13466#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 13467#L128 assume !(1 == ~m_pc~0); 13332#L128-2 is_master_triggered_~__retres1~0 := 0; 13333#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13488#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 13489#L323 assume !(0 != activate_threads_~tmp~1); 13413#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13414#L147 assume !(1 == ~t1_pc~0); 13358#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 13359#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13495#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 13496#L331 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 13439#L331-2 assume !(1 == ~M_E~0); 13498#L291-1 assume !(1 == ~T1_E~0); 13499#L296-1 assume !(1 == ~E_M~0); 13426#L301-1 assume !(1 == ~E_1~0); 13427#L432-1 assume !false; 14554#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 14339#L238 [2020-11-28 03:20:58,989 INFO L796 eck$LassoCheckResult]: Loop: 14339#L238 assume !false; 14551#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 14549#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 14547#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 14545#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 14543#L219 assume 0 != eval_~tmp~0; 14542#L219-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 13399#L227 assume !(0 != eval_~tmp_ndt_1~0); 13401#L224 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet11;havoc eval_#t~nondet11; 13630#L241 assume !(0 != eval_~tmp_ndt_2~0); 14339#L238 [2020-11-28 03:20:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash -624740157, now seen corresponding path program 1 times [2020-11-28 03:20:58,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:58,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40285380] [2020-11-28 03:20:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:59,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40285380] [2020-11-28 03:20:59,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:59,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:59,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909300103] [2020-11-28 03:20:59,014 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1675017211, now seen corresponding path program 1 times [2020-11-28 03:20:59,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:59,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799477180] [2020-11-28 03:20:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,022 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:59,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:59,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:59,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:59,098 INFO L87 Difference]: Start difference. First operand 1299 states and 1725 transitions. cyclomatic complexity: 430 Second operand 3 states. [2020-11-28 03:20:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:59,110 INFO L93 Difference]: Finished difference Result 1126 states and 1505 transitions. [2020-11-28 03:20:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:59,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1126 states and 1505 transitions. [2020-11-28 03:20:59,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1094 [2020-11-28 03:20:59,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1126 states to 1126 states and 1505 transitions. [2020-11-28 03:20:59,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1126 [2020-11-28 03:20:59,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1126 [2020-11-28 03:20:59,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1126 states and 1505 transitions. [2020-11-28 03:20:59,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:59,131 INFO L691 BuchiCegarLoop]: Abstraction has 1126 states and 1505 transitions. [2020-11-28 03:20:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states and 1505 transitions. [2020-11-28 03:20:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2020-11-28 03:20:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2020-11-28 03:20:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1505 transitions. [2020-11-28 03:20:59,152 INFO L714 BuchiCegarLoop]: Abstraction has 1126 states and 1505 transitions. [2020-11-28 03:20:59,152 INFO L594 BuchiCegarLoop]: Abstraction has 1126 states and 1505 transitions. [2020-11-28 03:20:59,153 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-28 03:20:59,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1126 states and 1505 transitions. [2020-11-28 03:20:59,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1094 [2020-11-28 03:20:59,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:59,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:59,160 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, 1, 1] [2020-11-28 03:20:59,160 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:59,160 INFO L794 eck$LassoCheckResult]: Stem: 15898#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(22);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_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 15772#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 15773#L395 havoc start_simulation_#t~ret15, start_simulation_#t~ret16, 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; 15807#L167 assume 1 == ~m_i~0;~m_st~0 := 0; 15872#L174-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 15873#L179-1 assume !(0 == ~M_E~0); 15746#L263-1 assume !(0 == ~T1_E~0); 15747#L268-1 assume !(0 == ~E_M~0); 15854#L273-1 assume !(0 == ~E_1~0); 15863#L278-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, 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; 15819#L128 assume !(1 == ~m_pc~0); 15765#L128-2 is_master_triggered_~__retres1~0 := 0; 15766#L139 is_master_triggered_#res := is_master_triggered_~__retres1~0; 15820#L140 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 15841#L323 assume !(0 != activate_threads_~tmp~1); 15842#L323-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 15808#L147 assume !(1 == ~t1_pc~0); 15794#L147-2 is_transmit1_triggered_~__retres1~1 := 0; 15795#L158 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 15809#L159 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 15866#L331 assume !(0 != activate_threads_~tmp___0~0); 15851#L331-2 assume !(1 == ~M_E~0); 15852#L291-1 assume !(1 == ~T1_E~0); 15751#L296-1 assume !(1 == ~E_M~0); 15752#L301-1 assume !(1 == ~E_1~0); 15857#L432-1 assume !false; 16236#L433 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret9, eval_#t~nondet10, eval_~tmp_ndt_1~0, eval_#t~nondet11, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 16233#L238 [2020-11-28 03:20:59,160 INFO L796 eck$LassoCheckResult]: Loop: 16233#L238 assume !false; 16232#L215 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16230#L192 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 16229#L204 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16228#L205 eval_#t~ret9 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret9;havoc eval_#t~ret9; 16225#L219 assume 0 != eval_~tmp~0; 16224#L219-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 16217#L227 assume !(0 != eval_~tmp_ndt_1~0); 16218#L224 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet11;havoc eval_#t~nondet11; 16235#L241 assume !(0 != eval_~tmp_ndt_2~0); 16233#L238 [2020-11-28 03:20:59,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:59,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 2 times [2020-11-28 03:20:59,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:59,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239069793] [2020-11-28 03:20:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1675017211, now seen corresponding path program 2 times [2020-11-28 03:20:59,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:59,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519927185] [2020-11-28 03:20:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,186 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1760013885, now seen corresponding path program 1 times [2020-11-28 03:20:59,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:59,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576021576] [2020-11-28 03:20:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:59,200 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:59,207 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:21:00,101 WARN L193 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2020-11-28 03:21:00,322 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-28 03:21:00,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:21:00 BoogieIcfgContainer [2020-11-28 03:21:00,365 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:21:00,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:21:00,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:21:00,368 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:21:00,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:55" (3/4) ... [2020-11-28 03:21:00,371 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:21:00,430 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_95500b6b-a05c-46d3-816a-0599c7ca4095/bin/uautomizer/witness.graphml [2020-11-28 03:21:00,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:21:00,432 INFO L168 Benchmark]: Toolchain (without parser) took 6210.19 ms. Allocated memory was 86.0 MB in the beginning and 159.4 MB in the end (delta: 73.4 MB). Free memory was 56.3 MB in the beginning and 102.8 MB in the end (delta: -46.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:00,432 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 86.0 MB. Free memory was 42.6 MB in the beginning and 42.5 MB in the end (delta: 34.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:21:00,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.49 ms. Allocated memory is still 86.0 MB. Free memory was 56.1 MB in the beginning and 61.1 MB in the end (delta: -5.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:00,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.34 ms. Allocated memory is still 86.0 MB. Free memory was 61.1 MB in the beginning and 58.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:00,433 INFO L168 Benchmark]: Boogie Preprocessor took 77.65 ms. Allocated memory is still 86.0 MB. Free memory was 58.6 MB in the beginning and 56.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:00,433 INFO L168 Benchmark]: RCFGBuilder took 1031.35 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 56.5 MB in the beginning and 68.3 MB in the end (delta: -11.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:00,434 INFO L168 Benchmark]: BuchiAutomizer took 4525.31 ms. Allocated memory was 104.9 MB in the beginning and 159.4 MB in the end (delta: 54.5 MB). Free memory was 68.3 MB in the beginning and 105.9 MB in the end (delta: -37.6 MB). Peak memory consumption was 59.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:00,434 INFO L168 Benchmark]: Witness Printer took 63.15 ms. Allocated memory is still 159.4 MB. Free memory was 105.9 MB in the beginning and 102.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:21:00,436 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.76 ms. Allocated memory is still 86.0 MB. Free memory was 42.6 MB in the beginning and 42.5 MB in the end (delta: 34.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 400.49 ms. Allocated memory is still 86.0 MB. Free memory was 56.1 MB in the beginning and 61.1 MB in the end (delta: -5.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.34 ms. Allocated memory is still 86.0 MB. Free memory was 61.1 MB in the beginning and 58.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.65 ms. Allocated memory is still 86.0 MB. Free memory was 58.6 MB in the beginning and 56.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1031.35 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 56.5 MB in the beginning and 68.3 MB in the end (delta: -11.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4525.31 ms. Allocated memory was 104.9 MB in the beginning and 159.4 MB in the end (delta: 54.5 MB). Free memory was 68.3 MB in the beginning and 105.9 MB in the end (delta: -37.6 MB). Peak memory consumption was 59.9 MB. Max. memory is 16.1 GB. * Witness Printer took 63.15 ms. Allocated memory is still 159.4 MB. Free memory was 105.9 MB in the beginning and 102.8 MB in the end (delta: 3.1 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 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1126 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.5s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1370 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1299 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2782 SDtfs, 3226 SDslu, 2919 SDs, 0 SdLazy, 356 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI7 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: 214]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7362} State at position 1 is {NULL=7365, NULL=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5896a833=0, token=0, __retres1=0, NULL=7362, tmp=1, \result=0, kernel_st=1, __retres1=0, tmp___0=0, t1_pc=0, __retres1=1, T1_E=2, NULL=7364, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ee374ee=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d400c70=0, E_1=2, NULL=0, tmp_ndt_1=0, NULL=0, NULL=0, M_E=2, tmp_ndt_2=0, tmp=0, NULL=7363, m_i=1, t1_st=0, local=0, m_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ae0d3af=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13f63fa=0, E_M=2, NULL=0, tmp___0=0, tmp=0, __retres1=0, t1_i=1, m_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12415e61=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ffd7516=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 214]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 [L174] COND TRUE m_i == 1 [L175] m_st = 0 [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 [L263] COND FALSE !(M_E == 0) [L268] COND FALSE !(T1_E == 0) [L273] COND FALSE !(E_M == 0) [L278] COND FALSE !(E_1 == 0) [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; [L128] COND FALSE !(m_pc == 1) [L138] __retres1 = 0 [L140] return (__retres1); [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) [L144] int __retres1 ; [L147] COND FALSE !(t1_pc == 1) [L157] __retres1 = 0 [L159] return (__retres1); [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) [L291] COND FALSE !(M_E == 1) [L296] COND FALSE !(T1_E == 1) [L301] COND FALSE !(E_M == 1) [L306] COND FALSE !(E_1 == 1) [L432] COND TRUE 1 [L435] kernel_st = 1 [L210] int tmp ; Loop: [L214] COND TRUE 1 [L189] int __retres1 ; [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 [L205] return (__retres1); [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...