./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6325feb12f40756470caf3b12878fd0ec9ad6f61 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:02:25,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:02:25,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:02:25,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:02:25,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:02:25,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:02:25,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:02:25,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:02:25,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:02:25,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:02:25,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:02:25,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:02:25,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:02:25,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:02:25,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:02:25,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:02:25,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:02:25,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:02:25,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:02:25,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:02:25,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:02:25,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:02:25,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:02:25,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:02:25,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:02:25,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:02:25,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:02:25,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:02:25,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:02:25,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:02:25,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:02:25,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:02:25,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:02:25,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:02:25,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:02:25,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:02:25,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:02:25,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:02:25,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:02:25,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:02:25,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:02:25,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:02:26,017 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:02:26,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:02:26,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:02:26,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:02:26,019 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:02:26,019 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:02:26,019 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:02:26,019 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:02:26,020 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:02:26,020 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:02:26,020 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:02:26,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:02:26,020 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:02:26,021 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:02:26,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:02:26,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:02:26,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:02:26,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:02:26,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:02:26,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:02:26,024 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:02:26,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:02:26,024 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:02:26,025 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:02:26,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:02:26,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:02:26,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:02:26,025 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:02:26,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:02:26,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:02:26,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:02:26,027 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:02:26,028 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:02:26,028 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6325feb12f40756470caf3b12878fd0ec9ad6f61 [2020-10-20 08:02:26,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:02:26,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:02:26,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:02:26,247 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:02:26,247 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:02:26,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-10-20 08:02:26,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1feb6723/74f6cf8ca260470d808d2711ce4d4b36/FLAG9ea0b124d [2020-10-20 08:02:26,781 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:02:26,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-10-20 08:02:26,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1feb6723/74f6cf8ca260470d808d2711ce4d4b36/FLAG9ea0b124d [2020-10-20 08:02:27,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1feb6723/74f6cf8ca260470d808d2711ce4d4b36 [2020-10-20 08:02:27,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:02:27,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:02:27,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:02:27,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:02:27,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:02:27,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3104e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27, skipping insertion in model container [2020-10-20 08:02:27,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:02:27,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:02:27,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:02:27,670 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:02:27,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:02:27,732 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:02:27,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27 WrapperNode [2020-10-20 08:02:27,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:02:27,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:02:27,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:02:27,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:02:27,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:02:27,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:02:27,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:02:27,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:02:27,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... [2020-10-20 08:02:27,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:02:27,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:02:27,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:02:27,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:02:27,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:02:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:02:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:02:27,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:02:28,591 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:02:28,592 INFO L298 CfgBuilder]: Removed 82 assume(true) statements. [2020-10-20 08:02:28,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:28 BoogieIcfgContainer [2020-10-20 08:02:28,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:02:28,596 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:02:28,596 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:02:28,600 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:02:28,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:28,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:02:27" (1/3) ... [2020-10-20 08:02:28,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d25606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:02:28, skipping insertion in model container [2020-10-20 08:02:28,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:28,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:27" (2/3) ... [2020-10-20 08:02:28,603 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d25606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:02:28, skipping insertion in model container [2020-10-20 08:02:28,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:28,604 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:28" (3/3) ... [2020-10-20 08:02:28,606 INFO L373 chiAutomizerObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-10-20 08:02:28,655 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:02:28,656 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:02:28,656 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:02:28,656 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:02:28,657 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:02:28,657 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:02:28,657 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:02:28,657 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:02:28,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states. [2020-10-20 08:02:28,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2020-10-20 08:02:28,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:28,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:28,729 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:28,729 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-10-20 08:02:28,730 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:02:28,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states. [2020-10-20 08:02:28,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2020-10-20 08:02:28,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:28,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:28,741 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:28,742 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-10-20 08:02:28,749 INFO L794 eck$LassoCheckResult]: Stem: 119#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; 14#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 88#L383true havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 39#L155true assume !(1 == ~m_i~0);~m_st~0 := 2; 130#L162-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 137#L167-1true assume !(0 == ~M_E~0); 49#L251-1true assume !(0 == ~T1_E~0); 118#L256-1true assume !(0 == ~E_M~0); 135#L261-1true assume !(0 == ~E_1~0); 139#L266-1true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 64#L116true assume !(1 == ~m_pc~0); 58#L116-2true is_master_triggered_~__retres1~0 := 0; 90#L127true is_master_triggered_#res := is_master_triggered_~__retres1~0; 35#L128true activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 114#L311true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 117#L311-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 81#L135true assume 1 == ~t1_pc~0; 28#L136true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 83#L146true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 29#L147true activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 127#L319true assume !(0 != activate_threads_~tmp___0~0); 121#L319-2true assume !(1 == ~M_E~0); 44#L279-1true assume !(1 == ~T1_E~0); 51#L284-1true assume !(1 == ~E_M~0); 120#L289-1true assume 1 == ~E_1~0;~E_1~0 := 2; 3#L420-1true [2020-10-20 08:02:28,750 INFO L796 eck$LassoCheckResult]: Loop: 3#L420-1true assume !false; 123#L421true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 103#L226true assume false; 4#L241true start_simulation_~kernel_st~0 := 2; 37#L155-1true start_simulation_~kernel_st~0 := 3; 71#L251-2true assume !(0 == ~M_E~0); 68#L251-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 84#L256-3true assume 0 == ~E_M~0;~E_M~0 := 1; 132#L261-3true assume 0 == ~E_1~0;~E_1~0 := 1; 138#L266-3true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 66#L116-9true assume 1 == ~m_pc~0; 7#L117-3true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 55#L127-3true is_master_triggered_#res := is_master_triggered_~__retres1~0; 8#L128-3true activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 77#L311-9true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 82#L311-11true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 63#L135-9true assume 1 == ~t1_pc~0; 17#L136-3true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 74#L146-3true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 19#L147-3true activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 116#L319-9true assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 92#L319-11true assume 1 == ~M_E~0;~M_E~0 := 2; 32#L279-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 72#L284-3true assume 1 == ~E_M~0;~E_M~0 := 2; 86#L289-3true assume 1 == ~E_1~0;~E_1~0 := 2; 134#L294-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 30#L180-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 140#L192-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 95#L193-1true start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 23#L439true assume !(0 == start_simulation_~tmp~3); 27#L439-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 26#L180-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 126#L192-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 94#L193-2true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 87#L394true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 143#L401true stop_simulation_#res := stop_simulation_~__retres2~0; 100#L402true start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 48#L452true assume !(0 != start_simulation_~tmp___0~1); 3#L420-1true [2020-10-20 08:02:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash 22332154, now seen corresponding path program 1 times [2020-10-20 08:02:28,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:28,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732569648] [2020-10-20 08:02:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:28,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732569648] [2020-10-20 08:02:28,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:28,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:28,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997105811] [2020-10-20 08:02:28,939 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1684926067, now seen corresponding path program 1 times [2020-10-20 08:02:28,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:28,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079484073] [2020-10-20 08:02:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:28,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079484073] [2020-10-20 08:02:28,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:28,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:28,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107116244] [2020-10-20 08:02:28,964 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:28,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:28,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:28,984 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2020-10-20 08:02:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:29,018 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2020-10-20 08:02:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:29,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 208 transitions. [2020-10-20 08:02:29,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2020-10-20 08:02:29,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 135 states and 203 transitions. [2020-10-20 08:02:29,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2020-10-20 08:02:29,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2020-10-20 08:02:29,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 203 transitions. [2020-10-20 08:02:29,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:29,037 INFO L691 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2020-10-20 08:02:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 203 transitions. [2020-10-20 08:02:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-20 08:02:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-20 08:02:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2020-10-20 08:02:29,086 INFO L714 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2020-10-20 08:02:29,086 INFO L594 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2020-10-20 08:02:29,086 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:02:29,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 203 transitions. [2020-10-20 08:02:29,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2020-10-20 08:02:29,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:29,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:29,101 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:29,101 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-10-20 08:02:29,101 INFO L794 eck$LassoCheckResult]: Stem: 418#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; 316#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 317#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 371#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 372#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 422#L167-1 assume !(0 == ~M_E~0); 378#L251-1 assume !(0 == ~T1_E~0); 379#L256-1 assume !(0 == ~E_M~0); 417#L261-1 assume !(0 == ~E_1~0); 424#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 388#L116 assume !(1 == ~m_pc~0); 363#L116-2 is_master_triggered_~__retres1~0 := 0; 362#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 364#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 365#L311 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 416#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 397#L135 assume 1 == ~t1_pc~0; 346#L136 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 347#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 349#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 350#L319 assume !(0 != activate_threads_~tmp___0~0); 419#L319-2 assume !(1 == ~M_E~0); 373#L279-1 assume !(1 == ~T1_E~0); 374#L284-1 assume !(1 == ~E_M~0); 383#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 290#L420-1 [2020-10-20 08:02:29,102 INFO L796 eck$LassoCheckResult]: Loop: 290#L420-1 assume !false; 291#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 337#L226 assume !false; 413#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 354#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 355#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 408#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 376#L207 assume !(0 != eval_~tmp~0); 295#L241 start_simulation_~kernel_st~0 := 2; 296#L155-1 start_simulation_~kernel_st~0 := 3; 370#L251-2 assume !(0 == ~M_E~0); 391#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 392#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 398#L261-3 assume 0 == ~E_1~0;~E_1~0 := 1; 423#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 390#L116-9 assume 1 == ~m_pc~0; 299#L117-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 300#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 302#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 303#L311-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 396#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 387#L135-9 assume 1 == ~t1_pc~0; 322#L136-3 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 323#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 327#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 328#L319-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 404#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 357#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 358#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 395#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 399#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 352#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 405#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 334#L439 assume !(0 == start_simulation_~tmp~3); 319#L439-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 341#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 343#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 402#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 400#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 401#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 407#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 375#L452 assume !(0 != start_simulation_~tmp___0~1); 290#L420-1 [2020-10-20 08:02:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash -196522564, now seen corresponding path program 1 times [2020-10-20 08:02:29,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270763383] [2020-10-20 08:02:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270763383] [2020-10-20 08:02:29,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:29,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946309127] [2020-10-20 08:02:29,175 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash -685367684, now seen corresponding path program 1 times [2020-10-20 08:02:29,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529659587] [2020-10-20 08:02:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529659587] [2020-10-20 08:02:29,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:29,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91882113] [2020-10-20 08:02:29,230 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:29,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:29,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:29,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:29,231 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. cyclomatic complexity: 69 Second operand 5 states. [2020-10-20 08:02:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:29,434 INFO L93 Difference]: Finished difference Result 340 states and 504 transitions. [2020-10-20 08:02:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:02:29,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 504 transitions. [2020-10-20 08:02:29,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2020-10-20 08:02:29,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 504 transitions. [2020-10-20 08:02:29,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2020-10-20 08:02:29,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2020-10-20 08:02:29,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 504 transitions. [2020-10-20 08:02:29,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:29,448 INFO L691 BuchiCegarLoop]: Abstraction has 340 states and 504 transitions. [2020-10-20 08:02:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 504 transitions. [2020-10-20 08:02:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 150. [2020-10-20 08:02:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-20 08:02:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2020-10-20 08:02:29,465 INFO L714 BuchiCegarLoop]: Abstraction has 150 states and 218 transitions. [2020-10-20 08:02:29,465 INFO L594 BuchiCegarLoop]: Abstraction has 150 states and 218 transitions. [2020-10-20 08:02:29,465 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:02:29,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 218 transitions. [2020-10-20 08:02:29,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2020-10-20 08:02:29,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:29,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:29,472 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:29,472 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-10-20 08:02:29,473 INFO L794 eck$LassoCheckResult]: Stem: 923#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; 806#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 807#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 861#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 862#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 927#L167-1 assume !(0 == ~M_E~0); 871#L251-1 assume !(0 == ~T1_E~0); 872#L256-1 assume !(0 == ~E_M~0); 922#L261-1 assume !(0 == ~E_1~0); 929#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 887#L116 assume !(1 == ~m_pc~0); 853#L116-2 is_master_triggered_~__retres1~0 := 0; 880#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 907#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 920#L311 assume !(0 != activate_threads_~tmp~1); 921#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 897#L135 assume 1 == ~t1_pc~0; 836#L136 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 837#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 842#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 843#L319 assume !(0 != activate_threads_~tmp___0~0); 924#L319-2 assume !(1 == ~M_E~0); 865#L279-1 assume !(1 == ~T1_E~0); 866#L284-1 assume !(1 == ~E_M~0); 877#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 780#L420-1 [2020-10-20 08:02:29,473 INFO L796 eck$LassoCheckResult]: Loop: 780#L420-1 assume !false; 781#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 825#L226 assume !false; 918#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 846#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 847#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 910#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 867#L207 assume !(0 != eval_~tmp~0); 782#L241 start_simulation_~kernel_st~0 := 2; 783#L155-1 start_simulation_~kernel_st~0 := 3; 859#L251-2 assume !(0 == ~M_E~0); 890#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 891#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 898#L261-3 assume 0 == ~E_1~0;~E_1~0 := 1; 928#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 889#L116-9 assume 1 == ~m_pc~0; 789#L117-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 790#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 792#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 793#L311-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 896#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 886#L135-9 assume 1 == ~t1_pc~0; 812#L136-3 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 813#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 817#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 818#L319-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 905#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 844#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 845#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 894#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 900#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 839#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 840#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 908#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 826#L439 assume !(0 == start_simulation_~tmp~3); 809#L439-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 833#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 835#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 906#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 901#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 902#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 913#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 870#L452 assume !(0 != start_simulation_~tmp___0~1); 780#L420-1 [2020-10-20 08:02:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,474 INFO L82 PathProgramCache]: Analyzing trace with hash 504542014, now seen corresponding path program 1 times [2020-10-20 08:02:29,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434644904] [2020-10-20 08:02:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434644904] [2020-10-20 08:02:29,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:29,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964964021] [2020-10-20 08:02:29,582 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash -685367684, now seen corresponding path program 2 times [2020-10-20 08:02:29,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201553696] [2020-10-20 08:02:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201553696] [2020-10-20 08:02:29,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:29,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714491501] [2020-10-20 08:02:29,674 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:29,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:29,677 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. cyclomatic complexity: 69 Second operand 4 states. [2020-10-20 08:02:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:29,829 INFO L93 Difference]: Finished difference Result 335 states and 469 transitions. [2020-10-20 08:02:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:02:29,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 469 transitions. [2020-10-20 08:02:29,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 290 [2020-10-20 08:02:29,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 335 states and 469 transitions. [2020-10-20 08:02:29,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2020-10-20 08:02:29,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2020-10-20 08:02:29,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 469 transitions. [2020-10-20 08:02:29,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:29,840 INFO L691 BuchiCegarLoop]: Abstraction has 335 states and 469 transitions. [2020-10-20 08:02:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 469 transitions. [2020-10-20 08:02:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 313. [2020-10-20 08:02:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-20 08:02:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 444 transitions. [2020-10-20 08:02:29,855 INFO L714 BuchiCegarLoop]: Abstraction has 313 states and 444 transitions. [2020-10-20 08:02:29,855 INFO L594 BuchiCegarLoop]: Abstraction has 313 states and 444 transitions. [2020-10-20 08:02:29,855 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:02:29,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 444 transitions. [2020-10-20 08:02:29,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 283 [2020-10-20 08:02:29,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:29,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:29,860 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:29,860 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-10-20 08:02:29,860 INFO L794 eck$LassoCheckResult]: Stem: 1425#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; 1303#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1304#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 1352#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 1353#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1431#L167-1 assume !(0 == ~M_E~0); 1365#L251-1 assume !(0 == ~T1_E~0); 1366#L256-1 assume !(0 == ~E_M~0); 1424#L261-1 assume !(0 == ~E_1~0); 1433#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 1382#L116 assume !(1 == ~m_pc~0); 1377#L116-2 is_master_triggered_~__retres1~0 := 0; 1378#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1345#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1346#L311 assume !(0 != activate_threads_~tmp~1); 1423#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1399#L135 assume !(1 == ~t1_pc~0); 1395#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 1396#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1336#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1337#L319 assume !(0 != activate_threads_~tmp___0~0); 1426#L319-2 assume !(1 == ~M_E~0); 1357#L279-1 assume !(1 == ~T1_E~0); 1358#L284-1 assume !(1 == ~E_M~0); 1372#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 1364#L420-1 [2020-10-20 08:02:29,861 INFO L796 eck$LassoCheckResult]: Loop: 1364#L420-1 assume !false; 1428#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1368#L226 assume !false; 1417#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1340#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1341#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1412#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 1360#L207 assume !(0 != eval_~tmp~0); 1362#L241 start_simulation_~kernel_st~0 := 2; 1548#L155-1 start_simulation_~kernel_st~0 := 3; 1546#L251-2 assume !(0 == ~M_E~0); 1544#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1400#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1401#L261-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1432#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 1384#L116-9 assume !(1 == ~m_pc~0); 1385#L116-11 is_master_triggered_~__retres1~0 := 0; 1553#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1552#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1551#L311-9 assume !(0 != activate_threads_~tmp~1); 1398#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1381#L135-9 assume !(1 == ~t1_pc~0); 1373#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 1374#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1314#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1315#L319-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1406#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 1338#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1339#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1402#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1403#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1333#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1334#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1409#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1323#L439 assume !(0 == start_simulation_~tmp~3); 1306#L439-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 1330#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1332#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1408#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 1404#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1405#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 1415#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 1363#L452 assume !(0 != start_simulation_~tmp___0~1); 1364#L420-1 [2020-10-20 08:02:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777217, now seen corresponding path program 1 times [2020-10-20 08:02:29,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761932470] [2020-10-20 08:02:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761932470] [2020-10-20 08:02:29,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:29,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294017781] [2020-10-20 08:02:29,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1241206856, now seen corresponding path program 1 times [2020-10-20 08:02:29,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:29,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524780087] [2020-10-20 08:02:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:29,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524780087] [2020-10-20 08:02:29,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:29,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:29,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590487397] [2020-10-20 08:02:29,952 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:29,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:29,953 INFO L87 Difference]: Start difference. First operand 313 states and 444 transitions. cyclomatic complexity: 133 Second operand 4 states. [2020-10-20 08:02:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:30,073 INFO L93 Difference]: Finished difference Result 605 states and 841 transitions. [2020-10-20 08:02:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:02:30,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 605 states and 841 transitions. [2020-10-20 08:02:30,080 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 526 [2020-10-20 08:02:30,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 605 states to 605 states and 841 transitions. [2020-10-20 08:02:30,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 605 [2020-10-20 08:02:30,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2020-10-20 08:02:30,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 605 states and 841 transitions. [2020-10-20 08:02:30,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:30,090 INFO L691 BuchiCegarLoop]: Abstraction has 605 states and 841 transitions. [2020-10-20 08:02:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states and 841 transitions. [2020-10-20 08:02:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 587. [2020-10-20 08:02:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-10-20 08:02:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 817 transitions. [2020-10-20 08:02:30,106 INFO L714 BuchiCegarLoop]: Abstraction has 587 states and 817 transitions. [2020-10-20 08:02:30,106 INFO L594 BuchiCegarLoop]: Abstraction has 587 states and 817 transitions. [2020-10-20 08:02:30,106 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:02:30,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 587 states and 817 transitions. [2020-10-20 08:02:30,126 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 522 [2020-10-20 08:02:30,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:30,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:30,127 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:30,128 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-10-20 08:02:30,128 INFO L794 eck$LassoCheckResult]: Stem: 2366#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; 2233#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2234#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 2282#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 2283#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2371#L167-1 assume 0 == ~M_E~0;~M_E~0 := 1; 2294#L251-1 assume !(0 == ~T1_E~0); 2295#L256-1 assume !(0 == ~E_M~0); 2537#L261-1 assume 0 == ~E_1~0;~E_1~0 := 1; 2375#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 2514#L116 assume !(1 == ~m_pc~0); 2513#L116-2 is_master_triggered_~__retres1~0 := 0; 2512#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2511#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2510#L311 assume !(0 != activate_threads_~tmp~1); 2509#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2508#L135 assume !(1 == ~t1_pc~0); 2507#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 2506#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2505#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2504#L319 assume !(0 != activate_threads_~tmp___0~0); 2503#L319-2 assume !(1 == ~M_E~0); 2502#L279-1 assume !(1 == ~T1_E~0); 2501#L284-1 assume !(1 == ~E_M~0); 2499#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 2500#L420-1 [2020-10-20 08:02:30,128 INFO L796 eck$LassoCheckResult]: Loop: 2500#L420-1 assume !false; 2672#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2662#L226 assume !false; 2671#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2670#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2668#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2667#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 2666#L207 assume !(0 != eval_~tmp~0); 2212#L241 start_simulation_~kernel_st~0 := 2; 2213#L155-1 start_simulation_~kernel_st~0 := 3; 2281#L251-2 assume !(0 == ~M_E~0); 2322#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2729#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2724#L261-3 assume !(0 == ~E_1~0); 2723#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 2721#L116-9 assume !(1 == ~m_pc~0); 2720#L116-11 is_master_triggered_~__retres1~0 := 0; 2719#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2718#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2717#L311-9 assume !(0 != activate_threads_~tmp~1); 2716#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2715#L135-9 assume !(1 == ~t1_pc~0); 2714#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 2713#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2693#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2692#L319-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 2691#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2690#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2689#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2688#L289-3 assume !(1 == ~E_1~0); 2603#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2686#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2685#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2684#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2683#L439 assume !(0 == start_simulation_~tmp~3); 2236#L439-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 2682#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2680#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2678#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 2677#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2676#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 2675#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 2674#L452 assume !(0 != start_simulation_~tmp___0~1); 2500#L420-1 [2020-10-20 08:02:30,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,129 INFO L82 PathProgramCache]: Analyzing trace with hash 715219135, now seen corresponding path program 1 times [2020-10-20 08:02:30,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773674148] [2020-10-20 08:02:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:30,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773674148] [2020-10-20 08:02:30,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:30,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:30,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723140693] [2020-10-20 08:02:30,157 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2065275444, now seen corresponding path program 1 times [2020-10-20 08:02:30,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159429477] [2020-10-20 08:02:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:30,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159429477] [2020-10-20 08:02:30,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:30,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:30,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70099855] [2020-10-20 08:02:30,203 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:30,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:30,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:30,204 INFO L87 Difference]: Start difference. First operand 587 states and 817 transitions. cyclomatic complexity: 234 Second operand 3 states. [2020-10-20 08:02:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:30,234 INFO L93 Difference]: Finished difference Result 864 states and 1195 transitions. [2020-10-20 08:02:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:30,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 864 states and 1195 transitions. [2020-10-20 08:02:30,243 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 813 [2020-10-20 08:02:30,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 864 states to 864 states and 1195 transitions. [2020-10-20 08:02:30,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 864 [2020-10-20 08:02:30,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 864 [2020-10-20 08:02:30,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 864 states and 1195 transitions. [2020-10-20 08:02:30,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:30,257 INFO L691 BuchiCegarLoop]: Abstraction has 864 states and 1195 transitions. [2020-10-20 08:02:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states and 1195 transitions. [2020-10-20 08:02:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 681. [2020-10-20 08:02:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2020-10-20 08:02:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 940 transitions. [2020-10-20 08:02:30,276 INFO L714 BuchiCegarLoop]: Abstraction has 681 states and 940 transitions. [2020-10-20 08:02:30,277 INFO L594 BuchiCegarLoop]: Abstraction has 681 states and 940 transitions. [2020-10-20 08:02:30,277 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:02:30,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 681 states and 940 transitions. [2020-10-20 08:02:30,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 630 [2020-10-20 08:02:30,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:30,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:30,285 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:30,285 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-10-20 08:02:30,286 INFO L794 eck$LassoCheckResult]: Stem: 3835#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; 3693#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 3694#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 3740#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 3741#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3846#L167-1 assume !(0 == ~M_E~0); 3753#L251-1 assume !(0 == ~T1_E~0); 3754#L256-1 assume !(0 == ~E_M~0); 3834#L261-1 assume 0 == ~E_1~0;~E_1~0 := 1; 3851#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 3855#L116 assume !(1 == ~m_pc~0); 3766#L116-2 is_master_triggered_~__retres1~0 := 0; 3767#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3734#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3735#L311 assume !(0 != activate_threads_~tmp~1); 3832#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3833#L135 assume !(1 == ~t1_pc~0); 3786#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 3787#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3722#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3723#L319 assume !(0 != activate_threads_~tmp___0~0); 3838#L319-2 assume !(1 == ~M_E~0); 3839#L279-1 assume !(1 == ~T1_E~0); 3758#L284-1 assume !(1 == ~E_M~0); 3759#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 3837#L420-1 [2020-10-20 08:02:30,295 INFO L796 eck$LassoCheckResult]: Loop: 3837#L420-1 assume !false; 4045#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 4043#L226 assume !false; 4042#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4041#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 4039#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4038#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 4036#L207 assume !(0 != eval_~tmp~0); 4035#L241 start_simulation_~kernel_st~0 := 2; 4034#L155-1 start_simulation_~kernel_st~0 := 3; 4033#L251-2 assume !(0 == ~M_E~0); 4032#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 4031#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 4029#L261-3 assume 0 == ~E_1~0;~E_1~0 := 1; 4028#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 4027#L116-9 assume !(1 == ~m_pc~0); 4026#L116-11 is_master_triggered_~__retres1~0 := 0; 4025#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 4024#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 4023#L311-9 assume !(0 != activate_threads_~tmp~1); 4022#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 4021#L135-9 assume !(1 == ~t1_pc~0); 4020#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 4019#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 4018#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 4017#L319-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 4016#L319-11 assume !(1 == ~M_E~0); 3989#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 4015#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 3917#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 3915#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3910#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3907#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3905#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 3711#L439 assume !(0 == start_simulation_~tmp~3); 3712#L439-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 4053#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 4051#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4050#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 4049#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4048#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 4047#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 4046#L452 assume !(0 != start_simulation_~tmp___0~1); 3837#L420-1 [2020-10-20 08:02:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash -102429315, now seen corresponding path program 1 times [2020-10-20 08:02:30,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299563198] [2020-10-20 08:02:30,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:30,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299563198] [2020-10-20 08:02:30,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:30,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:30,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553327898] [2020-10-20 08:02:30,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1465412538, now seen corresponding path program 1 times [2020-10-20 08:02:30,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824058936] [2020-10-20 08:02:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:30,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824058936] [2020-10-20 08:02:30,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:30,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:30,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232087519] [2020-10-20 08:02:30,407 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:30,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:30,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:30,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:30,408 INFO L87 Difference]: Start difference. First operand 681 states and 940 transitions. cyclomatic complexity: 261 Second operand 4 states. [2020-10-20 08:02:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:30,470 INFO L93 Difference]: Finished difference Result 750 states and 1029 transitions. [2020-10-20 08:02:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:02:30,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 750 states and 1029 transitions. [2020-10-20 08:02:30,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 701 [2020-10-20 08:02:30,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 750 states to 750 states and 1029 transitions. [2020-10-20 08:02:30,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 750 [2020-10-20 08:02:30,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 750 [2020-10-20 08:02:30,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 750 states and 1029 transitions. [2020-10-20 08:02:30,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:30,486 INFO L691 BuchiCegarLoop]: Abstraction has 750 states and 1029 transitions. [2020-10-20 08:02:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states and 1029 transitions. [2020-10-20 08:02:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 553. [2020-10-20 08:02:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-10-20 08:02:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 758 transitions. [2020-10-20 08:02:30,497 INFO L714 BuchiCegarLoop]: Abstraction has 553 states and 758 transitions. [2020-10-20 08:02:30,498 INFO L594 BuchiCegarLoop]: Abstraction has 553 states and 758 transitions. [2020-10-20 08:02:30,498 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:02:30,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 758 transitions. [2020-10-20 08:02:30,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 518 [2020-10-20 08:02:30,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:30,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:30,502 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:30,502 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-10-20 08:02:30,503 INFO L794 eck$LassoCheckResult]: Stem: 5267#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; 5136#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5137#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 5182#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 5183#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5275#L167-1 assume !(0 == ~M_E~0); 5194#L251-1 assume !(0 == ~T1_E~0); 5195#L256-1 assume !(0 == ~E_M~0); 5266#L261-1 assume !(0 == ~E_1~0); 5277#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 5214#L116 assume !(1 == ~m_pc~0); 5206#L116-2 is_master_triggered_~__retres1~0 := 0; 5207#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5176#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5177#L311 assume !(0 != activate_threads_~tmp~1); 5265#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5234#L135 assume !(1 == ~t1_pc~0); 5229#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 5230#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5164#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5165#L319 assume !(0 != activate_threads_~tmp___0~0); 5268#L319-2 assume !(1 == ~M_E~0); 5187#L279-1 assume !(1 == ~T1_E~0); 5188#L284-1 assume !(1 == ~E_M~0); 5199#L289-1 assume !(1 == ~E_1~0); 5193#L420-1 [2020-10-20 08:02:30,503 INFO L796 eck$LassoCheckResult]: Loop: 5193#L420-1 assume !false; 5271#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5197#L226 assume !false; 5255#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5169#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5170#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5248#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 5189#L207 assume !(0 != eval_~tmp~0); 5112#L241 start_simulation_~kernel_st~0 := 2; 5113#L155-1 start_simulation_~kernel_st~0 := 3; 5180#L251-2 assume !(0 == ~M_E~0); 5219#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 5220#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 5235#L261-3 assume !(0 == ~E_1~0); 5276#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 5217#L116-9 assume !(1 == ~m_pc~0); 5218#L116-11 is_master_triggered_~__retres1~0 := 0; 5629#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5627#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5625#L311-9 assume !(0 != activate_threads_~tmp~1); 5623#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5621#L135-9 assume !(1 == ~t1_pc~0); 5619#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 5617#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5615#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5613#L319-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 5612#L319-11 assume !(1 == ~M_E~0); 5328#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 5326#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 5324#L289-3 assume !(1 == ~E_1~0); 5322#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5311#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5309#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5306#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 5154#L439 assume !(0 == start_simulation_~tmp~3); 5139#L439-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 5161#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5163#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5244#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 5239#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5240#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 5252#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 5192#L452 assume !(0 != start_simulation_~tmp___0~1); 5193#L420-1 [2020-10-20 08:02:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 1 times [2020-10-20 08:02:30,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083073948] [2020-10-20 08:02:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,514 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,548 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 476927542, now seen corresponding path program 1 times [2020-10-20 08:02:30,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6784262] [2020-10-20 08:02:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:30,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6784262] [2020-10-20 08:02:30,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:30,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:30,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477513178] [2020-10-20 08:02:30,599 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:30,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:30,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:30,600 INFO L87 Difference]: Start difference. First operand 553 states and 758 transitions. cyclomatic complexity: 207 Second operand 5 states. [2020-10-20 08:02:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:30,690 INFO L93 Difference]: Finished difference Result 937 states and 1261 transitions. [2020-10-20 08:02:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:02:30,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 937 states and 1261 transitions. [2020-10-20 08:02:30,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 892 [2020-10-20 08:02:30,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 937 states to 937 states and 1261 transitions. [2020-10-20 08:02:30,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 937 [2020-10-20 08:02:30,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 937 [2020-10-20 08:02:30,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 937 states and 1261 transitions. [2020-10-20 08:02:30,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:30,708 INFO L691 BuchiCegarLoop]: Abstraction has 937 states and 1261 transitions. [2020-10-20 08:02:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states and 1261 transitions. [2020-10-20 08:02:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 571. [2020-10-20 08:02:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-10-20 08:02:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 776 transitions. [2020-10-20 08:02:30,721 INFO L714 BuchiCegarLoop]: Abstraction has 571 states and 776 transitions. [2020-10-20 08:02:30,721 INFO L594 BuchiCegarLoop]: Abstraction has 571 states and 776 transitions. [2020-10-20 08:02:30,721 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:02:30,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states and 776 transitions. [2020-10-20 08:02:30,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 536 [2020-10-20 08:02:30,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:30,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:30,726 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:30,726 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-10-20 08:02:30,726 INFO L794 eck$LassoCheckResult]: Stem: 6768#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; 6642#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 6643#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 6689#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 6690#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 6773#L167-1 assume !(0 == ~M_E~0); 6702#L251-1 assume !(0 == ~T1_E~0); 6703#L256-1 assume !(0 == ~E_M~0); 6767#L261-1 assume !(0 == ~E_1~0); 6777#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 6721#L116 assume !(1 == ~m_pc~0); 6714#L116-2 is_master_triggered_~__retres1~0 := 0; 6715#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6683#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6684#L311 assume !(0 != activate_threads_~tmp~1); 6764#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6738#L135 assume !(1 == ~t1_pc~0); 6735#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 6736#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6674#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6675#L319 assume !(0 != activate_threads_~tmp___0~0); 6769#L319-2 assume !(1 == ~M_E~0); 6695#L279-1 assume !(1 == ~T1_E~0); 6696#L284-1 assume !(1 == ~E_M~0); 6709#L289-1 assume !(1 == ~E_1~0); 6616#L420-1 [2020-10-20 08:02:30,727 INFO L796 eck$LassoCheckResult]: Loop: 6616#L420-1 assume !false; 6617#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 6744#L226 assume !false; 6757#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6676#L180 assume !(0 == ~m_st~0); 6678#L184 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 6775#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6994#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 6995#L207 assume !(0 != eval_~tmp~0); 6618#L241 start_simulation_~kernel_st~0 := 2; 6619#L155-1 start_simulation_~kernel_st~0 := 3; 6687#L251-2 assume !(0 == ~M_E~0); 6730#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 7169#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 7168#L261-3 assume !(0 == ~E_1~0); 7167#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 7166#L116-9 assume !(1 == ~m_pc~0); 7165#L116-11 is_master_triggered_~__retres1~0 := 0; 7164#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7163#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6733#L311-9 assume !(0 != activate_threads_~tmp~1); 6734#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6719#L135-9 assume !(1 == ~t1_pc~0); 6720#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 7160#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6652#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6653#L319-9 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 6748#L319-11 assume !(1 == ~M_E~0); 6679#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6680#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 6731#L289-3 assume !(1 == ~E_1~0); 6740#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6776#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7182#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7181#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 7180#L439 assume !(0 == start_simulation_~tmp~3); 7179#L439-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 6665#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 6667#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6745#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 6741#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6742#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 6751#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 6697#L452 assume !(0 != start_simulation_~tmp___0~1); 6616#L420-1 [2020-10-20 08:02:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 2 times [2020-10-20 08:02:30,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952357128] [2020-10-20 08:02:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,751 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1215086055, now seen corresponding path program 1 times [2020-10-20 08:02:30,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244159586] [2020-10-20 08:02:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:30,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244159586] [2020-10-20 08:02:30,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:30,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:30,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69567220] [2020-10-20 08:02:30,800 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:30,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:30,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:30,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:30,801 INFO L87 Difference]: Start difference. First operand 571 states and 776 transitions. cyclomatic complexity: 207 Second operand 3 states. [2020-10-20 08:02:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:30,842 INFO L93 Difference]: Finished difference Result 839 states and 1113 transitions. [2020-10-20 08:02:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:30,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 839 states and 1113 transitions. [2020-10-20 08:02:30,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 807 [2020-10-20 08:02:30,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 839 states to 839 states and 1113 transitions. [2020-10-20 08:02:30,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 839 [2020-10-20 08:02:30,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 839 [2020-10-20 08:02:30,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 839 states and 1113 transitions. [2020-10-20 08:02:30,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:30,858 INFO L691 BuchiCegarLoop]: Abstraction has 839 states and 1113 transitions. [2020-10-20 08:02:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states and 1113 transitions. [2020-10-20 08:02:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 809. [2020-10-20 08:02:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-10-20 08:02:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1075 transitions. [2020-10-20 08:02:30,872 INFO L714 BuchiCegarLoop]: Abstraction has 809 states and 1075 transitions. [2020-10-20 08:02:30,872 INFO L594 BuchiCegarLoop]: Abstraction has 809 states and 1075 transitions. [2020-10-20 08:02:30,873 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:02:30,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 809 states and 1075 transitions. [2020-10-20 08:02:30,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 777 [2020-10-20 08:02:30,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:30,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:30,879 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-10-20 08:02:30,879 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:30,879 INFO L794 eck$LassoCheckResult]: Stem: 8188#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; 8058#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 8059#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 8103#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 8104#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 8194#L167-1 assume !(0 == ~M_E~0); 8115#L251-1 assume !(0 == ~T1_E~0); 8116#L256-1 assume !(0 == ~E_M~0); 8187#L261-1 assume !(0 == ~E_1~0); 8201#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 8136#L116 assume !(1 == ~m_pc~0); 8129#L116-2 is_master_triggered_~__retres1~0 := 0; 8130#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8095#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 8096#L311 assume !(0 != activate_threads_~tmp~1); 8185#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8155#L135 assume !(1 == ~t1_pc~0); 8150#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 8151#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8085#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8086#L319 assume !(0 != activate_threads_~tmp___0~0); 8190#L319-2 assume !(1 == ~M_E~0); 8109#L279-1 assume !(1 == ~T1_E~0); 8110#L284-1 assume !(1 == ~E_M~0); 8120#L289-1 assume !(1 == ~E_1~0); 8189#L420-1 assume !false; 8736#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 8415#L226 [2020-10-20 08:02:30,879 INFO L796 eck$LassoCheckResult]: Loop: 8415#L226 assume !false; 8733#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8731#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8728#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8725#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 8722#L207 assume 0 != eval_~tmp~0; 8720#L207-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 8174#L215 assume !(0 != eval_~tmp_ndt_1~0); 8176#L212 assume !(0 == ~t1_st~0); 8415#L226 [2020-10-20 08:02:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 1 times [2020-10-20 08:02:30,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373859287] [2020-10-20 08:02:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,903 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1331441525, now seen corresponding path program 1 times [2020-10-20 08:02:30,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404112658] [2020-10-20 08:02:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:30,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:30,913 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:30,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 610962953, now seen corresponding path program 1 times [2020-10-20 08:02:30,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:30,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664480510] [2020-10-20 08:02:30,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:30,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664480510] [2020-10-20 08:02:30,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:30,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:30,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562935091] [2020-10-20 08:02:30,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:30,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:30,989 INFO L87 Difference]: Start difference. First operand 809 states and 1075 transitions. cyclomatic complexity: 269 Second operand 3 states. [2020-10-20 08:02:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:31,051 INFO L93 Difference]: Finished difference Result 1330 states and 1742 transitions. [2020-10-20 08:02:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:31,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1742 transitions. [2020-10-20 08:02:31,061 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1210 [2020-10-20 08:02:31,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1742 transitions. [2020-10-20 08:02:31,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2020-10-20 08:02:31,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2020-10-20 08:02:31,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1742 transitions. [2020-10-20 08:02:31,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:31,074 INFO L691 BuchiCegarLoop]: Abstraction has 1330 states and 1742 transitions. [2020-10-20 08:02:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1742 transitions. [2020-10-20 08:02:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1259. [2020-10-20 08:02:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2020-10-20 08:02:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1661 transitions. [2020-10-20 08:02:31,094 INFO L714 BuchiCegarLoop]: Abstraction has 1259 states and 1661 transitions. [2020-10-20 08:02:31,095 INFO L594 BuchiCegarLoop]: Abstraction has 1259 states and 1661 transitions. [2020-10-20 08:02:31,095 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:02:31,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1259 states and 1661 transitions. [2020-10-20 08:02:31,101 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1178 [2020-10-20 08:02:31,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:31,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:31,102 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-10-20 08:02:31,102 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:31,102 INFO L794 eck$LassoCheckResult]: Stem: 10337#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; 10205#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 10206#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 10250#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 10251#L162-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 10343#L167-1 assume !(0 == ~M_E~0); 10538#L251-1 assume !(0 == ~T1_E~0); 10537#L256-1 assume !(0 == ~E_M~0); 10536#L261-1 assume !(0 == ~E_1~0); 10535#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 10534#L116 assume !(1 == ~m_pc~0); 10533#L116-2 is_master_triggered_~__retres1~0 := 0; 10532#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10531#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 10530#L311 assume !(0 != activate_threads_~tmp~1); 10529#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10528#L135 assume !(1 == ~t1_pc~0); 10527#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 10526#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10525#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 10524#L319 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 10339#L319-2 assume !(1 == ~M_E~0); 10255#L279-1 assume !(1 == ~T1_E~0); 10256#L284-1 assume !(1 == ~E_M~0); 10266#L289-1 assume !(1 == ~E_1~0); 10338#L420-1 assume !false; 11377#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 10779#L226 [2020-10-20 08:02:31,103 INFO L796 eck$LassoCheckResult]: Loop: 10779#L226 assume !false; 11374#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11372#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11370#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11368#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 11366#L207 assume 0 != eval_~tmp~0; 11361#L207-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 10319#L215 assume !(0 != eval_~tmp_ndt_1~0); 10321#L212 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 10517#L229 assume !(0 != eval_~tmp_ndt_2~0); 10779#L226 [2020-10-20 08:02:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash -624740157, now seen corresponding path program 1 times [2020-10-20 08:02:31,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:31,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090895041] [2020-10-20 08:02:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:31,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090895041] [2020-10-20 08:02:31,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:31,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:31,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930780731] [2020-10-20 08:02:31,120 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1674983449, now seen corresponding path program 1 times [2020-10-20 08:02:31,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:31,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012761965] [2020-10-20 08:02:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,128 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:31,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:31,185 INFO L87 Difference]: Start difference. First operand 1259 states and 1661 transitions. cyclomatic complexity: 406 Second operand 3 states. [2020-10-20 08:02:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:31,196 INFO L93 Difference]: Finished difference Result 1086 states and 1438 transitions. [2020-10-20 08:02:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:31,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1086 states and 1438 transitions. [2020-10-20 08:02:31,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1054 [2020-10-20 08:02:31,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1086 states to 1086 states and 1438 transitions. [2020-10-20 08:02:31,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1086 [2020-10-20 08:02:31,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1086 [2020-10-20 08:02:31,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1086 states and 1438 transitions. [2020-10-20 08:02:31,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:31,234 INFO L691 BuchiCegarLoop]: Abstraction has 1086 states and 1438 transitions. [2020-10-20 08:02:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states and 1438 transitions. [2020-10-20 08:02:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2020-10-20 08:02:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2020-10-20 08:02:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1438 transitions. [2020-10-20 08:02:31,256 INFO L714 BuchiCegarLoop]: Abstraction has 1086 states and 1438 transitions. [2020-10-20 08:02:31,256 INFO L594 BuchiCegarLoop]: Abstraction has 1086 states and 1438 transitions. [2020-10-20 08:02:31,256 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:02:31,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1086 states and 1438 transitions. [2020-10-20 08:02:31,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1054 [2020-10-20 08:02:31,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:31,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:31,263 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-10-20 08:02:31,263 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:31,264 INFO L794 eck$LassoCheckResult]: Stem: 12686#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; 12556#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12557#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 12602#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 12603#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 12694#L167-1 assume !(0 == ~M_E~0); 12613#L251-1 assume !(0 == ~T1_E~0); 12614#L256-1 assume !(0 == ~E_M~0); 12685#L261-1 assume !(0 == ~E_1~0); 12698#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 12632#L116 assume !(1 == ~m_pc~0); 12625#L116-2 is_master_triggered_~__retres1~0 := 0; 12626#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 12594#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 12595#L311 assume !(0 != activate_threads_~tmp~1); 12683#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 12652#L135 assume !(1 == ~t1_pc~0); 12647#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 12648#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 12586#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 12587#L319 assume !(0 != activate_threads_~tmp___0~0); 12688#L319-2 assume !(1 == ~M_E~0); 12607#L279-1 assume !(1 == ~T1_E~0); 12608#L284-1 assume !(1 == ~E_M~0); 12618#L289-1 assume !(1 == ~E_1~0); 12687#L420-1 assume !false; 13241#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 13239#L226 [2020-10-20 08:02:31,264 INFO L796 eck$LassoCheckResult]: Loop: 13239#L226 assume !false; 13237#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13235#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13233#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13231#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 13230#L207 assume 0 != eval_~tmp~0; 13228#L207-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 13216#L215 assume !(0 != eval_~tmp_ndt_1~0); 13213#L212 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 13214#L229 assume !(0 != eval_~tmp_ndt_2~0); 13239#L226 [2020-10-20 08:02:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 2 times [2020-10-20 08:02:31,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:31,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666206254] [2020-10-20 08:02:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,293 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1674983449, now seen corresponding path program 2 times [2020-10-20 08:02:31,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:31,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610399888] [2020-10-20 08:02:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,313 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1759980123, now seen corresponding path program 1 times [2020-10-20 08:02:31,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:31,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757940411] [2020-10-20 08:02:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:31,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:31,347 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:31,955 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2020-10-20 08:02:32,121 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-20 08:02:32,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:02:32 BoogieIcfgContainer [2020-10-20 08:02:32,159 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:02:32,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:02:32,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:02:32,160 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:02:32,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:28" (3/4) ... [2020-10-20 08:02:32,164 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:02:32,229 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:02:32,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:02:32,231 INFO L168 Benchmark]: Toolchain (without parser) took 5116.60 ms. Allocated memory was 34.6 MB in the beginning and 79.2 MB in the end (delta: 44.6 MB). Free memory was 8.5 MB in the beginning and 57.8 MB in the end (delta: -49.3 MB). Peak memory consumption was 44.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,231 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 34.6 MB. Free memory was 13.4 MB in the beginning and 13.3 MB in the end (delta: 49.2 kB). Peak memory consumption was 49.2 kB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.87 ms. Allocated memory was 34.6 MB in the beginning and 45.1 MB in the end (delta: 10.5 MB). Free memory was 7.7 MB in the beginning and 25.1 MB in the end (delta: -17.4 MB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.46 ms. Allocated memory is still 45.1 MB. Free memory was 25.1 MB in the beginning and 22.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,233 INFO L168 Benchmark]: Boogie Preprocessor took 42.76 ms. Allocated memory is still 45.1 MB. Free memory was 22.3 MB in the beginning and 20.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,233 INFO L168 Benchmark]: RCFGBuilder took 765.86 ms. Allocated memory was 45.1 MB in the beginning and 47.7 MB in the end (delta: 2.6 MB). Free memory was 20.0 MB in the beginning and 18.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,234 INFO L168 Benchmark]: BuchiAutomizer took 3563.63 ms. Allocated memory was 47.7 MB in the beginning and 78.6 MB in the end (delta: 30.9 MB). Free memory was 18.1 MB in the beginning and 11.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 41.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,234 INFO L168 Benchmark]: Witness Printer took 69.75 ms. Allocated memory was 78.6 MB in the beginning and 79.2 MB in the end (delta: 524.3 kB). Free memory was 11.0 MB in the beginning and 57.8 MB in the end (delta: -46.8 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:32,237 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.22 ms. Allocated memory is still 34.6 MB. Free memory was 13.4 MB in the beginning and 13.3 MB in the end (delta: 49.2 kB). Peak memory consumption was 49.2 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 611.87 ms. Allocated memory was 34.6 MB in the beginning and 45.1 MB in the end (delta: 10.5 MB). Free memory was 7.7 MB in the beginning and 25.1 MB in the end (delta: -17.4 MB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 52.46 ms. Allocated memory is still 45.1 MB. Free memory was 25.1 MB in the beginning and 22.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 42.76 ms. Allocated memory is still 45.1 MB. Free memory was 22.3 MB in the beginning and 20.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 765.86 ms. Allocated memory was 45.1 MB in the beginning and 47.7 MB in the end (delta: 2.6 MB). Free memory was 20.0 MB in the beginning and 18.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 3563.63 ms. Allocated memory was 47.7 MB in the beginning and 78.6 MB in the end (delta: 30.9 MB). Free memory was 18.1 MB in the beginning and 11.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 41.5 MB. Max. memory is 14.3 GB. * Witness Printer took 69.75 ms. Allocated memory was 78.6 MB in the beginning and 79.2 MB in the end (delta: 524.3 kB). Free memory was 11.0 MB in the beginning and 57.8 MB in the end (delta: -46.8 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1086 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1077 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1259 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2129 SDtfs, 2708 SDslu, 2450 SDs, 0 SdLazy, 315 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN1 SILU0 SILI6 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: 202]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=30753} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@507ef6af=0, NULL=30754, NULL=0, \result=0, token=0, __retres1=0, NULL=30753, tmp=1, \result=0, kernel_st=1, __retres1=0, tmp___0=0, t1_pc=0, __retres1=1, T1_E=2, NULL=30755, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f886c3f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b07d55e=0, \result=0, E_1=2, NULL=0, tmp_ndt_1=0, NULL=0, NULL=0, M_E=2, tmp_ndt_2=0, tmp=0, NULL=30756, m_i=1, t1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25cb7719=0, local=0, m_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9d0050c=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@3e909d55=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@708c7771=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 202]: 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 ; [L465] int __retres1 ; [L380] m_i = 1 [L381] t1_i = 1 [L406] int kernel_st ; [L407] int tmp ; [L408] int tmp___0 ; [L412] kernel_st = 0 [L162] COND TRUE m_i == 1 [L163] m_st = 0 [L167] COND TRUE t1_i == 1 [L168] t1_st = 0 [L251] COND FALSE !(M_E == 0) [L256] COND FALSE !(T1_E == 0) [L261] COND FALSE !(E_M == 0) [L266] COND FALSE !(E_1 == 0) [L304] int tmp ; [L305] int tmp___0 ; [L113] int __retres1 ; [L116] COND FALSE !(m_pc == 1) [L126] __retres1 = 0 [L128] return (__retres1); [L309] tmp = is_master_triggered() [L311] COND FALSE !(\read(tmp)) [L132] int __retres1 ; [L135] COND FALSE !(t1_pc == 1) [L145] __retres1 = 0 [L147] return (__retres1); [L317] tmp___0 = is_transmit1_triggered() [L319] COND FALSE !(\read(tmp___0)) [L279] COND FALSE !(M_E == 1) [L284] COND FALSE !(T1_E == 1) [L289] COND FALSE !(E_M == 1) [L294] COND FALSE !(E_1 == 1) [L420] COND TRUE 1 [L423] kernel_st = 1 [L198] int tmp ; Loop: [L202] COND TRUE 1 [L177] int __retres1 ; [L180] COND TRUE m_st == 0 [L181] __retres1 = 1 [L193] return (__retres1); [L205] tmp = exists_runnable_thread() [L207] COND TRUE \read(tmp) [L212] COND TRUE m_st == 0 [L213] int tmp_ndt_1; [L214] tmp_ndt_1 = __VERIFIER_nondet_int() [L215] COND FALSE !(\read(tmp_ndt_1)) [L226] COND TRUE t1_st == 0 [L227] int tmp_ndt_2; [L228] tmp_ndt_2 = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...