./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_2.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 e6d225bacde2ff4b43f974edb4824451ea41bcc5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-906a4fb [2020-10-19 20:09:26,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:09:26,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:09:26,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:09:26,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:09:26,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:09:26,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:09:26,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:09:26,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:09:26,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:09:26,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:09:26,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:09:26,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:09:26,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:09:26,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:09:26,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:09:26,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:09:26,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:09:26,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:09:26,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:09:26,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:09:26,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:09:26,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:09:26,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:09:26,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:09:26,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:09:26,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:09:26,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:09:26,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:09:26,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:09:26,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:09:26,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:09:26,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:09:26,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:09:26,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:09:26,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:09:26,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:09:26,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:09:26,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:09:26,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:09:26,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:09:26,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:09:26,413 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:09:26,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:09:26,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:09:26,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:09:26,415 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:09:26,416 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:09:26,416 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:09:26,416 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:09:26,416 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:09:26,416 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:09:26,417 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:09:26,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:09:26,417 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:09:26,417 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:09:26,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:09:26,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:09:26,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:09:26,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:09:26,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:09:26,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:09:26,419 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:09:26,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:09:26,419 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:09:26,419 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:09:26,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:09:26,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:09:26,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:09:26,420 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:09:26,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:09:26,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:09:26,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:09:26,421 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:09:26,422 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:09:26,422 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 -> e6d225bacde2ff4b43f974edb4824451ea41bcc5 [2020-10-19 20:09:26,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:09:26,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:09:26,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:09:26,806 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:09:26,807 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:09:26,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-10-19 20:09:26,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec95baf6/f9f8f67e81694730a7acaba31aa70c82/FLAGefff0449a [2020-10-19 20:09:27,313 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:09:27,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-10-19 20:09:27,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec95baf6/f9f8f67e81694730a7acaba31aa70c82/FLAGefff0449a [2020-10-19 20:09:27,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec95baf6/f9f8f67e81694730a7acaba31aa70c82 [2020-10-19 20:09:27,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:09:27,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:09:27,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:09:27,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:09:27,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:09:27,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:09:27" (1/1) ... [2020-10-19 20:09:27,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57facd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:27, skipping insertion in model container [2020-10-19 20:09:27,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:09:27" (1/1) ... [2020-10-19 20:09:27,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:09:27,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:09:28,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:09:28,025 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:09:28,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:09:28,155 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:09:28,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28 WrapperNode [2020-10-19 20:09:28,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:09:28,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:09:28,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:09:28,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:09:28,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:09:28,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:09:28,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:09:28,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:09:28,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (1/1) ... [2020-10-19 20:09:28,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:09:28,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:09:28,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:09:28,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:09:28,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (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-19 20:09:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:09:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:09:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:09:28,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:09:28,814 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:09:28,814 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-10-19 20:09:28,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:09:28 BoogieIcfgContainer [2020-10-19 20:09:28,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:09:28,817 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:09:28,818 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:09:28,821 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:09:28,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:09:28,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:09:27" (1/3) ... [2020-10-19 20:09:28,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55333131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:09:28, skipping insertion in model container [2020-10-19 20:09:28,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:09:28,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:09:28" (2/3) ... [2020-10-19 20:09:28,825 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55333131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:09:28, skipping insertion in model container [2020-10-19 20:09:28,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:09:28,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:09:28" (3/3) ... [2020-10-19 20:09:28,831 INFO L373 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2020-10-19 20:09:28,888 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:09:28,889 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:09:28,889 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:09:28,889 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:09:28,890 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:09:28,890 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:09:28,890 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:09:28,891 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:09:28,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states. [2020-10-19 20:09:28,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2020-10-19 20:09:28,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:28,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:28,948 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] [2020-10-19 20:09:28,949 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] [2020-10-19 20:09:28,949 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:09:28,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states. [2020-10-19 20:09:28,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2020-10-19 20:09:28,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:28,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:28,958 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] [2020-10-19 20:09:28,958 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] [2020-10-19 20:09:28,965 INFO L794 eck$LassoCheckResult]: Stem: 42#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 14#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 46#L454true havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 84#L214true assume !(1 == ~q_req_up~0); 83#L214-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 95#L229-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 11#L234-1true assume !(0 == ~q_read_ev~0); 41#L267-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 53#L272-1true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 94#L57true assume 1 == ~p_dw_pc~0; 3#L58true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 96#L68true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5#L69true activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 17#L307true assume !(0 != activate_threads_~tmp~1); 22#L307-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 19#L76true assume !(1 == ~c_dr_pc~0); 16#L76-2true is_do_read_c_triggered_~__retres1~1 := 0; 20#L87true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 48#L88true activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 49#L315true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 36#L315-2true assume !(1 == ~q_read_ev~0); 7#L285-1true assume !(1 == ~q_write_ev~0); 74#L411-1true [2020-10-19 20:09:28,966 INFO L796 eck$LassoCheckResult]: Loop: 74#L411-1true assume !false; 90#L412true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 54#L356true assume false; 82#L372true start_simulation_~kernel_st~0 := 2; 60#L214-2true assume !(1 == ~q_req_up~0); 58#L214-3true start_simulation_~kernel_st~0 := 3; 12#L267-2true assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 9#L267-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 70#L272-3true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 85#L57-3true assume 1 == ~p_dw_pc~0; 32#L58-1true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 93#L68-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 34#L69-1true activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 30#L307-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 6#L307-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 81#L76-3true assume 1 == ~c_dr_pc~0; 44#L77-1true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 18#L87-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 45#L88-1true activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 38#L315-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 40#L315-5true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 4#L285-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 63#L290-3true havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 86#L247-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 25#L259-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 50#L260-1true stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 78#L386true assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 64#L393true stop_simulation_#res := stop_simulation_~__retres2~0; 13#L394true start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 39#L428true assume !(0 != start_simulation_~tmp~4); 74#L411-1true [2020-10-19 20:09:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:28,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1146955365, now seen corresponding path program 1 times [2020-10-19 20:09:28,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:28,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366177636] [2020-10-19 20:09:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,167 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-19 20:09:29,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366177636] [2020-10-19 20:09:29,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:29,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938852177] [2020-10-19 20:09:29,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:29,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1018074234, now seen corresponding path program 1 times [2020-10-19 20:09:29,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:29,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851886625] [2020-10-19 20:09:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,193 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-19 20:09:29,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851886625] [2020-10-19 20:09:29,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:09:29,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006406589] [2020-10-19 20:09:29,196 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:29,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:29,216 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2020-10-19 20:09:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:29,245 INFO L93 Difference]: Finished difference Result 92 states and 135 transitions. [2020-10-19 20:09:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:29,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 135 transitions. [2020-10-19 20:09:29,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2020-10-19 20:09:29,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 86 states and 129 transitions. [2020-10-19 20:09:29,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2020-10-19 20:09:29,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2020-10-19 20:09:29,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 129 transitions. [2020-10-19 20:09:29,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:29,262 INFO L691 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2020-10-19 20:09:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 129 transitions. [2020-10-19 20:09:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-19 20:09:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-19 20:09:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2020-10-19 20:09:29,297 INFO L714 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2020-10-19 20:09:29,297 INFO L594 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2020-10-19 20:09:29,297 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:09:29,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 129 transitions. [2020-10-19 20:09:29,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2020-10-19 20:09:29,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:29,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:29,301 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] [2020-10-19 20:09:29,302 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] [2020-10-19 20:09:29,302 INFO L794 eck$LassoCheckResult]: Stem: 255#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 217#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 218#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 259#L214 assume !(1 == ~q_req_up~0); 220#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 280#L229-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 215#L234-1 assume !(0 == ~q_read_ev~0); 216#L267-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 254#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 264#L57 assume 1 == ~p_dw_pc~0; 197#L58 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 198#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 202#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 203#L307 assume !(0 != activate_threads_~tmp~1); 223#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 226#L76 assume !(1 == ~c_dr_pc~0); 221#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 222#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 228#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 260#L315 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 250#L315-2 assume !(1 == ~q_read_ev~0); 204#L285-1 assume !(1 == ~q_write_ev~0); 205#L411-1 [2020-10-19 20:09:29,303 INFO L796 eck$LassoCheckResult]: Loop: 205#L411-1 assume !false; 277#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 263#L356 assume !false; 206#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 207#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 235#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 236#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 237#L336 assume !(0 != eval_~tmp___1~0); 239#L372 start_simulation_~kernel_st~0 := 2; 269#L214-2 assume !(1 == ~q_req_up~0); 267#L214-3 start_simulation_~kernel_st~0 := 3; 212#L267-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 208#L267-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 209#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 276#L57-3 assume 1 == ~p_dw_pc~0; 241#L58-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 242#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 249#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 240#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 200#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 201#L76-3 assume 1 == ~c_dr_pc~0; 257#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 224#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 225#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 252#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 253#L315-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 195#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 196#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 271#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 231#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 232#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 261#L386 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 272#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 213#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 214#L428 assume !(0 != start_simulation_~tmp~4); 205#L411-1 [2020-10-19 20:09:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1153867225, now seen corresponding path program 1 times [2020-10-19 20:09:29,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:29,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747493936] [2020-10-19 20:09:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,351 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-19 20:09:29,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747493936] [2020-10-19 20:09:29,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:29,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054570085] [2020-10-19 20:09:29,352 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:29,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2012723057, now seen corresponding path program 1 times [2020-10-19 20:09:29,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:29,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783644] [2020-10-19 20:09:29,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,413 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-19 20:09:29,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783644] [2020-10-19 20:09:29,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:29,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137282479] [2020-10-19 20:09:29,415 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:29,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:29,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:29,416 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-10-19 20:09:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:29,432 INFO L93 Difference]: Finished difference Result 86 states and 128 transitions. [2020-10-19 20:09:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:29,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 128 transitions. [2020-10-19 20:09:29,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2020-10-19 20:09:29,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 128 transitions. [2020-10-19 20:09:29,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2020-10-19 20:09:29,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2020-10-19 20:09:29,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 128 transitions. [2020-10-19 20:09:29,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:29,441 INFO L691 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2020-10-19 20:09:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 128 transitions. [2020-10-19 20:09:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-19 20:09:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-19 20:09:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2020-10-19 20:09:29,448 INFO L714 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2020-10-19 20:09:29,448 INFO L594 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2020-10-19 20:09:29,448 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:09:29,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 128 transitions. [2020-10-19 20:09:29,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2020-10-19 20:09:29,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:29,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:29,452 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] [2020-10-19 20:09:29,452 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] [2020-10-19 20:09:29,452 INFO L794 eck$LassoCheckResult]: Stem: 436#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 398#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 399#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 440#L214 assume !(1 == ~q_req_up~0); 401#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 461#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 393#L234-1 assume !(0 == ~q_read_ev~0); 394#L267-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 435#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 444#L57 assume 1 == ~p_dw_pc~0; 376#L58 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 377#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 381#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 382#L307 assume !(0 != activate_threads_~tmp~1); 404#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 407#L76 assume !(1 == ~c_dr_pc~0); 402#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 403#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 409#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 441#L315 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 431#L315-2 assume !(1 == ~q_read_ev~0); 385#L285-1 assume !(1 == ~q_write_ev~0); 386#L411-1 [2020-10-19 20:09:29,452 INFO L796 eck$LassoCheckResult]: Loop: 386#L411-1 assume !false; 458#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 445#L356 assume !false; 387#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 388#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 416#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 417#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 418#L336 assume !(0 != eval_~tmp___1~0); 420#L372 start_simulation_~kernel_st~0 := 2; 450#L214-2 assume !(1 == ~q_req_up~0); 448#L214-3 start_simulation_~kernel_st~0 := 3; 395#L267-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 389#L267-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 390#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 457#L57-3 assume 1 == ~p_dw_pc~0; 422#L58-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 423#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 430#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 421#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 383#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 384#L76-3 assume 1 == ~c_dr_pc~0; 438#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 405#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 406#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 433#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 434#L315-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 379#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 380#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 452#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 412#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 413#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 442#L386 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 453#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 396#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 397#L428 assume !(0 != start_simulation_~tmp~4); 386#L411-1 [2020-10-19 20:09:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 434480677, now seen corresponding path program 1 times [2020-10-19 20:09:29,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:29,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785659734] [2020-10-19 20:09:29,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,511 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-19 20:09:29,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785659734] [2020-10-19 20:09:29,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:09:29,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520673397] [2020-10-19 20:09:29,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2012723057, now seen corresponding path program 2 times [2020-10-19 20:09:29,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:29,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885025085] [2020-10-19 20:09:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,595 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-19 20:09:29,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885025085] [2020-10-19 20:09:29,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:29,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781325238] [2020-10-19 20:09:29,598 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:29,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:09:29,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:09:29,599 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. cyclomatic complexity: 43 Second operand 4 states. [2020-10-19 20:09:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:29,781 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2020-10-19 20:09:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:09:29,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 258 transitions. [2020-10-19 20:09:29,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 123 [2020-10-19 20:09:29,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 258 transitions. [2020-10-19 20:09:29,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2020-10-19 20:09:29,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2020-10-19 20:09:29,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 258 transitions. [2020-10-19 20:09:29,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:29,795 INFO L691 BuchiCegarLoop]: Abstraction has 177 states and 258 transitions. [2020-10-19 20:09:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 258 transitions. [2020-10-19 20:09:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-10-19 20:09:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-19 20:09:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 258 transitions. [2020-10-19 20:09:29,810 INFO L714 BuchiCegarLoop]: Abstraction has 177 states and 258 transitions. [2020-10-19 20:09:29,810 INFO L594 BuchiCegarLoop]: Abstraction has 177 states and 258 transitions. [2020-10-19 20:09:29,810 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:09:29,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 258 transitions. [2020-10-19 20:09:29,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 123 [2020-10-19 20:09:29,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:29,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:29,815 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] [2020-10-19 20:09:29,815 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] [2020-10-19 20:09:29,816 INFO L794 eck$LassoCheckResult]: Stem: 712#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 674#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 675#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 716#L214 assume !(1 == ~q_req_up~0); 748#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 822#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 821#L234-1 assume !(0 == ~q_read_ev~0); 820#L267-1 assume !(0 == ~q_write_ev~0); 819#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 818#L57 assume 1 == ~p_dw_pc~0; 817#L58 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 815#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 814#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 813#L307 assume !(0 != activate_threads_~tmp~1); 812#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 811#L76 assume !(1 == ~c_dr_pc~0); 810#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 808#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 807#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 805#L315 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 804#L315-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 660#L285-1 assume !(1 == ~q_write_ev~0); 661#L411-1 [2020-10-19 20:09:29,816 INFO L796 eck$LassoCheckResult]: Loop: 661#L411-1 assume !false; 740#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 720#L356 assume !false; 662#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 663#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 692#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 693#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 694#L336 assume !(0 != eval_~tmp___1~0); 696#L372 start_simulation_~kernel_st~0 := 2; 757#L214-2 assume !(1 == ~q_req_up~0); 756#L214-3 start_simulation_~kernel_st~0 := 3; 755#L267-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 664#L267-4 assume !(0 == ~q_write_ev~0); 665#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 806#L57-3 assume 1 == ~p_dw_pc~0; 698#L58-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 699#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 706#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 697#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 656#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 657#L76-3 assume 1 == ~c_dr_pc~0; 714#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 681#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 682#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 709#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 710#L315-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 651#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 652#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 729#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 688#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 689#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 718#L386 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 730#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 670#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 671#L428 assume !(0 != start_simulation_~tmp~4); 661#L411-1 [2020-10-19 20:09:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash -845383063, now seen corresponding path program 1 times [2020-10-19 20:09:29,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:29,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391435105] [2020-10-19 20:09:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,864 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-19 20:09:29,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391435105] [2020-10-19 20:09:29,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:09:29,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921549634] [2020-10-19 20:09:29,866 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 207284723, now seen corresponding path program 1 times [2020-10-19 20:09:29,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:29,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489000071] [2020-10-19 20:09:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:29,905 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-19 20:09:29,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489000071] [2020-10-19 20:09:29,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:29,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:29,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650065018] [2020-10-19 20:09:29,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:29,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:29,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:09:29,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:09:29,908 INFO L87 Difference]: Start difference. First operand 177 states and 258 transitions. cyclomatic complexity: 83 Second operand 5 states. [2020-10-19 20:09:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:30,027 INFO L93 Difference]: Finished difference Result 582 states and 830 transitions. [2020-10-19 20:09:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:09:30,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 582 states and 830 transitions. [2020-10-19 20:09:30,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 552 [2020-10-19 20:09:30,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 582 states to 582 states and 830 transitions. [2020-10-19 20:09:30,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2020-10-19 20:09:30,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2020-10-19 20:09:30,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 582 states and 830 transitions. [2020-10-19 20:09:30,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:30,049 INFO L691 BuchiCegarLoop]: Abstraction has 582 states and 830 transitions. [2020-10-19 20:09:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 830 transitions. [2020-10-19 20:09:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 554. [2020-10-19 20:09:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-10-19 20:09:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 798 transitions. [2020-10-19 20:09:30,100 INFO L714 BuchiCegarLoop]: Abstraction has 554 states and 798 transitions. [2020-10-19 20:09:30,100 INFO L594 BuchiCegarLoop]: Abstraction has 554 states and 798 transitions. [2020-10-19 20:09:30,100 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:09:30,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 554 states and 798 transitions. [2020-10-19 20:09:30,112 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 528 [2020-10-19 20:09:30,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:30,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:30,116 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] [2020-10-19 20:09:30,117 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] [2020-10-19 20:09:30,120 INFO L794 eck$LassoCheckResult]: Stem: 1483#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1444#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1445#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 1489#L214 assume !(1 == ~q_req_up~0); 1521#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1522#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1442#L234-1 assume !(0 == ~q_read_ev~0); 1443#L267-1 assume !(0 == ~q_write_ev~0); 1482#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1495#L57 assume !(1 == ~p_dw_pc~0); 1524#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 1525#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1429#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1430#L307 assume !(0 != activate_threads_~tmp~1); 1448#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1451#L76 assume !(1 == ~c_dr_pc~0); 1446#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 1447#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1453#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1490#L315 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1475#L315-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1431#L285-1 assume !(1 == ~q_write_ev~0); 1432#L411-1 [2020-10-19 20:09:30,120 INFO L796 eck$LassoCheckResult]: Loop: 1432#L411-1 assume !false; 1893#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1890#L356 assume !false; 1886#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1870#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1864#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1861#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 1857#L336 assume !(0 != eval_~tmp___1~0); 1520#L372 start_simulation_~kernel_st~0 := 2; 1499#L214-2 assume !(1 == ~q_req_up~0); 1497#L214-3 start_simulation_~kernel_st~0 := 3; 1439#L267-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1433#L267-4 assume !(0 == ~q_write_ev~0); 1434#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1970#L57-3 assume !(1 == ~p_dw_pc~0); 1968#L57-5 is_do_write_p_triggered_~__retres1~0 := 0; 1967#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1966#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1965#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1964#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1963#L76-3 assume !(1 == ~c_dr_pc~0); 1961#L76-5 is_do_read_c_triggered_~__retres1~1 := 0; 1449#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1450#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1960#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1959#L315-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1920#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 1917#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1957#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1956#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1955#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 1954#L386 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 1953#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 1912#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 1908#L428 assume !(0 != start_simulation_~tmp~4); 1432#L411-1 [2020-10-19 20:09:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2124707798, now seen corresponding path program 1 times [2020-10-19 20:09:30,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100961108] [2020-10-19 20:09:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:30,185 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-19 20:09:30,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100961108] [2020-10-19 20:09:30,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:30,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:30,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572755660] [2020-10-19 20:09:30,186 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1836627915, now seen corresponding path program 1 times [2020-10-19 20:09:30,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885958039] [2020-10-19 20:09:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:30,219 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-19 20:09:30,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885958039] [2020-10-19 20:09:30,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:30,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:30,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064706156] [2020-10-19 20:09:30,220 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:30,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:09:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:09:30,221 INFO L87 Difference]: Start difference. First operand 554 states and 798 transitions. cyclomatic complexity: 248 Second operand 5 states. [2020-10-19 20:09:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:30,300 INFO L93 Difference]: Finished difference Result 1469 states and 2115 transitions. [2020-10-19 20:09:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:09:30,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1469 states and 2115 transitions. [2020-10-19 20:09:30,318 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1430 [2020-10-19 20:09:30,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1469 states to 1469 states and 2115 transitions. [2020-10-19 20:09:30,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1469 [2020-10-19 20:09:30,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1469 [2020-10-19 20:09:30,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1469 states and 2115 transitions. [2020-10-19 20:09:30,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:30,336 INFO L691 BuchiCegarLoop]: Abstraction has 1469 states and 2115 transitions. [2020-10-19 20:09:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states and 2115 transitions. [2020-10-19 20:09:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 587. [2020-10-19 20:09:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-10-19 20:09:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 831 transitions. [2020-10-19 20:09:30,354 INFO L714 BuchiCegarLoop]: Abstraction has 587 states and 831 transitions. [2020-10-19 20:09:30,354 INFO L594 BuchiCegarLoop]: Abstraction has 587 states and 831 transitions. [2020-10-19 20:09:30,354 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:09:30,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 587 states and 831 transitions. [2020-10-19 20:09:30,359 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 558 [2020-10-19 20:09:30,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:30,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:30,360 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] [2020-10-19 20:09:30,360 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] [2020-10-19 20:09:30,361 INFO L794 eck$LassoCheckResult]: Stem: 3523#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 3484#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 3485#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 3530#L214 assume !(1 == ~q_req_up~0); 3567#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3568#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3482#L234-1 assume !(0 == ~q_read_ev~0); 3483#L267-1 assume !(0 == ~q_write_ev~0); 3522#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3539#L57 assume !(1 == ~p_dw_pc~0); 3569#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 3570#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3467#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 3468#L307 assume !(0 != activate_threads_~tmp~1); 3488#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3491#L76 assume !(1 == ~c_dr_pc~0); 3486#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 3487#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3493#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3534#L315 assume !(0 != activate_threads_~tmp___0~1); 3516#L315-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3517#L285-1 assume !(1 == ~q_write_ev~0); 3470#L411-1 [2020-10-19 20:09:30,361 INFO L796 eck$LassoCheckResult]: Loop: 3470#L411-1 assume !false; 3925#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 3919#L356 assume !false; 3915#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3910#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3907#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3904#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 3899#L336 assume !(0 != eval_~tmp___1~0); 3900#L372 start_simulation_~kernel_st~0 := 2; 4004#L214-2 assume !(1 == ~q_req_up~0); 4001#L214-3 start_simulation_~kernel_st~0 := 3; 4000#L267-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 3999#L267-4 assume !(0 == ~q_write_ev~0); 3997#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3996#L57-3 assume !(1 == ~p_dw_pc~0); 3995#L57-5 is_do_write_p_triggered_~__retres1~0 := 0; 3994#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3993#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 3992#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 3991#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3990#L76-3 assume 1 == ~c_dr_pc~0; 3988#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 3986#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3984#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3982#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 3981#L315-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3980#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 3978#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3971#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3952#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3950#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 3948#L386 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 3946#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 3945#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 3940#L428 assume !(0 != start_simulation_~tmp~4); 3470#L411-1 [2020-10-19 20:09:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705876, now seen corresponding path program 1 times [2020-10-19 20:09:30,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473442459] [2020-10-19 20:09:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:30,389 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-19 20:09:30,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473442459] [2020-10-19 20:09:30,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:30,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:30,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279897274] [2020-10-19 20:09:30,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:09:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash -766204236, now seen corresponding path program 1 times [2020-10-19 20:09:30,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685606093] [2020-10-19 20:09:30,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:30,426 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-19 20:09:30,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685606093] [2020-10-19 20:09:30,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:30,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:30,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844520526] [2020-10-19 20:09:30,427 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:30,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:30,428 INFO L87 Difference]: Start difference. First operand 587 states and 831 transitions. cyclomatic complexity: 248 Second operand 3 states. [2020-10-19 20:09:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:30,463 INFO L93 Difference]: Finished difference Result 821 states and 1146 transitions. [2020-10-19 20:09:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:30,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 821 states and 1146 transitions. [2020-10-19 20:09:30,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 793 [2020-10-19 20:09:30,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 821 states to 821 states and 1146 transitions. [2020-10-19 20:09:30,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 821 [2020-10-19 20:09:30,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 821 [2020-10-19 20:09:30,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 821 states and 1146 transitions. [2020-10-19 20:09:30,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:30,481 INFO L691 BuchiCegarLoop]: Abstraction has 821 states and 1146 transitions. [2020-10-19 20:09:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states and 1146 transitions. [2020-10-19 20:09:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 546. [2020-10-19 20:09:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-10-19 20:09:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 765 transitions. [2020-10-19 20:09:30,494 INFO L714 BuchiCegarLoop]: Abstraction has 546 states and 765 transitions. [2020-10-19 20:09:30,494 INFO L594 BuchiCegarLoop]: Abstraction has 546 states and 765 transitions. [2020-10-19 20:09:30,494 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:09:30,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 546 states and 765 transitions. [2020-10-19 20:09:30,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 519 [2020-10-19 20:09:30,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:30,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:30,500 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] [2020-10-19 20:09:30,500 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] [2020-10-19 20:09:30,500 INFO L794 eck$LassoCheckResult]: Stem: 4936#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 4899#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4900#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 4941#L214 assume !(1 == ~q_req_up~0); 4974#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4975#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4897#L234-1 assume !(0 == ~q_read_ev~0); 4898#L267-1 assume !(0 == ~q_write_ev~0); 4935#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4948#L57 assume !(1 == ~p_dw_pc~0); 4978#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 4979#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4884#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 4885#L307 assume !(0 != activate_threads_~tmp~1); 4903#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4906#L76 assume !(1 == ~c_dr_pc~0); 4901#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 4902#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4980#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 4943#L315 assume !(0 != activate_threads_~tmp___0~1); 4929#L315-2 assume !(1 == ~q_read_ev~0); 4886#L285-1 assume !(1 == ~q_write_ev~0); 4887#L411-1 [2020-10-19 20:09:30,500 INFO L796 eck$LassoCheckResult]: Loop: 4887#L411-1 assume !false; 4965#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4947#L356 assume !false; 4890#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4891#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4915#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4916#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 4917#L336 assume !(0 != eval_~tmp___1~0); 4919#L372 start_simulation_~kernel_st~0 := 2; 5420#L214-2 assume !(1 == ~q_req_up~0); 5419#L214-3 start_simulation_~kernel_st~0 := 3; 5418#L267-2 assume !(0 == ~q_read_ev~0); 5417#L267-4 assume !(0 == ~q_write_ev~0); 5416#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5415#L57-3 assume !(1 == ~p_dw_pc~0); 5413#L57-5 is_do_write_p_triggered_~__retres1~0 := 0; 5411#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5410#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5408#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 5406#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5405#L76-3 assume 1 == ~c_dr_pc~0; 5403#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 5399#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5395#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5391#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 5389#L315-5 assume !(1 == ~q_read_ev~0); 4880#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 4881#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4955#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4912#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4913#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 4944#L386 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 5380#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 5359#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 4933#L428 assume !(0 != start_simulation_~tmp~4); 4887#L411-1 [2020-10-19 20:09:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 1 times [2020-10-19 20:09:30,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782139179] [2020-10-19 20:09:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:30,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:30,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:30,549 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1293244752, now seen corresponding path program 1 times [2020-10-19 20:09:30,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138483250] [2020-10-19 20:09:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:30,580 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-19 20:09:30,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138483250] [2020-10-19 20:09:30,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:30,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:30,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851006060] [2020-10-19 20:09:30,582 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:30,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:09:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:09:30,583 INFO L87 Difference]: Start difference. First operand 546 states and 765 transitions. cyclomatic complexity: 221 Second operand 5 states. [2020-10-19 20:09:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:30,677 INFO L93 Difference]: Finished difference Result 850 states and 1175 transitions. [2020-10-19 20:09:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:09:30,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1175 transitions. [2020-10-19 20:09:30,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 822 [2020-10-19 20:09:30,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1175 transitions. [2020-10-19 20:09:30,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2020-10-19 20:09:30,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2020-10-19 20:09:30,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1175 transitions. [2020-10-19 20:09:30,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:30,699 INFO L691 BuchiCegarLoop]: Abstraction has 850 states and 1175 transitions. [2020-10-19 20:09:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1175 transitions. [2020-10-19 20:09:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 573. [2020-10-19 20:09:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2020-10-19 20:09:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 792 transitions. [2020-10-19 20:09:30,714 INFO L714 BuchiCegarLoop]: Abstraction has 573 states and 792 transitions. [2020-10-19 20:09:30,715 INFO L594 BuchiCegarLoop]: Abstraction has 573 states and 792 transitions. [2020-10-19 20:09:30,715 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:09:30,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 792 transitions. [2020-10-19 20:09:30,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 546 [2020-10-19 20:09:30,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:30,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:30,721 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] [2020-10-19 20:09:30,721 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:30,721 INFO L794 eck$LassoCheckResult]: Stem: 6348#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6312#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6313#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 6356#L214 assume !(1 == ~q_req_up~0); 6393#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6394#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6310#L234-1 assume !(0 == ~q_read_ev~0); 6311#L267-1 assume !(0 == ~q_write_ev~0); 6347#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6364#L57 assume !(1 == ~p_dw_pc~0); 6399#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 6400#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6296#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 6297#L307 assume !(0 != activate_threads_~tmp~1); 6316#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6319#L76 assume !(1 == ~c_dr_pc~0); 6314#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 6315#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6402#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6358#L315 assume !(0 != activate_threads_~tmp___0~1); 6342#L315-2 assume !(1 == ~q_read_ev~0); 6298#L285-1 assume !(1 == ~q_write_ev~0); 6299#L411-1 [2020-10-19 20:09:30,722 INFO L796 eck$LassoCheckResult]: Loop: 6299#L411-1 assume !false; 6813#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 6780#L356 assume !false; 6779#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6778#L247 assume !(0 == ~p_dw_st~0); 6777#L251 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 6775#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6568#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 6569#L336 assume !(0 != eval_~tmp___1~0); 6772#L372 start_simulation_~kernel_st~0 := 2; 6370#L214-2 assume !(1 == ~q_req_up~0); 6371#L214-3 start_simulation_~kernel_st~0 := 3; 6306#L267-2 assume !(0 == ~q_read_ev~0); 6307#L267-4 assume !(0 == ~q_write_ev~0); 6381#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6382#L57-3 assume !(1 == ~p_dw_pc~0); 6840#L57-5 is_do_write_p_triggered_~__retres1~0 := 0; 6839#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6838#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 6837#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 6836#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6835#L76-3 assume 1 == ~c_dr_pc~0; 6833#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 6831#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6829#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6827#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 6826#L315-5 assume !(1 == ~q_read_ev~0); 6825#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 6824#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6822#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6821#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6820#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 6819#L386 assume !(0 != stop_simulation_~tmp~3);stop_simulation_~__retres2~0 := 1; 6818#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 6817#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 6816#L428 assume !(0 != start_simulation_~tmp~4); 6299#L411-1 [2020-10-19 20:09:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 2 times [2020-10-19 20:09:30,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351284602] [2020-10-19 20:09:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:30,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:30,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:30,751 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,752 INFO L82 PathProgramCache]: Analyzing trace with hash -87866345, now seen corresponding path program 1 times [2020-10-19 20:09:30,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102001299] [2020-10-19 20:09:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:30,787 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-19 20:09:30,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102001299] [2020-10-19 20:09:30,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:30,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:30,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777041221] [2020-10-19 20:09:30,789 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:30,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:30,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:09:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:09:30,790 INFO L87 Difference]: Start difference. First operand 573 states and 792 transitions. cyclomatic complexity: 221 Second operand 5 states. [2020-10-19 20:09:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:30,883 INFO L93 Difference]: Finished difference Result 1368 states and 1932 transitions. [2020-10-19 20:09:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:09:30,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1368 states and 1932 transitions. [2020-10-19 20:09:30,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1338 [2020-10-19 20:09:30,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1368 states to 1368 states and 1932 transitions. [2020-10-19 20:09:30,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1368 [2020-10-19 20:09:30,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1368 [2020-10-19 20:09:30,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1368 states and 1932 transitions. [2020-10-19 20:09:30,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:30,915 INFO L691 BuchiCegarLoop]: Abstraction has 1368 states and 1932 transitions. [2020-10-19 20:09:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states and 1932 transitions. [2020-10-19 20:09:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 600. [2020-10-19 20:09:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-19 20:09:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 819 transitions. [2020-10-19 20:09:30,931 INFO L714 BuchiCegarLoop]: Abstraction has 600 states and 819 transitions. [2020-10-19 20:09:30,931 INFO L594 BuchiCegarLoop]: Abstraction has 600 states and 819 transitions. [2020-10-19 20:09:30,931 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:09:30,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 819 transitions. [2020-10-19 20:09:30,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 573 [2020-10-19 20:09:30,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:30,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:30,937 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] [2020-10-19 20:09:30,937 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:30,937 INFO L794 eck$LassoCheckResult]: Stem: 8307#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8269#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 8270#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 8315#L214 assume !(1 == ~q_req_up~0); 8354#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 8355#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 8265#L234-1 assume !(0 == ~q_read_ev~0); 8266#L267-1 assume !(0 == ~q_write_ev~0); 8306#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 8323#L57 assume !(1 == ~p_dw_pc~0); 8357#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 8358#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8251#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 8252#L307 assume !(0 != activate_threads_~tmp~1); 8273#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 8276#L76 assume !(1 == ~c_dr_pc~0); 8271#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 8272#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 8316#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 8317#L315 assume !(0 != activate_threads_~tmp___0~1); 8300#L315-2 assume !(1 == ~q_read_ev~0); 8255#L285-1 assume !(1 == ~q_write_ev~0); 8256#L411-1 [2020-10-19 20:09:30,938 INFO L796 eck$LassoCheckResult]: Loop: 8256#L411-1 assume !false; 8810#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 8806#L356 assume !false; 8805#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8802#L247 assume !(0 == ~p_dw_st~0); 8803#L251 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 8804#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8836#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 8832#L336 assume !(0 != eval_~tmp___1~0); 8353#L372 start_simulation_~kernel_st~0 := 2; 8329#L214-2 assume !(1 == ~q_req_up~0); 8330#L214-3 start_simulation_~kernel_st~0 := 3; 8843#L267-2 assume !(0 == ~q_read_ev~0); 8842#L267-4 assume !(0 == ~q_write_ev~0); 8841#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 8840#L57-3 assume !(1 == ~p_dw_pc~0); 8839#L57-5 is_do_write_p_triggered_~__retres1~0 := 0; 8359#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8299#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 8290#L307-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 8253#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 8254#L76-3 assume 1 == ~c_dr_pc~0; 8311#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 8313#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 8830#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 8823#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 8822#L315-5 assume !(1 == ~q_read_ev~0); 8821#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 8820#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8356#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 8280#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8281#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 8349#L386 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 8334#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 8263#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 8264#L428 assume !(0 != start_simulation_~tmp~4); 8256#L411-1 [2020-10-19 20:09:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 3 times [2020-10-19 20:09:30,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340953096] [2020-10-19 20:09:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:30,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:30,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:30,966 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:30,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash -87925927, now seen corresponding path program 1 times [2020-10-19 20:09:30,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:30,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56584764] [2020-10-19 20:09:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:31,019 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-19 20:09:31,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56584764] [2020-10-19 20:09:31,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:31,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:09:31,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029853557] [2020-10-19 20:09:31,021 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:31,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:31,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:09:31,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:09:31,022 INFO L87 Difference]: Start difference. First operand 600 states and 819 transitions. cyclomatic complexity: 221 Second operand 5 states. [2020-10-19 20:09:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:31,094 INFO L93 Difference]: Finished difference Result 1046 states and 1435 transitions. [2020-10-19 20:09:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:09:31,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1046 states and 1435 transitions. [2020-10-19 20:09:31,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1019 [2020-10-19 20:09:31,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1046 states to 1046 states and 1435 transitions. [2020-10-19 20:09:31,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1046 [2020-10-19 20:09:31,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1046 [2020-10-19 20:09:31,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1046 states and 1435 transitions. [2020-10-19 20:09:31,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:31,121 INFO L691 BuchiCegarLoop]: Abstraction has 1046 states and 1435 transitions. [2020-10-19 20:09:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states and 1435 transitions. [2020-10-19 20:09:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 606. [2020-10-19 20:09:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2020-10-19 20:09:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 817 transitions. [2020-10-19 20:09:31,139 INFO L714 BuchiCegarLoop]: Abstraction has 606 states and 817 transitions. [2020-10-19 20:09:31,139 INFO L594 BuchiCegarLoop]: Abstraction has 606 states and 817 transitions. [2020-10-19 20:09:31,139 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:09:31,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 606 states and 817 transitions. [2020-10-19 20:09:31,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 579 [2020-10-19 20:09:31,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:31,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:31,146 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] [2020-10-19 20:09:31,147 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:31,147 INFO L794 eck$LassoCheckResult]: Stem: 9963#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 9927#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 9928#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 9968#L214 assume !(1 == ~q_req_up~0); 10008#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 10009#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 9922#L234-1 assume !(0 == ~q_read_ev~0); 9923#L267-1 assume !(0 == ~q_write_ev~0); 9962#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 9974#L57 assume !(1 == ~p_dw_pc~0); 10014#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 10015#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 9910#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 9911#L307 assume !(0 != activate_threads_~tmp~1); 9931#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9934#L76 assume !(1 == ~c_dr_pc~0); 9929#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 9930#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9969#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 9970#L315 assume !(0 != activate_threads_~tmp___0~1); 9956#L315-2 assume !(1 == ~q_read_ev~0); 9914#L285-1 assume !(1 == ~q_write_ev~0); 9915#L411-1 [2020-10-19 20:09:31,147 INFO L796 eck$LassoCheckResult]: Loop: 9915#L411-1 assume !false; 10310#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 10090#L356 assume !false; 10306#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10307#L247 assume !(0 == ~p_dw_st~0); 10415#L251 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10300#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10301#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 10281#L336 assume !(0 != eval_~tmp___1~0); 10282#L372 start_simulation_~kernel_st~0 := 2; 10446#L214-2 assume !(1 == ~q_req_up~0); 10445#L214-3 start_simulation_~kernel_st~0 := 3; 10444#L267-2 assume !(0 == ~q_read_ev~0); 10443#L267-4 assume !(0 == ~q_write_ev~0); 10442#L272-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10441#L57-3 assume !(1 == ~p_dw_pc~0); 10440#L57-5 is_do_write_p_triggered_~__retres1~0 := 0; 10439#L68-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10438#L69-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 10437#L307-3 assume !(0 != activate_threads_~tmp~1); 10436#L307-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10435#L76-3 assume 1 == ~c_dr_pc~0; 10434#L77-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 10433#L87-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10432#L88-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 10430#L315-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 10429#L315-5 assume !(1 == ~q_read_ev~0); 10428#L285-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 10427#L290-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10424#L247-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10423#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10422#L260-1 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 10421#L386 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 10420#L393 stop_simulation_#res := stop_simulation_~__retres2~0; 10419#L394 start_simulation_#t~ret16 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 10418#L428 assume !(0 != start_simulation_~tmp~4); 9915#L411-1 [2020-10-19 20:09:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 4 times [2020-10-19 20:09:31,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351162561] [2020-10-19 20:09:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,172 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1676273829, now seen corresponding path program 1 times [2020-10-19 20:09:31,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860474003] [2020-10-19 20:09:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:31,194 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-19 20:09:31,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860474003] [2020-10-19 20:09:31,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:31,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:09:31,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961817657] [2020-10-19 20:09:31,196 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:09:31,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:31,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:31,197 INFO L87 Difference]: Start difference. First operand 606 states and 817 transitions. cyclomatic complexity: 213 Second operand 3 states. [2020-10-19 20:09:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:31,227 INFO L93 Difference]: Finished difference Result 755 states and 991 transitions. [2020-10-19 20:09:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:31,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 991 transitions. [2020-10-19 20:09:31,234 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 724 [2020-10-19 20:09:31,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 755 states and 991 transitions. [2020-10-19 20:09:31,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 755 [2020-10-19 20:09:31,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 755 [2020-10-19 20:09:31,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 755 states and 991 transitions. [2020-10-19 20:09:31,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:31,243 INFO L691 BuchiCegarLoop]: Abstraction has 755 states and 991 transitions. [2020-10-19 20:09:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states and 991 transitions. [2020-10-19 20:09:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 701. [2020-10-19 20:09:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2020-10-19 20:09:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 924 transitions. [2020-10-19 20:09:31,258 INFO L714 BuchiCegarLoop]: Abstraction has 701 states and 924 transitions. [2020-10-19 20:09:31,258 INFO L594 BuchiCegarLoop]: Abstraction has 701 states and 924 transitions. [2020-10-19 20:09:31,258 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:09:31,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 924 transitions. [2020-10-19 20:09:31,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 670 [2020-10-19 20:09:31,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:31,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:31,264 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] [2020-10-19 20:09:31,264 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:31,264 INFO L794 eck$LassoCheckResult]: Stem: 11328#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 11294#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 11295#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 11333#L214 assume !(1 == ~q_req_up~0); 11371#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 11372#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 11291#L234-1 assume !(0 == ~q_read_ev~0); 11292#L267-1 assume !(0 == ~q_write_ev~0); 11327#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 11341#L57 assume !(1 == ~p_dw_pc~0); 11373#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 11374#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 11277#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 11278#L307 assume !(0 != activate_threads_~tmp~1); 11298#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 11301#L76 assume !(1 == ~c_dr_pc~0); 11296#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 11297#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 11334#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 11335#L315 assume !(0 != activate_threads_~tmp___0~1); 11322#L315-2 assume !(1 == ~q_read_ev~0); 11281#L285-1 assume !(1 == ~q_write_ev~0); 11282#L411-1 assume !false; 11414#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 11400#L356 [2020-10-19 20:09:31,265 INFO L796 eck$LassoCheckResult]: Loop: 11400#L356 assume !false; 11413#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11412#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 11411#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11410#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 11409#L336 assume 0 != eval_~tmp___1~0; 11407#L336-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet13;havoc eval_#t~nondet13; 11406#L345 assume !(0 != eval_~tmp~2); 11405#L341 assume !(0 == ~c_dr_st~0); 11400#L356 [2020-10-19 20:09:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1732817812, now seen corresponding path program 1 times [2020-10-19 20:09:31,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069106458] [2020-10-19 20:09:31,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,288 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash -446247981, now seen corresponding path program 1 times [2020-10-19 20:09:31,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982314833] [2020-10-19 20:09:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,323 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 316098504, now seen corresponding path program 1 times [2020-10-19 20:09:31,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943603812] [2020-10-19 20:09:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:09:31,352 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-19 20:09:31,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943603812] [2020-10-19 20:09:31,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:09:31,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:09:31,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470459145] [2020-10-19 20:09:31,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:09:31,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:09:31,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:09:31,424 INFO L87 Difference]: Start difference. First operand 701 states and 924 transitions. cyclomatic complexity: 227 Second operand 3 states. [2020-10-19 20:09:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:09:31,455 INFO L93 Difference]: Finished difference Result 950 states and 1226 transitions. [2020-10-19 20:09:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:09:31,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 950 states and 1226 transitions. [2020-10-19 20:09:31,464 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 916 [2020-10-19 20:09:31,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 950 states to 950 states and 1226 transitions. [2020-10-19 20:09:31,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 950 [2020-10-19 20:09:31,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 950 [2020-10-19 20:09:31,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 950 states and 1226 transitions. [2020-10-19 20:09:31,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:09:31,474 INFO L691 BuchiCegarLoop]: Abstraction has 950 states and 1226 transitions. [2020-10-19 20:09:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 1226 transitions. [2020-10-19 20:09:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-10-19 20:09:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-10-19 20:09:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1226 transitions. [2020-10-19 20:09:31,493 INFO L714 BuchiCegarLoop]: Abstraction has 950 states and 1226 transitions. [2020-10-19 20:09:31,493 INFO L594 BuchiCegarLoop]: Abstraction has 950 states and 1226 transitions. [2020-10-19 20:09:31,493 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:09:31,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 950 states and 1226 transitions. [2020-10-19 20:09:31,500 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 916 [2020-10-19 20:09:31,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:09:31,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:09:31,501 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] [2020-10-19 20:09:31,501 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:09:31,501 INFO L794 eck$LassoCheckResult]: Stem: 12990#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 12953#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 12954#L454 havoc start_simulation_#t~ret16, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0; 12995#L214 assume !(1 == ~q_req_up~0); 13030#L214-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 13031#L229-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 12951#L234-1 assume !(0 == ~q_read_ev~0); 12952#L267-1 assume !(0 == ~q_write_ev~0); 12989#L272-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 13003#L57 assume !(1 == ~p_dw_pc~0); 13033#L57-2 is_do_write_p_triggered_~__retres1~0 := 0; 13034#L68 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12938#L69 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 12939#L307 assume !(0 != activate_threads_~tmp~1); 12957#L307-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12960#L76 assume !(1 == ~c_dr_pc~0); 12955#L76-2 is_do_read_c_triggered_~__retres1~1 := 0; 12956#L87 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 13037#L88 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 12997#L315 assume !(0 != activate_threads_~tmp___0~1); 12983#L315-2 assume !(1 == ~q_read_ev~0); 12940#L285-1 assume !(1 == ~q_write_ev~0); 12941#L411-1 assume !false; 13448#L412 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 13385#L356 [2020-10-19 20:09:31,501 INFO L796 eck$LassoCheckResult]: Loop: 13385#L356 assume !false; 13442#L332 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13438#L247 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 13435#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13432#L260 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 13430#L336 assume 0 != eval_~tmp___1~0; 13427#L336-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet13;havoc eval_#t~nondet13; 13425#L345 assume !(0 != eval_~tmp~2); 13386#L341 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet14;havoc eval_#t~nondet14; 13384#L360 assume !(0 != eval_~tmp___0~2); 13385#L356 [2020-10-19 20:09:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1732817812, now seen corresponding path program 2 times [2020-10-19 20:09:31,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181746490] [2020-10-19 20:09:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,523 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash -948787216, now seen corresponding path program 1 times [2020-10-19 20:09:31,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924843675] [2020-10-19 20:09:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,532 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:09:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1209117339, now seen corresponding path program 1 times [2020-10-19 20:09:31,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:09:31,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959127404] [2020-10-19 20:09:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:09:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:09:31,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:09:31,557 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:09:32,186 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 123 [2020-10-19 20:09:32,405 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 20:09:32,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:09:32 BoogieIcfgContainer [2020-10-19 20:09:32,456 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:09:32,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:09:32,457 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:09:32,457 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:09:32,458 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:09:28" (3/4) ... [2020-10-19 20:09:32,461 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 20:09:32,536 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 20:09:32,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:09:32,538 INFO L168 Benchmark]: Toolchain (without parser) took 4824.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 961.3 MB in the beginning and 1.0 GB in the end (delta: -60.2 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:32,539 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:09:32,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:32,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:09:32,540 INFO L168 Benchmark]: Boogie Preprocessor took 34.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:32,541 INFO L168 Benchmark]: RCFGBuilder took 572.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:32,541 INFO L168 Benchmark]: BuchiAutomizer took 3639.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.1 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:32,542 INFO L168 Benchmark]: Witness Printer took 79.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2020-10-19 20:09:32,544 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 436.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 572.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3639.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.1 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. * Witness Printer took 79.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 950 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 2724 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 950 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1464 SDtfs, 2155 SDslu, 2343 SDs, 0 SdLazy, 266 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 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: 331]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p_last_write=0, c_dr_i=1, c_dr_pc=0, NULL=3, a_t=0, NULL=0, \result=0, NULL=1, \result=0, c_num_read=0, tmp=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=0, tmp___0=0, q_write_ev=2, __retres1=1, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22e0229d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7226e5ed=0, p_dw_pc=0, NULL=0, NULL=0, NULL=0, q_free=1, NULL=4, __retres1=0, p_dw_st=0, \result=0, q_ev=0, c_last_read=0, tmp___0=0, NULL=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ede0c5b=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d43b438=0, p_num_write=0, q_buf_0=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@118acc43=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68574b3e=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 331]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int q_buf_0 ; [L18] int q_free ; [L19] int q_read_ev ; [L20] int q_write_ev ; [L21] int q_req_up ; [L22] int q_ev ; [L43] int p_num_write ; [L44] int p_last_write ; [L45] int p_dw_st ; [L46] int p_dw_pc ; [L47] int p_dw_i ; [L48] int c_num_read ; [L49] int c_last_read ; [L50] int c_dr_st ; [L51] int c_dr_pc ; [L52] int c_dr_i ; [L156] static int a_t ; [L458] int __retres1 ; [L444] q_free = 1 [L445] q_write_ev = 2 [L446] q_read_ev = q_write_ev [L447] p_num_write = 0 [L448] p_dw_pc = 0 [L449] p_dw_i = 1 [L450] c_num_read = 0 [L451] c_dr_pc = 0 [L452] c_dr_i = 1 [L398] int kernel_st ; [L399] int tmp ; [L403] kernel_st = 0 [L214] COND FALSE !((int )q_req_up == 1) [L229] COND TRUE (int )p_dw_i == 1 [L230] p_dw_st = 0 [L234] COND TRUE (int )c_dr_i == 1 [L235] c_dr_st = 0 [L267] COND FALSE !((int )q_read_ev == 0) [L272] COND FALSE !((int )q_write_ev == 0) [L300] int tmp ; [L301] int tmp___0 ; [L54] int __retres1 ; [L57] COND FALSE !((int )p_dw_pc == 1) [L67] __retres1 = 0 [L69] return (__retres1); [L305] tmp = is_do_write_p_triggered() [L307] COND FALSE !(\read(tmp)) [L73] int __retres1 ; [L76] COND FALSE !((int )c_dr_pc == 1) [L86] __retres1 = 0 [L88] return (__retres1); [L313] tmp___0 = is_do_read_c_triggered() [L315] COND FALSE !(\read(tmp___0)) [L285] COND FALSE !((int )q_read_ev == 1) [L290] COND FALSE !((int )q_write_ev == 1) [L411] COND TRUE 1 [L414] kernel_st = 1 [L325] int tmp ; [L326] int tmp___0 ; [L327] int tmp___1 ; Loop: [L331] COND TRUE 1 [L244] int __retres1 ; [L247] COND TRUE (int )p_dw_st == 0 [L248] __retres1 = 1 [L260] return (__retres1); [L334] tmp___1 = exists_runnable_thread() [L336] COND TRUE \read(tmp___1) [L341] COND TRUE (int )p_dw_st == 0 [L343] tmp = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp)) [L356] COND TRUE (int )c_dr_st == 0 [L358] tmp___0 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...