./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d321e3b1b642bcfc9c94c4888bd187898cb1af58 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:22,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:22,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:22,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:22,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:22,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:22,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:22,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:22,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:22,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:22,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:22,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:22,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:22,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:22,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:22,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:22,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:22,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:22,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:22,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:22,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:22,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:22,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:22,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:22,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:22,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:22,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:22,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:22,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:22,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:22,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:22,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:22,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:22,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:22,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:22,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:22,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:22,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:22,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:22,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:22,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:22,134 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:22,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:22,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:22,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:22,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:22,152 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:22,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:22,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:22,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:22,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:22,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:22,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:22,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:22,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:22,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:22,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:22,153 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:22,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:22,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:22,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:22,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:22,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:22,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:22,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:22,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:22,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:22,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:22,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:22,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:22,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) 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 -> d321e3b1b642bcfc9c94c4888bd187898cb1af58 [2019-10-22 08:58:22,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:22,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:22,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:22,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:22,191 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:22,191 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-10-22 08:58:22,234 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/data/e9e94c346/7106db609d3f4cd1822b398e12e34c55/FLAGe99ce3730 [2019-10-22 08:58:22,624 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:22,624 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-10-22 08:58:22,636 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/data/e9e94c346/7106db609d3f4cd1822b398e12e34c55/FLAGe99ce3730 [2019-10-22 08:58:22,650 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/data/e9e94c346/7106db609d3f4cd1822b398e12e34c55 [2019-10-22 08:58:22,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:22,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:22,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:22,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:22,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:22,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:22,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260eacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22, skipping insertion in model container [2019-10-22 08:58:22,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:22,667 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:22,692 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:22,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:22,902 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:22,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:22,949 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:22,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22 WrapperNode [2019-10-22 08:58:22,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:22,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:22,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:22,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:22,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:22,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:22,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:22,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:22,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:22,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:23,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:23,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:23,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:23,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:23,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:23,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:23,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... [2019-10-22 08:58:23,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:23,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:23,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:23,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:23,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:23,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:23,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:23,503 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:23,503 INFO L284 CfgBuilder]: Removed 58 assume(true) statements. [2019-10-22 08:58:23,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:23 BoogieIcfgContainer [2019-10-22 08:58:23,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:23,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:23,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:23,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:23,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:22" (1/3) ... [2019-10-22 08:58:23,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d6a075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:23, skipping insertion in model container [2019-10-22 08:58:23,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:22" (2/3) ... [2019-10-22 08:58:23,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d6a075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:23, skipping insertion in model container [2019-10-22 08:58:23,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:23" (3/3) ... [2019-10-22 08:58:23,511 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-10-22 08:58:23,520 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:23,527 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 08:58:23,539 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 08:58:23,561 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:23,561 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:23,561 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:23,561 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:23,561 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:23,561 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:23,561 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:23,562 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2019-10-22 08:58:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 08:58:23,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:23,582 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:23,583 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:23,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595671, now seen corresponding path program 1 times [2019-10-22 08:58:23,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:23,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370500832] [2019-10-22 08:58:23,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:23,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370500832] [2019-10-22 08:58:23,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:23,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:23,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381683243] [2019-10-22 08:58:23,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:23,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:23,764 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2019-10-22 08:58:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:23,844 INFO L93 Difference]: Finished difference Result 266 states and 419 transitions. [2019-10-22 08:58:23,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:23,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 08:58:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:23,856 INFO L225 Difference]: With dead ends: 266 [2019-10-22 08:58:23,856 INFO L226 Difference]: Without dead ends: 174 [2019-10-22 08:58:23,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-22 08:58:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2019-10-22 08:58:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-22 08:58:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2019-10-22 08:58:23,905 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2019-10-22 08:58:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:23,906 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2019-10-22 08:58:23,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2019-10-22 08:58:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 08:58:23,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:23,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:23,908 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash 32121146, now seen corresponding path program 1 times [2019-10-22 08:58:23,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:23,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403664013] [2019-10-22 08:58:23,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:23,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403664013] [2019-10-22 08:58:23,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:23,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:23,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839522921] [2019-10-22 08:58:23,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:23,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:23,995 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 3 states. [2019-10-22 08:58:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,095 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2019-10-22 08:58:24,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:24,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 08:58:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,098 INFO L225 Difference]: With dead ends: 489 [2019-10-22 08:58:24,098 INFO L226 Difference]: Without dead ends: 335 [2019-10-22 08:58:24,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-22 08:58:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2019-10-22 08:58:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-10-22 08:58:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 481 transitions. [2019-10-22 08:58:24,139 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 481 transitions. Word has length 39 [2019-10-22 08:58:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,147 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 481 transitions. [2019-10-22 08:58:24,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 481 transitions. [2019-10-22 08:58:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 08:58:24,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,149 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,150 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1962023560, now seen corresponding path program 1 times [2019-10-22 08:58:24,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030939161] [2019-10-22 08:58:24,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:24,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030939161] [2019-10-22 08:58:24,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:24,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:24,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115343864] [2019-10-22 08:58:24,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:24,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,194 INFO L87 Difference]: Start difference. First operand 331 states and 481 transitions. Second operand 3 states. [2019-10-22 08:58:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,272 INFO L93 Difference]: Finished difference Result 855 states and 1233 transitions. [2019-10-22 08:58:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:24,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 08:58:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,275 INFO L225 Difference]: With dead ends: 855 [2019-10-22 08:58:24,275 INFO L226 Difference]: Without dead ends: 615 [2019-10-22 08:58:24,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-22 08:58:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2019-10-22 08:58:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 08:58:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 869 transitions. [2019-10-22 08:58:24,332 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 869 transitions. Word has length 39 [2019-10-22 08:58:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,333 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 869 transitions. [2019-10-22 08:58:24,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 869 transitions. [2019-10-22 08:58:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-22 08:58:24,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,336 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,336 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1461928521, now seen corresponding path program 1 times [2019-10-22 08:58:24,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616147737] [2019-10-22 08:58:24,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:24,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616147737] [2019-10-22 08:58:24,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:24,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:24,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385752919] [2019-10-22 08:58:24,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:24,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:24,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,379 INFO L87 Difference]: Start difference. First operand 611 states and 869 transitions. Second operand 3 states. [2019-10-22 08:58:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,437 INFO L93 Difference]: Finished difference Result 1523 states and 2157 transitions. [2019-10-22 08:58:24,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:24,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-22 08:58:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,441 INFO L225 Difference]: With dead ends: 1523 [2019-10-22 08:58:24,441 INFO L226 Difference]: Without dead ends: 1023 [2019-10-22 08:58:24,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-10-22 08:58:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 979. [2019-10-22 08:58:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-10-22 08:58:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1361 transitions. [2019-10-22 08:58:24,490 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1361 transitions. Word has length 40 [2019-10-22 08:58:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,490 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1361 transitions. [2019-10-22 08:58:24,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1361 transitions. [2019-10-22 08:58:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-22 08:58:24,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,496 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1414888532, now seen corresponding path program 1 times [2019-10-22 08:58:24,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762135515] [2019-10-22 08:58:24,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:24,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762135515] [2019-10-22 08:58:24,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:24,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:24,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797203599] [2019-10-22 08:58:24,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:24,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:24,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:24,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,536 INFO L87 Difference]: Start difference. First operand 979 states and 1361 transitions. Second operand 3 states. [2019-10-22 08:58:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,614 INFO L93 Difference]: Finished difference Result 2628 states and 3649 transitions. [2019-10-22 08:58:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:24,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-22 08:58:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,620 INFO L225 Difference]: With dead ends: 2628 [2019-10-22 08:58:24,621 INFO L226 Difference]: Without dead ends: 1693 [2019-10-22 08:58:24,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-10-22 08:58:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1653. [2019-10-22 08:58:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-10-22 08:58:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2260 transitions. [2019-10-22 08:58:24,693 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2260 transitions. Word has length 40 [2019-10-22 08:58:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,694 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 2260 transitions. [2019-10-22 08:58:24,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2260 transitions. [2019-10-22 08:58:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:58:24,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,697 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2068899576, now seen corresponding path program 1 times [2019-10-22 08:58:24,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235011348] [2019-10-22 08:58:24,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:24,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235011348] [2019-10-22 08:58:24,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:24,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:24,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614682094] [2019-10-22 08:58:24,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:24,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,788 INFO L87 Difference]: Start difference. First operand 1653 states and 2260 transitions. Second operand 3 states. [2019-10-22 08:58:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,883 INFO L93 Difference]: Finished difference Result 3689 states and 5014 transitions. [2019-10-22 08:58:24,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:24,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 08:58:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,890 INFO L225 Difference]: With dead ends: 3689 [2019-10-22 08:58:24,891 INFO L226 Difference]: Without dead ends: 2065 [2019-10-22 08:58:24,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2019-10-22 08:58:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 2021. [2019-10-22 08:58:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-10-22 08:58:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2730 transitions. [2019-10-22 08:58:24,997 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2730 transitions. Word has length 45 [2019-10-22 08:58:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,997 INFO L462 AbstractCegarLoop]: Abstraction has 2021 states and 2730 transitions. [2019-10-22 08:58:24,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2730 transitions. [2019-10-22 08:58:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 08:58:24,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,998 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1733130536, now seen corresponding path program 1 times [2019-10-22 08:58:24,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157461721] [2019-10-22 08:58:24,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:25,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157461721] [2019-10-22 08:58:25,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:25,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:25,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820771507] [2019-10-22 08:58:25,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:25,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:25,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:25,070 INFO L87 Difference]: Start difference. First operand 2021 states and 2730 transitions. Second operand 4 states. [2019-10-22 08:58:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:25,144 INFO L93 Difference]: Finished difference Result 2439 states and 3292 transitions. [2019-10-22 08:58:25,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:25,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-22 08:58:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:25,151 INFO L225 Difference]: With dead ends: 2439 [2019-10-22 08:58:25,151 INFO L226 Difference]: Without dead ends: 2437 [2019-10-22 08:58:25,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-10-22 08:58:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2019. [2019-10-22 08:58:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-10-22 08:58:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2717 transitions. [2019-10-22 08:58:25,223 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2717 transitions. Word has length 46 [2019-10-22 08:58:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:25,224 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 2717 transitions. [2019-10-22 08:58:25,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2717 transitions. [2019-10-22 08:58:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:58:25,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:25,225 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:25,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2107539801, now seen corresponding path program 1 times [2019-10-22 08:58:25,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:25,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753521613] [2019-10-22 08:58:25,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:25,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:25,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:25,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753521613] [2019-10-22 08:58:25,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050345167] [2019-10-22 08:58:25,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:25,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:58:25,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:25,439 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:25,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-22 08:58:25,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329118873] [2019-10-22 08:58:25,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:25,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:25,441 INFO L87 Difference]: Start difference. First operand 2019 states and 2717 transitions. Second operand 7 states. [2019-10-22 08:58:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:25,682 INFO L93 Difference]: Finished difference Result 5451 states and 7392 transitions. [2019-10-22 08:58:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:25,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-10-22 08:58:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:25,699 INFO L225 Difference]: With dead ends: 5451 [2019-10-22 08:58:25,699 INFO L226 Difference]: Without dead ends: 5449 [2019-10-22 08:58:25,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-10-22 08:58:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 3949. [2019-10-22 08:58:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2019-10-22 08:58:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5343 transitions. [2019-10-22 08:58:25,958 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5343 transitions. Word has length 47 [2019-10-22 08:58:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:25,959 INFO L462 AbstractCegarLoop]: Abstraction has 3949 states and 5343 transitions. [2019-10-22 08:58:25,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5343 transitions. [2019-10-22 08:58:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:58:25,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:25,962 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:26,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:26,163 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1562188045, now seen corresponding path program 2 times [2019-10-22 08:58:26,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:26,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432658013] [2019-10-22 08:58:26,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:26,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432658013] [2019-10-22 08:58:26,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:26,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:26,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772012140] [2019-10-22 08:58:26,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:26,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:26,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:26,197 INFO L87 Difference]: Start difference. First operand 3949 states and 5343 transitions. Second operand 3 states. [2019-10-22 08:58:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:26,333 INFO L93 Difference]: Finished difference Result 5955 states and 8100 transitions. [2019-10-22 08:58:26,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:26,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 08:58:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:26,340 INFO L225 Difference]: With dead ends: 5955 [2019-10-22 08:58:26,340 INFO L226 Difference]: Without dead ends: 2461 [2019-10-22 08:58:26,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2019-10-22 08:58:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2429. [2019-10-22 08:58:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-10-22 08:58:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 3223 transitions. [2019-10-22 08:58:26,458 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 3223 transitions. Word has length 50 [2019-10-22 08:58:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:26,458 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 3223 transitions. [2019-10-22 08:58:26,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3223 transitions. [2019-10-22 08:58:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 08:58:26,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:26,460 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:26,460 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1320977374, now seen corresponding path program 1 times [2019-10-22 08:58:26,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:26,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981118651] [2019-10-22 08:58:26,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:26,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981118651] [2019-10-22 08:58:26,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:26,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:26,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129588563] [2019-10-22 08:58:26,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:26,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:26,497 INFO L87 Difference]: Start difference. First operand 2429 states and 3223 transitions. Second operand 3 states. [2019-10-22 08:58:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:26,715 INFO L93 Difference]: Finished difference Result 6935 states and 9176 transitions. [2019-10-22 08:58:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:26,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 08:58:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:26,727 INFO L225 Difference]: With dead ends: 6935 [2019-10-22 08:58:26,727 INFO L226 Difference]: Without dead ends: 4583 [2019-10-22 08:58:26,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-10-22 08:58:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4583. [2019-10-22 08:58:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-10-22 08:58:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5953 transitions. [2019-10-22 08:58:26,953 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5953 transitions. Word has length 54 [2019-10-22 08:58:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:26,954 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5953 transitions. [2019-10-22 08:58:26,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5953 transitions. [2019-10-22 08:58:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:58:26,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:26,957 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:26,957 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:26,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1050588449, now seen corresponding path program 1 times [2019-10-22 08:58:26,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:26,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271922521] [2019-10-22 08:58:26,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:58:26,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271922521] [2019-10-22 08:58:26,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:26,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:26,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263031840] [2019-10-22 08:58:26,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:26,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:26,989 INFO L87 Difference]: Start difference. First operand 4583 states and 5953 transitions. Second operand 3 states. [2019-10-22 08:58:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:27,208 INFO L93 Difference]: Finished difference Result 8165 states and 10658 transitions. [2019-10-22 08:58:27,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:27,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 08:58:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:27,222 INFO L225 Difference]: With dead ends: 8165 [2019-10-22 08:58:27,222 INFO L226 Difference]: Without dead ends: 4583 [2019-10-22 08:58:27,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-10-22 08:58:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4583. [2019-10-22 08:58:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-10-22 08:58:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5857 transitions. [2019-10-22 08:58:27,420 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5857 transitions. Word has length 61 [2019-10-22 08:58:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:27,420 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5857 transitions. [2019-10-22 08:58:27,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5857 transitions. [2019-10-22 08:58:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 08:58:27,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:27,423 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:27,423 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash -117700456, now seen corresponding path program 1 times [2019-10-22 08:58:27,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:27,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197556744] [2019-10-22 08:58:27,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:58:27,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197556744] [2019-10-22 08:58:27,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:27,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:27,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015452410] [2019-10-22 08:58:27,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:27,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:27,459 INFO L87 Difference]: Start difference. First operand 4583 states and 5857 transitions. Second operand 3 states. [2019-10-22 08:58:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:27,650 INFO L93 Difference]: Finished difference Result 8677 states and 11107 transitions. [2019-10-22 08:58:27,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:27,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-22 08:58:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:27,671 INFO L225 Difference]: With dead ends: 8677 [2019-10-22 08:58:27,671 INFO L226 Difference]: Without dead ends: 4585 [2019-10-22 08:58:27,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2019-10-22 08:58:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4583. [2019-10-22 08:58:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-10-22 08:58:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5713 transitions. [2019-10-22 08:58:27,911 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5713 transitions. Word has length 62 [2019-10-22 08:58:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:27,912 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5713 transitions. [2019-10-22 08:58:27,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5713 transitions. [2019-10-22 08:58:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-22 08:58:27,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:27,915 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:27,916 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1892541846, now seen corresponding path program 1 times [2019-10-22 08:58:27,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:27,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29066475] [2019-10-22 08:58:27,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:58:27,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29066475] [2019-10-22 08:58:27,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:27,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:27,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804539770] [2019-10-22 08:58:27,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:27,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:27,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:27,966 INFO L87 Difference]: Start difference. First operand 4583 states and 5713 transitions. Second operand 5 states. [2019-10-22 08:58:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:28,382 INFO L93 Difference]: Finished difference Result 14009 states and 17462 transitions. [2019-10-22 08:58:28,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:28,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-22 08:58:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:28,417 INFO L225 Difference]: With dead ends: 14009 [2019-10-22 08:58:28,417 INFO L226 Difference]: Without dead ends: 9885 [2019-10-22 08:58:28,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9885 states. [2019-10-22 08:58:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9885 to 4703. [2019-10-22 08:58:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4703 states. [2019-10-22 08:58:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 5769 transitions. [2019-10-22 08:58:28,776 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 5769 transitions. Word has length 89 [2019-10-22 08:58:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:28,776 INFO L462 AbstractCegarLoop]: Abstraction has 4703 states and 5769 transitions. [2019-10-22 08:58:28,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 5769 transitions. [2019-10-22 08:58:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-22 08:58:28,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:28,783 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:28,784 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash -69278234, now seen corresponding path program 1 times [2019-10-22 08:58:28,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:28,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795592710] [2019-10-22 08:58:28,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:28,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:28,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:28,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795592710] [2019-10-22 08:58:28,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:28,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:28,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934572513] [2019-10-22 08:58:28,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:28,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:28,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:28,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:28,870 INFO L87 Difference]: Start difference. First operand 4703 states and 5769 transitions. Second operand 3 states. [2019-10-22 08:58:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:29,095 INFO L93 Difference]: Finished difference Result 7531 states and 9279 transitions. [2019-10-22 08:58:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:29,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-22 08:58:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:29,105 INFO L225 Difference]: With dead ends: 7531 [2019-10-22 08:58:29,105 INFO L226 Difference]: Without dead ends: 4777 [2019-10-22 08:58:29,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2019-10-22 08:58:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4687. [2019-10-22 08:58:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2019-10-22 08:58:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 5641 transitions. [2019-10-22 08:58:29,335 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 5641 transitions. Word has length 89 [2019-10-22 08:58:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:29,335 INFO L462 AbstractCegarLoop]: Abstraction has 4687 states and 5641 transitions. [2019-10-22 08:58:29,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 5641 transitions. [2019-10-22 08:58:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 08:58:29,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:29,339 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:29,339 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1125340559, now seen corresponding path program 1 times [2019-10-22 08:58:29,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:29,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246545353] [2019-10-22 08:58:29,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:58:29,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246545353] [2019-10-22 08:58:29,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:29,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:29,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406578237] [2019-10-22 08:58:29,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:29,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:29,375 INFO L87 Difference]: Start difference. First operand 4687 states and 5641 transitions. Second operand 5 states. [2019-10-22 08:58:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:29,777 INFO L93 Difference]: Finished difference Result 11329 states and 13692 transitions. [2019-10-22 08:58:29,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:29,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-22 08:58:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:29,788 INFO L225 Difference]: With dead ends: 11329 [2019-10-22 08:58:29,788 INFO L226 Difference]: Without dead ends: 6505 [2019-10-22 08:58:29,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6505 states. [2019-10-22 08:58:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6505 to 3411. [2019-10-22 08:58:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2019-10-22 08:58:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4075 transitions. [2019-10-22 08:58:29,995 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4075 transitions. Word has length 90 [2019-10-22 08:58:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:29,995 INFO L462 AbstractCegarLoop]: Abstraction has 3411 states and 4075 transitions. [2019-10-22 08:58:29,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4075 transitions. [2019-10-22 08:58:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 08:58:29,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:29,998 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:29,999 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2125598100, now seen corresponding path program 1 times [2019-10-22 08:58:29,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:29,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686182181] [2019-10-22 08:58:29,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 08:58:30,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686182181] [2019-10-22 08:58:30,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:30,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:30,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278020197] [2019-10-22 08:58:30,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:30,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:30,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:30,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:30,026 INFO L87 Difference]: Start difference. First operand 3411 states and 4075 transitions. Second operand 3 states. [2019-10-22 08:58:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:30,275 INFO L93 Difference]: Finished difference Result 8333 states and 9990 transitions. [2019-10-22 08:58:30,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:30,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-22 08:58:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:30,283 INFO L225 Difference]: With dead ends: 8333 [2019-10-22 08:58:30,284 INFO L226 Difference]: Without dead ends: 4816 [2019-10-22 08:58:30,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-10-22 08:58:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4437. [2019-10-22 08:58:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2019-10-22 08:58:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 5305 transitions. [2019-10-22 08:58:30,554 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 5305 transitions. Word has length 101 [2019-10-22 08:58:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:30,554 INFO L462 AbstractCegarLoop]: Abstraction has 4437 states and 5305 transitions. [2019-10-22 08:58:30,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 5305 transitions. [2019-10-22 08:58:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-22 08:58:30,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:30,560 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:30,561 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -459464668, now seen corresponding path program 1 times [2019-10-22 08:58:30,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:30,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895046242] [2019-10-22 08:58:30,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-22 08:58:30,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895046242] [2019-10-22 08:58:30,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:30,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:30,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640955149] [2019-10-22 08:58:30,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:30,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:30,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:30,626 INFO L87 Difference]: Start difference. First operand 4437 states and 5305 transitions. Second operand 3 states. [2019-10-22 08:58:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:30,959 INFO L93 Difference]: Finished difference Result 8727 states and 10456 transitions. [2019-10-22 08:58:30,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:30,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-22 08:58:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:30,967 INFO L225 Difference]: With dead ends: 8727 [2019-10-22 08:58:30,967 INFO L226 Difference]: Without dead ends: 4400 [2019-10-22 08:58:30,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-10-22 08:58:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4353. [2019-10-22 08:58:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4353 states. [2019-10-22 08:58:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 5057 transitions. [2019-10-22 08:58:31,209 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 5057 transitions. Word has length 152 [2019-10-22 08:58:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:31,209 INFO L462 AbstractCegarLoop]: Abstraction has 4353 states and 5057 transitions. [2019-10-22 08:58:31,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 5057 transitions. [2019-10-22 08:58:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 08:58:31,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:31,213 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:31,214 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1055203894, now seen corresponding path program 1 times [2019-10-22 08:58:31,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:31,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883264462] [2019-10-22 08:58:31,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:31,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:31,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-22 08:58:31,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883264462] [2019-10-22 08:58:31,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:31,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:31,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572990018] [2019-10-22 08:58:31,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:31,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:31,274 INFO L87 Difference]: Start difference. First operand 4353 states and 5057 transitions. Second operand 3 states. [2019-10-22 08:58:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:31,481 INFO L93 Difference]: Finished difference Result 8538 states and 9960 transitions. [2019-10-22 08:58:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:31,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-22 08:58:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:31,487 INFO L225 Difference]: With dead ends: 8538 [2019-10-22 08:58:31,487 INFO L226 Difference]: Without dead ends: 4337 [2019-10-22 08:58:31,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2019-10-22 08:58:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 4331. [2019-10-22 08:58:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-10-22 08:58:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 4974 transitions. [2019-10-22 08:58:31,703 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 4974 transitions. Word has length 154 [2019-10-22 08:58:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:31,703 INFO L462 AbstractCegarLoop]: Abstraction has 4331 states and 4974 transitions. [2019-10-22 08:58:31,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 4974 transitions. [2019-10-22 08:58:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 08:58:31,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:31,707 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:31,707 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:31,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:31,708 INFO L82 PathProgramCache]: Analyzing trace with hash 842292872, now seen corresponding path program 1 times [2019-10-22 08:58:31,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:31,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389753742] [2019-10-22 08:58:31,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:31,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:31,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-22 08:58:31,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389753742] [2019-10-22 08:58:31,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:31,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:31,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265927912] [2019-10-22 08:58:31,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:31,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:31,742 INFO L87 Difference]: Start difference. First operand 4331 states and 4974 transitions. Second operand 3 states. [2019-10-22 08:58:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:31,893 INFO L93 Difference]: Finished difference Result 6029 states and 6890 transitions. [2019-10-22 08:58:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:31,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-22 08:58:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:31,897 INFO L225 Difference]: With dead ends: 6029 [2019-10-22 08:58:31,897 INFO L226 Difference]: Without dead ends: 1854 [2019-10-22 08:58:31,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-10-22 08:58:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854. [2019-10-22 08:58:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-10-22 08:58:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2070 transitions. [2019-10-22 08:58:31,993 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2070 transitions. Word has length 154 [2019-10-22 08:58:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:31,993 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 2070 transitions. [2019-10-22 08:58:31,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2070 transitions. [2019-10-22 08:58:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 08:58:31,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:31,996 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:31,996 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:31,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1206640657, now seen corresponding path program 1 times [2019-10-22 08:58:31,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:31,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029827130] [2019-10-22 08:58:31,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:31,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:31,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-22 08:58:32,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029827130] [2019-10-22 08:58:32,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:32,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:32,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844551499] [2019-10-22 08:58:32,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:32,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:32,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:32,039 INFO L87 Difference]: Start difference. First operand 1854 states and 2070 transitions. Second operand 3 states. [2019-10-22 08:58:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:32,083 INFO L93 Difference]: Finished difference Result 2119 states and 2354 transitions. [2019-10-22 08:58:32,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:32,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-22 08:58:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:32,084 INFO L225 Difference]: With dead ends: 2119 [2019-10-22 08:58:32,084 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:58:32,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:58:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:58:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:58:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:58:32,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2019-10-22 08:58:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:32,086 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:32,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:32,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:58:32,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:58:32,239 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-10-22 08:58:32,398 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-10-22 08:58:32,578 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 151 [2019-10-22 08:58:32,720 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 133 [2019-10-22 08:58:32,929 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-10-22 08:58:33,110 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 153 [2019-10-22 08:58:33,249 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-10-22 08:58:33,890 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-10-22 08:58:34,103 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-10-22 08:58:35,397 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-10-22 08:58:36,245 WARN L191 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-10-22 08:58:36,974 WARN L191 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-10-22 08:58:37,929 WARN L191 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2019-10-22 08:58:38,327 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-10-22 08:58:38,932 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-10-22 08:58:39,681 WARN L191 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 91 [2019-10-22 08:58:40,295 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-10-22 08:58:40,957 WARN L191 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-10-22 08:58:41,716 WARN L191 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2019-10-22 08:58:42,083 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-10-22 08:58:42,848 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-10-22 08:58:43,543 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-10-22 08:58:43,767 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-10-22 08:58:44,525 WARN L191 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-10-22 08:58:45,153 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-10-22 08:58:45,875 WARN L191 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-10-22 08:58:46,585 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-10-22 08:58:47,196 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-10-22 08:58:47,822 WARN L191 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-10-22 08:58:48,570 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-10-22 08:58:48,626 INFO L443 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2019-10-22 08:58:48,626 INFO L443 ceAbstractionStarter]: For program point L283-3(lines 282 295) no Hoare annotation was computed. [2019-10-22 08:58:48,626 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 126) no Hoare annotation was computed. [2019-10-22 08:58:48,627 INFO L439 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse2 (<= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~c_dr_st~0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse1 (= ~q_free~0 1)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse15 (= 0 ~p_dw_st~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= 0 ~p_dw_pc~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~c_dr_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ~q_req_up~0 0) .cse0 .cse1 .cse3 .cse4 (<= 2 ~q_read_ev~0) .cse15 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-10-22 08:58:48,628 INFO L439 ceAbstractionStarter]: At program point L85-1(lines 73 87) the Hoare annotation is: (let ((.cse29 (+ ~c_num_read~0 1))) (let ((.cse25 (<= ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= ~q_free~0 1)) (.cse27 (<= .cse29 ~p_num_write~0)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse28 (<= ~p_num_write~0 .cse29)) (.cse13 (<= 2 ~q_read_ev~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse5 (and .cse27 .cse11 .cse28 .cse13 .cse14)) (.cse16 (= 0 ~p_dw_pc~0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= 0 ~p_num_write~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse17 (= ~c_num_read~0 0)) (.cse24 (= 1 ~p_num_write~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse21 (and .cse25 .cse26 .cse15 .cse11 .cse13 .cse14)) (.cse19 (= ~c_dr_pc~0 0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse0 (<= ~q_req_up~0 0)) (.cse1 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (= 0 ~q_free~0)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse23 (= ~q_write_ev~0 1)) (.cse4 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse6 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse8 .cse13 .cse9 .cse14) (and .cse1 .cse15 .cse3 .cse11 .cse6 .cse9 .cse16 .cse14 .cse10 .cse17 .cse4 .cse18 .cse19 .cse20) (and .cse1 .cse3 .cse4 .cse6 .cse12 .cse7 .cse8 .cse9 .cse21) (and .cse1 .cse15 .cse11 .cse6 .cse12 .cse22 .cse9 .cse16 .cse14 .cse17 .cse4 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse3 .cse23 .cse6 .cse7 .cse13 .cse9 .cse14 .cse10 .cse17 .cse2 .cse4 .cse24 .cse19) (and .cse1 .cse3 .cse4 .cse6 .cse12 .cse8 .cse9 (and .cse25 .cse26 .cse15 .cse11 .cse18 .cse16 .cse14)) (and .cse0 .cse1 .cse15 .cse11 .cse6 .cse13 .cse22 .cse9 .cse16 .cse14 .cse10 .cse17 .cse4 .cse18 .cse19 .cse20) (and .cse2 .cse12 .cse22 .cse19 .cse9 .cse14) (and .cse0 .cse1 .cse4 .cse6 .cse12 .cse8 .cse9 (and .cse25 .cse26 .cse15 .cse11 .cse18 .cse13 .cse22 .cse16 .cse14)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse1 .cse15 .cse3 .cse11 .cse6 .cse12 .cse9 .cse16 .cse14 .cse17 .cse4 .cse18 .cse19 .cse20) (and .cse0 (and .cse25 .cse26 .cse15 .cse11 .cse13 .cse22 .cse14) .cse1 .cse4 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse1 .cse3 .cse11 .cse6 .cse7 .cse13 .cse9 .cse14 .cse10 .cse17 .cse2 .cse4 .cse24 .cse19) (and .cse0 (and (and .cse25 .cse26 .cse15 .cse11 .cse14) .cse3 .cse6 .cse12) .cse7 .cse8 .cse9) (and .cse0 (and .cse12 (and .cse25 .cse26 .cse15 .cse11 .cse22 .cse14)) .cse7 .cse8 .cse9 (= ~q_read_ev~0 1)) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse12 .cse8 .cse9 .cse21) (and .cse2 .cse3 .cse6 .cse12 .cse19 .cse9 .cse14) (and .cse0 .cse1 .cse2 (and .cse27 .cse28 .cse13 .cse14) .cse3 .cse23 .cse4 .cse6 .cse12 .cse7 .cse8))))) [2019-10-22 08:58:48,628 INFO L446 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2019-10-22 08:58:48,628 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:58:48,628 INFO L439 ceAbstractionStarter]: At program point L86(lines 70 88) the Hoare annotation is: (let ((.cse15 (<= 2 ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse1 (= ~q_free~0 1)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse16 (<= 2 ~c_dr_st~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~p_num_write~0))) (or (and (<= ~q_req_up~0 0) .cse0 .cse1 .cse2 .cse3 (<= 2 ~q_read_ev~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-10-22 08:58:48,628 INFO L439 ceAbstractionStarter]: At program point L86-1(lines 70 88) the Hoare annotation is: (let ((.cse30 (+ ~c_num_read~0 1))) (let ((.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (= ~q_free~0 1)) (.cse28 (<= .cse30 ~p_num_write~0)) (.cse18 (<= 2 ~q_write_ev~0)) (.cse29 (<= ~p_num_write~0 .cse30)) (.cse13 (<= 2 ~q_read_ev~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (= 0 ~p_dw_st~0)) (.cse24 (= 0 ~p_dw_pc~0)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= 0 ~p_num_write~0)) (.cse15 (= ~c_num_read~0 0)) (.cse17 (= 1 ~p_num_write~0)) (.cse3 (= ~c_dr_pc~0 0)) (.cse26 (and .cse28 .cse18 .cse29 .cse13 .cse6)) (.cse14 (= ~c_dr_st~0 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse27 (and .cse20 .cse21 .cse22 .cse18 .cse13 .cse6)) (.cse7 (<= ~q_req_up~0 0)) (.cse8 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse0 (= 0 ~q_free~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (= ~q_write_ev~0 1)) (.cse16 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse11 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse19 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse15 .cse0 .cse16 .cse17 .cse3) (and .cse7 .cse8 .cse9 .cse18 .cse11 .cse1 .cse19 .cse13 .cse4 .cse5 .cse6 .cse0 .cse16) (and .cse8 .cse9 .cse16 .cse11 .cse1 .cse19 .cse4 .cse5 (and .cse20 .cse21 .cse22 .cse18 .cse23 .cse24 .cse6)) (and .cse7 (and .cse1 (and .cse20 .cse21 .cse22 .cse18 .cse2 .cse6)) .cse12 .cse19 .cse4 .cse5 (= ~q_read_ev~0 1)) (and .cse8 .cse22 .cse18 .cse11 .cse1 .cse2 .cse4 .cse24 .cse5 .cse6 .cse15 .cse16 .cse23 .cse3 .cse25) (and .cse7 (and .cse20 .cse21 .cse22 .cse18 .cse13 .cse2 .cse6) .cse8 .cse16 .cse11 .cse1 .cse12 .cse19 .cse4 .cse5) (and .cse0 .cse9 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse8 .cse22 .cse9 .cse18 .cse11 .cse1 .cse4 .cse24 .cse5 .cse6 .cse15 .cse16 .cse23 .cse3 .cse25) (and .cse7 .cse8 .cse22 .cse18 .cse11 .cse13 .cse2 .cse4 .cse24 .cse5 .cse6 .cse14 .cse15 .cse16 .cse23 .cse3 .cse25) (and .cse7 .cse8 .cse16 .cse11 .cse1 .cse19 .cse4 .cse5 (and .cse20 .cse21 .cse22 .cse18 .cse23 .cse13 .cse2 .cse24 .cse6)) (and .cse8 .cse22 .cse9 .cse18 .cse11 .cse4 .cse24 .cse5 .cse6 .cse14 .cse15 .cse16 .cse23 .cse3 .cse25) (and .cse7 (and (and .cse20 .cse21 .cse22 .cse18 .cse6) .cse9 .cse11 .cse1) .cse12 .cse19 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse16 .cse26 .cse11 .cse1 .cse12 .cse19 .cse4 .cse5) (and .cse8 .cse9 .cse18 .cse11 .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse15 .cse0 .cse16 .cse17 .cse3) (and .cse7 .cse8 .cse0 .cse9 .cse16 .cse26 .cse11 .cse12 .cse19 .cse4 .cse5 .cse14) (and .cse7 .cse8 .cse9 .cse16 .cse11 .cse1 .cse19 .cse4 .cse5 .cse27) (and .cse8 .cse9 .cse16 .cse11 .cse1 .cse12 .cse19 .cse4 .cse5 .cse27) (and .cse7 .cse8 .cse0 (and .cse28 .cse29 .cse13 .cse6) .cse9 .cse10 .cse16 .cse11 .cse1 .cse12 .cse19))))) [2019-10-22 08:58:48,628 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2019-10-22 08:58:48,628 INFO L443 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2019-10-22 08:58:48,628 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-10-22 08:58:48,628 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2019-10-22 08:58:48,628 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2019-10-22 08:58:48,629 INFO L443 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2019-10-22 08:58:48,629 INFO L443 ceAbstractionStarter]: For program point L55-3(lines 55 64) no Hoare annotation was computed. [2019-10-22 08:58:48,629 INFO L443 ceAbstractionStarter]: For program point L55-5(lines 55 64) no Hoare annotation was computed. [2019-10-22 08:58:48,629 INFO L439 ceAbstractionStarter]: At program point L270-1(lines 261 278) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse1 (= ~q_free~0 1)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 0 ~p_dw_st~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= 0 ~p_dw_pc~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse9 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (and .cse0 (<= ~q_req_up~0 0) .cse1 .cse3 .cse5 (<= 2 ~q_read_ev~0) .cse10 .cse6 .cse7 .cse8 .cse11 .cse9))) [2019-10-22 08:58:48,629 INFO L443 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2019-10-22 08:58:48,629 INFO L439 ceAbstractionStarter]: At program point L270-3(lines 261 278) the Hoare annotation is: (let ((.cse32 (+ ~c_num_read~0 1))) (let ((.cse29 (<= .cse32 ~p_num_write~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse30 (<= ~p_num_write~0 .cse32)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse22 (= ~c_dr_pc~0 1)) (.cse24 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse27 (and .cse29 .cse4 .cse30 .cse21 .cse11)) (.cse6 (<= 2 ~c_dr_st~0))) (let ((.cse7 (= 0 ~p_dw_st~0)) (.cse28 (and .cse22 (and .cse24 .cse18 .cse27 .cse6))) (.cse1 (and .cse22 (and .cse18 .cse6 (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse11)))) (.cse0 (<= ~q_req_up~0 0)) (.cse31 (= ~q_write_ev~0 1)) (.cse23 (= ~p_dw_pc~0 1)) (.cse26 (= 1 ~p_num_write~0)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (and (and (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse7 .cse11) .cse6) .cse22) .cse23) (and (and (and (and .cse19 .cse20 .cse3 .cse4 .cse11) .cse18 .cse6) .cse22) .cse0 .cse23) (and .cse24 .cse13 .cse18 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse4 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 .cse26 .cse16) (and .cse0 (and .cse22 (and .cse24 .cse18 .cse27 .cse25)) .cse23) (and .cse2 .cse13 .cse18 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse9 .cse11)) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse21 .cse7 .cse9 .cse11)) (and .cse24 .cse13 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11) (and .cse28 .cse23) (and .cse0 (and (and .cse24 (and .cse29 .cse30 .cse21 .cse11) .cse18 .cse6) .cse22) .cse31 .cse23) (and .cse0 .cse28) (and .cse23 .cse1) (and .cse0 .cse24 .cse13 .cse18 .cse4 .cse6 .cse22 .cse21 .cse11) (and .cse0 .cse31 .cse18 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 .cse26 .cse16) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))))) [2019-10-22 08:58:48,629 INFO L439 ceAbstractionStarter]: At program point L452(lines 438 454) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_free~0 1) (<= 2 ~q_write_ev~0) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2019-10-22 08:58:48,629 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2019-10-22 08:58:48,629 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2019-10-22 08:58:48,629 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 56 61) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L439 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse4 (<= 2 ~q_write_ev~0)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse22 (= ~c_dr_pc~0 1)) (.cse24 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse26 (let ((.cse28 (+ ~c_num_read~0 1))) (and (<= .cse28 ~p_num_write~0) .cse4 (<= ~p_num_write~0 .cse28) .cse21 .cse11))) (.cse6 (<= 2 ~c_dr_st~0))) (let ((.cse7 (= 0 ~p_dw_st~0)) (.cse27 (and .cse22 (and .cse24 .cse18 .cse26 .cse6))) (.cse23 (= ~p_dw_pc~0 1)) (.cse1 (and .cse22 (and .cse18 .cse6 (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse11)))) (.cse0 (<= ~q_req_up~0 0)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (and (and (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse7 .cse11) .cse6) .cse22) .cse23) (and (and (and (and .cse19 .cse20 .cse3 .cse4 .cse11) .cse18 .cse6) .cse22) .cse0 .cse23) (and .cse24 .cse13 .cse18 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse4 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 (= 1 ~p_num_write~0) .cse16) (and .cse0 (and .cse22 (and .cse24 .cse18 .cse26 .cse25)) .cse23) (and .cse2 .cse13 .cse18 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse9 .cse11)) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse21 .cse7 .cse9 .cse11)) (and .cse24 .cse13 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11) (and .cse27 .cse23) (and .cse0 .cse27) (and .cse23 .cse1) (and .cse0 .cse24 .cse13 .cse18 .cse4 .cse6 .cse22 .cse21 .cse11) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L439 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse4 (<= 2 ~q_write_ev~0)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse22 (= ~c_dr_pc~0 1)) (.cse24 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse26 (let ((.cse28 (+ ~c_num_read~0 1))) (and (<= .cse28 ~p_num_write~0) .cse4 (<= ~p_num_write~0 .cse28) .cse21 .cse11))) (.cse6 (<= 2 ~c_dr_st~0))) (let ((.cse7 (= 0 ~p_dw_st~0)) (.cse27 (and .cse22 (and .cse24 .cse18 .cse26 .cse6))) (.cse23 (= ~p_dw_pc~0 1)) (.cse1 (and .cse22 (and .cse18 .cse6 (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse11)))) (.cse0 (<= ~q_req_up~0 0)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (and (and (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse7 .cse11) .cse6) .cse22) .cse23) (and (and (and (and .cse19 .cse20 .cse3 .cse4 .cse11) .cse18 .cse6) .cse22) .cse0 .cse23) (and .cse24 .cse13 .cse18 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse4 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 (= 1 ~p_num_write~0) .cse16) (and .cse0 (and .cse22 (and .cse24 .cse18 .cse26 .cse25)) .cse23) (and .cse2 .cse13 .cse18 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse9 .cse11)) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse21 .cse7 .cse9 .cse11)) (and .cse24 .cse13 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11) (and .cse27 .cse23) (and .cse0 .cse27) (and .cse23 .cse1) (and .cse0 .cse24 .cse13 .cse18 .cse4 .cse6 .cse22 .cse21 .cse11) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L439 ceAbstractionStarter]: At program point L288-3(lines 279 296) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~q_free~0 1)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse24 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse18 (and .cse1 .cse23 (and .cse2 .cse3 .cse4 (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse8)))) (.cse12 (= 0 ~p_dw_st~0)) (.cse26 (let ((.cse27 (+ ~c_num_read~0 1))) (and (<= .cse27 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse27) .cse24 .cse8))) (.cse20 (<= ~q_req_up~0 0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse9 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse18 .cse19) (and .cse20 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse8) .cse2 .cse3 .cse4) .cse23) .cse19) (and .cse20 .cse9 .cse10 .cse11 .cse3 .cse24 .cse12 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse19 (and .cse1 .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse4))) (and .cse20 .cse18) (and .cse9 .cse1 .cse2 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse13 .cse8)) (and .cse20 .cse19 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse12 .cse8) .cse4) .cse23)) (and .cse20 .cse9 .cse1 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse24 .cse12 .cse13 .cse8)) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse19 (and .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse25))) (and .cse20 (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse23 .cse24 .cse8)) (and .cse2 .cse11 .cse3 .cse19 .cse24 .cse6 .cse7 .cse8 .cse25 .cse14 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17)))) [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 305 309) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L305-3(lines 305 309) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L305-5(lines 305 309) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L74-3(lines 74 83) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point L74-5(lines 74 83) no Hoare annotation was computed. [2019-10-22 08:58:48,630 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:58:48,631 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2019-10-22 08:58:48,631 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 24 39) no Hoare annotation was computed. [2019-10-22 08:58:48,631 INFO L443 ceAbstractionStarter]: For program point L25-3(lines 25 29) no Hoare annotation was computed. [2019-10-22 08:58:48,631 INFO L443 ceAbstractionStarter]: For program point L25-5(lines 24 39) no Hoare annotation was computed. [2019-10-22 08:58:48,631 INFO L439 ceAbstractionStarter]: At program point L339(lines 329 369) the Hoare annotation is: (let ((.cse4 (<= 2 ~q_write_ev~0)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse22 (= ~c_dr_pc~0 1)) (.cse24 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse26 (let ((.cse28 (+ ~c_num_read~0 1))) (and (<= .cse28 ~p_num_write~0) .cse4 (<= ~p_num_write~0 .cse28) .cse21 .cse11))) (.cse6 (<= 2 ~c_dr_st~0))) (let ((.cse7 (= 0 ~p_dw_st~0)) (.cse27 (and .cse22 (and .cse24 .cse18 .cse26 .cse6))) (.cse23 (= ~p_dw_pc~0 1)) (.cse1 (and .cse22 (and .cse18 .cse6 (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse11)))) (.cse0 (<= ~q_req_up~0 0)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (and (and (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse7 .cse11) .cse6) .cse22) .cse23) (and (and (and (and .cse19 .cse20 .cse3 .cse4 .cse11) .cse18 .cse6) .cse22) .cse0 .cse23) (and .cse24 .cse13 .cse18 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse4 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 (= 1 ~p_num_write~0) .cse16) (and .cse0 (and .cse22 (and .cse24 .cse18 .cse26 .cse25)) .cse23) (and .cse2 .cse13 .cse18 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse9 .cse11)) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse21 .cse7 .cse9 .cse11)) (and .cse24 .cse13 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11) (and .cse27 .cse23) (and .cse0 .cse27) (and .cse23 .cse1) (and .cse0 .cse24 .cse13 .cse18 .cse4 .cse6 .cse22 .cse21 .cse11) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2019-10-22 08:58:48,631 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-22 08:58:48,631 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 75 80) no Hoare annotation was computed. [2019-10-22 08:58:48,631 INFO L439 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse4 (<= 2 ~q_write_ev~0)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse22 (= ~c_dr_pc~0 1)) (.cse24 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse26 (let ((.cse28 (+ ~c_num_read~0 1))) (and (<= .cse28 ~p_num_write~0) .cse4 (<= ~p_num_write~0 .cse28) .cse21 .cse11))) (.cse6 (<= 2 ~c_dr_st~0))) (let ((.cse7 (= 0 ~p_dw_st~0)) (.cse27 (and .cse22 (and .cse24 .cse18 .cse26 .cse6))) (.cse23 (= ~p_dw_pc~0 1)) (.cse1 (and .cse22 (and .cse18 .cse6 (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse11)))) (.cse0 (<= ~q_req_up~0 0)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (and (and (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse7 .cse11) .cse6) .cse22) .cse23) (and (and (and (and .cse19 .cse20 .cse3 .cse4 .cse11) .cse18 .cse6) .cse22) .cse0 .cse23) (and .cse24 .cse13 .cse18 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse4 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 (= 1 ~p_num_write~0) .cse16) (and .cse0 (and .cse22 (and .cse24 .cse18 .cse26 .cse25)) .cse23) (and .cse2 .cse13 .cse18 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse9 .cse11)) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse21 .cse7 .cse9 .cse11)) (and .cse24 .cse13 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11) (and .cse27 .cse23) (and .cse0 .cse27) (and .cse23 .cse1) (and .cse0 .cse24 .cse13 .cse18 .cse4 .cse6 .cse22 .cse21 .cse11) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2019-10-22 08:58:48,631 INFO L439 ceAbstractionStarter]: At program point L257-1(lines 244 259) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~q_free~0 1)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse24 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse18 (and .cse1 .cse23 (and .cse2 .cse3 .cse4 (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse8)))) (.cse12 (= 0 ~p_dw_st~0)) (.cse26 (let ((.cse27 (+ ~c_num_read~0 1))) (and (<= .cse27 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse27) .cse24 .cse8))) (.cse20 (<= ~q_req_up~0 0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse9 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse18 .cse19) (and .cse20 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse8) .cse2 .cse3 .cse4) .cse23) .cse19) (and .cse20 .cse9 .cse10 .cse11 .cse3 .cse24 .cse12 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse19 (and .cse1 .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse4))) (and .cse20 .cse18) (and .cse9 .cse1 .cse2 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse13 .cse8)) (and .cse20 .cse19 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse12 .cse8) .cse4) .cse23)) (and .cse20 .cse9 .cse1 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse24 .cse12 .cse13 .cse8)) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse19 (and .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse25))) (and .cse20 (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse23 .cse24 .cse8)) (and .cse2 .cse11 .cse3 .cse19 .cse24 .cse6 .cse7 .cse8 .cse25 .cse14 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17)))) [2019-10-22 08:58:48,632 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-10-22 08:58:48,632 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-10-22 08:58:48,633 INFO L439 ceAbstractionStarter]: At program point L258(lines 241 260) the Hoare annotation is: (let ((.cse4 (<= 2 ~q_write_ev~0)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse22 (= ~c_dr_pc~0 1)) (.cse24 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse26 (let ((.cse28 (+ ~c_num_read~0 1))) (and (<= .cse28 ~p_num_write~0) .cse4 (<= ~p_num_write~0 .cse28) .cse21 .cse11))) (.cse6 (<= 2 ~c_dr_st~0))) (let ((.cse7 (= 0 ~p_dw_st~0)) (.cse27 (and .cse22 (and .cse24 .cse18 .cse26 .cse6))) (.cse23 (= ~p_dw_pc~0 1)) (.cse1 (and .cse22 (and .cse18 .cse6 (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse11)))) (.cse0 (<= ~q_req_up~0 0)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (and (and (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse7 .cse11) .cse6) .cse22) .cse23) (and (and (and (and .cse19 .cse20 .cse3 .cse4 .cse11) .cse18 .cse6) .cse22) .cse0 .cse23) (and .cse24 .cse13 .cse18 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse4 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 (= 1 ~p_num_write~0) .cse16) (and .cse0 (and .cse22 (and .cse24 .cse18 .cse26 .cse25)) .cse23) (and .cse2 .cse13 .cse18 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse9 .cse11)) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse21 .cse7 .cse9 .cse11)) (and .cse24 .cse13 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11) (and .cse27 .cse23) (and .cse0 .cse27) (and .cse23 .cse1) (and .cse0 .cse24 .cse13 .cse18 .cse4 .cse6 .cse22 .cse21 .cse11) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2019-10-22 08:58:48,633 INFO L439 ceAbstractionStarter]: At program point L258-1(lines 241 260) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~q_free~0 1)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse24 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse18 (and .cse1 .cse23 (and .cse2 .cse3 .cse4 (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse8)))) (.cse12 (= 0 ~p_dw_st~0)) (.cse26 (let ((.cse27 (+ ~c_num_read~0 1))) (and (<= .cse27 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse27) .cse24 .cse8))) (.cse20 (<= ~q_req_up~0 0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse9 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse18 .cse19) (and .cse20 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse8) .cse2 .cse3 .cse4) .cse23) .cse19) (and .cse20 .cse9 .cse10 .cse11 .cse3 .cse24 .cse12 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse19 (and .cse1 .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse4))) (and .cse20 .cse18) (and .cse9 .cse1 .cse2 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse13 .cse8)) (and .cse20 .cse19 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse12 .cse8) .cse4) .cse23)) (and .cse20 .cse9 .cse1 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse24 .cse12 .cse13 .cse8)) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse19 (and .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse25))) (and .cse20 (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse23 .cse24 .cse8)) (and .cse2 .cse11 .cse3 .cse19 .cse24 .cse6 .cse7 .cse8 .cse25 .cse14 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17)))) [2019-10-22 08:58:48,633 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2019-10-22 08:58:48,634 INFO L439 ceAbstractionStarter]: At program point L11-1(lines 158 206) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1)) (.cse4 (<= 2 ~p_dw_st~0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse2 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse3 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse6 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= 2 ~q_read_ev~0)) (.cse12 (= 0 ~p_dw_pc~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) (and (and .cse4 (and .cse7 .cse8 .cse9 .cse10 .cse14 .cse13)) .cse15) (and .cse15 (and .cse0 (and (= 0 ~q_free~0) .cse4 (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse10 (<= ~p_num_write~0 .cse16) .cse14 .cse13))) .cse1 .cse2)) (and (<= ~q_req_up~0 0) .cse0 .cse1 .cse2 (and .cse3 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 (= 0 ~p_dw_st~0) .cse12 .cse13))))) [2019-10-22 08:58:48,634 INFO L439 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~q_free~0 1)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse24 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse18 (and .cse1 .cse23 (and .cse2 .cse3 .cse4 (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse8)))) (.cse12 (= 0 ~p_dw_st~0)) (.cse26 (let ((.cse27 (+ ~c_num_read~0 1))) (and (<= .cse27 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse27) .cse24 .cse8))) (.cse20 (<= ~q_req_up~0 0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse9 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse18 .cse19) (and .cse20 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse8) .cse2 .cse3 .cse4) .cse23) .cse19) (and .cse20 .cse9 .cse10 .cse11 .cse3 .cse24 .cse12 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse19 (and .cse1 .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse4))) (and .cse20 .cse18) (and .cse9 .cse1 .cse2 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse13 .cse8)) (and .cse20 .cse19 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse12 .cse8) .cse4) .cse23)) (and .cse20 .cse9 .cse1 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse24 .cse12 .cse13 .cse8)) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse19 (and .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse25))) (and .cse20 (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse23 .cse24 .cse8)) (and .cse2 .cse11 .cse3 .cse19 .cse24 .cse6 .cse7 .cse8 .cse25 .cse14 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17)))) [2019-10-22 08:58:48,634 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2019-10-22 08:58:48,634 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:58:48,635 INFO L439 ceAbstractionStarter]: At program point L392(lines 376 394) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~q_free~0 1)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse24 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse18 (and .cse1 .cse23 (and .cse2 .cse3 .cse4 (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse8)))) (.cse12 (= 0 ~p_dw_st~0)) (.cse26 (let ((.cse27 (+ ~c_num_read~0 1))) (and (<= .cse27 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse27) .cse24 .cse8))) (.cse20 (<= ~q_req_up~0 0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse9 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse18 .cse19) (and .cse20 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse8) .cse2 .cse3 .cse4) .cse23) .cse19) (and .cse20 .cse9 .cse10 .cse11 .cse3 .cse24 .cse12 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse19 (and .cse1 .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse4))) (and .cse20 .cse18) (and .cse9 .cse1 .cse2 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse13 .cse8)) (and .cse20 .cse19 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse12 .cse8) .cse4) .cse23)) (and .cse20 .cse9 .cse1 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse24 .cse12 .cse13 .cse8)) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse19 (and .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse25))) (and .cse20 (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse23 .cse24 .cse8)) (and .cse2 .cse11 .cse3 .cse19 .cse24 .cse6 .cse7 .cse8 .cse25 .cse14 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17)))) [2019-10-22 08:58:48,635 INFO L443 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2019-10-22 08:58:48,635 INFO L439 ceAbstractionStarter]: At program point L409-1(lines 279 431) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~q_free~0 1)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse24 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse18 (and .cse1 .cse23 (and .cse2 .cse3 .cse4 (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse8)))) (.cse12 (= 0 ~p_dw_st~0)) (.cse26 (let ((.cse27 (+ ~c_num_read~0 1))) (and (<= .cse27 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse27) .cse24 .cse8))) (.cse20 (<= ~q_req_up~0 0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse9 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse18 .cse19) (and .cse20 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse8) .cse2 .cse3 .cse4) .cse23) .cse19) (and .cse20 .cse9 .cse10 .cse11 .cse3 .cse24 .cse12 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17) (and .cse19 (and .cse1 .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse4))) (and .cse20 .cse18) (and .cse9 .cse1 .cse2 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse13 .cse8)) (and .cse20 .cse19 (and .cse1 (and (and .cse21 .cse22 .cse10 .cse11 .cse24 .cse12 .cse8) .cse4) .cse23)) (and .cse20 .cse9 .cse1 .cse15 .cse3 .cse4 .cse23 .cse6 .cse7 (and .cse21 .cse22 .cse10 .cse11 .cse16 .cse24 .cse12 .cse13 .cse8)) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse19 (and .cse23 (and .cse0 .cse2 .cse26 .cse3 .cse25))) (and .cse20 (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse23 .cse24 .cse8)) (and .cse2 .cse11 .cse3 .cse19 .cse24 .cse6 .cse7 .cse8 .cse25 .cse14 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse9 .cse10 .cse2 .cse11 .cse3 .cse6 .cse13 .cse7 .cse8 .cse25 .cse14 .cse1 .cse15 .cse16 .cse5 .cse17)))) [2019-10-22 08:58:48,635 INFO L443 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2019-10-22 08:58:48,635 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-10-22 08:58:48,635 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2019-10-22 08:58:48,636 INFO L439 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse13 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse12 (= ~q_free~0 1)) (.cse15 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse10 (= ~c_dr_st~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse3 (= ~c_dr_pc~0 0)) (.cse16 (= 0 ~p_num_write~0)) (.cse18 (<= ~q_req_up~0 0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse9 (<= 2 ~q_read_ev~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 (= 1 ~p_num_write~0) .cse9 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 (and .cse2 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse12 .cse8 .cse9 .cse6))) (and .cse7 (and .cse12 .cse8 .cse3 .cse6) .cse13 .cse1 .cse14 .cse15 .cse2 .cse4 .cse5 .cse16) (and .cse11 (and .cse0 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse8 (<= ~p_num_write~0 .cse17) .cse9 .cse6)) .cse2)) (and .cse18 .cse13 .cse12 .cse8 .cse15 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7 .cse1 .cse14 .cse3 .cse16) (and .cse18 .cse0 .cse1 .cse8 .cse2 .cse11 .cse9 .cse6))) [2019-10-22 08:58:48,636 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2019-10-22 08:58:48,636 INFO L443 ceAbstractionStarter]: For program point L30-3(lines 30 34) no Hoare annotation was computed. [2019-10-22 08:58:48,640 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 08:58:48,640 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2019-10-22 08:58:48,640 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 218) no Hoare annotation was computed. [2019-10-22 08:58:48,640 INFO L443 ceAbstractionStarter]: For program point L245-1(lines 245 255) no Hoare annotation was computed. [2019-10-22 08:58:48,640 INFO L439 ceAbstractionStarter]: At program point L212-1(lines 227 231) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_free~0 1) (<= 2 ~q_write_ev~0) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2019-10-22 08:58:48,640 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 218) no Hoare annotation was computed. [2019-10-22 08:58:48,641 INFO L439 ceAbstractionStarter]: At program point L212-3(lines 208 222) the Hoare annotation is: (let ((.cse32 (+ ~c_num_read~0 1))) (let ((.cse30 (<= .cse32 ~p_num_write~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse31 (<= ~p_num_write~0 .cse32)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse22 (= ~c_dr_pc~0 1)) (.cse24 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse27 (and .cse30 .cse4 .cse31 .cse21 .cse11)) (.cse6 (<= 2 ~c_dr_st~0))) (let ((.cse7 (= 0 ~p_dw_st~0)) (.cse26 (= 1 ~p_num_write~0)) (.cse28 (and .cse22 (and .cse24 .cse18 .cse27 .cse6))) (.cse1 (and .cse22 (and .cse18 .cse6 (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse11)))) (.cse0 (<= ~q_req_up~0 0)) (.cse29 (= ~q_write_ev~0 0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse25 (= ~c_dr_st~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (and (and (and .cse19 .cse20 .cse3 .cse4 .cse21 .cse7 .cse11) .cse6) .cse22) .cse23) (and (and (and (and .cse19 .cse20 .cse3 .cse4 .cse11) .cse18 .cse6) .cse22) .cse0 .cse23) (and .cse24 .cse13 .cse18 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse4 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse24 .cse13 .cse26 .cse16) (and .cse0 (and .cse22 (and .cse24 .cse18 .cse27 .cse25)) .cse23) (and .cse2 .cse13 .cse18 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse9 .cse11)) (and .cse0 .cse2 .cse13 .cse14 .cse5 .cse6 .cse22 .cse8 .cse10 (and .cse19 .cse20 .cse3 .cse4 .cse15 .cse21 .cse7 .cse9 .cse11)) (and .cse24 .cse13 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11) (and .cse28 .cse23) (and .cse0 .cse18 .cse23 .cse21 .cse8 .cse10 .cse11 .cse25 .cse12 .cse29 .cse24 .cse13 .cse26 .cse16) (and .cse0 .cse28) (and .cse23 .cse1) (and .cse0 .cse24 .cse13 .cse18 .cse4 .cse6 .cse22 .cse21 .cse11) (and .cse0 (and (and .cse24 (and .cse30 .cse31 .cse21 .cse11) .cse18 .cse6) .cse22) .cse29 .cse23) (and .cse2 .cse3 .cse18 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))))) [2019-10-22 08:58:48,641 INFO L439 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (= 0 ~q_free~0) (<= 2 ~p_dw_st~0) (<= 2 ~q_write_ev~0) (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse0) (= ~c_dr_pc~0 1) (<= 2 ~q_read_ev~0) (= ~p_last_write~0 ~q_buf_0~0))) [2019-10-22 08:58:48,641 INFO L443 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2019-10-22 08:58:48,641 INFO L439 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse10 (= ~c_num_read~0 0)) (.cse6 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse8 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (= ~c_dr_pc~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse12 (= 0 ~p_num_write~0)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse9 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 2 ~c_dr_st~0))) (or (and (= 0 ~q_free~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ~q_req_up~0 0) .cse6 .cse7 .cse8 .cse9 .cse3 .cse4 .cse5 (= ~c_dr_st~0 0) .cse10 .cse0 .cse11 .cse2 .cse12) (and .cse10 .cse6 .cse0 .cse11 .cse7 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12) (and (and (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (and .cse7 .cse9 .cse5)) .cse1) (= ~c_dr_pc~0 1)))) [2019-10-22 08:58:48,641 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:58:48,642 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-10-22 08:58:48,642 INFO L439 ceAbstractionStarter]: At program point L313-2(lines 283 287) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_dr_st~0)) (.cse5 (= 0 ~p_dw_st~0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse1 (= ~q_free~0 1)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= 0 ~p_dw_pc~0)) (.cse8 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= ~c_dr_st~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ~q_req_up~0 0) .cse0 .cse1 .cse2 .cse3 (<= 2 ~q_read_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-10-22 08:58:48,642 INFO L443 ceAbstractionStarter]: For program point L313-3(lines 313 317) no Hoare annotation was computed. [2019-10-22 08:58:48,642 INFO L439 ceAbstractionStarter]: At program point L313-5(lines 283 287) the Hoare annotation is: (let ((.cse31 (+ ~c_num_read~0 1))) (let ((.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (= ~q_free~0 1)) (.cse29 (<= .cse31 ~p_num_write~0)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse30 (<= ~p_num_write~0 .cse31)) (.cse15 (<= 2 ~q_read_ev~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse25 (and .cse29 .cse14 .cse30 .cse15 .cse17)) (.cse27 (= 1 ~p_num_write~0)) (.cse16 (= 0 ~p_dw_st~0)) (.cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse17)) (.cse28 (= ~q_write_ev~0 1)) (.cse18 (= ~p_dw_pc~0 1)) (.cse0 (<= ~q_req_up~0 0)) (.cse19 (= 0 ~q_free~0)) (.cse6 (<= 2 ~c_dr_st~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse1 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse21 (= 0 ~p_dw_pc~0)) (.cse9 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse26 (= ~c_dr_st~0 0)) (.cse22 (= ~c_num_read~0 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse4 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse1 .cse2 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9) (and .cse19 .cse2 .cse3 .cse5 .cse6 .cse20 .cse8 .cse9 .cse17) (and .cse1 .cse13 .cse14 .cse5 .cse6 .cse16 .cse8 .cse21 .cse9 .cse17 .cse22 .cse2 .cse4 .cse23 .cse20 .cse24) (and .cse1 .cse13 .cse3 .cse14 .cse5 .cse6 .cse8 .cse21 .cse9 .cse17 .cse22 .cse2 .cse4 .cse23 .cse20 .cse24) (and .cse0 .cse1 .cse3 .cse25 .cse5 .cse18 .cse7 .cse8 .cse9 .cse26 .cse19 .cse2 .cse4) (and .cse1 .cse19 .cse2 .cse3 .cse4 .cse25 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse13 .cse14 .cse5 .cse15 .cse16 .cse8 .cse21 .cse9 .cse17 .cse26 .cse22 .cse2 .cse4 .cse23 .cse20 .cse24) (and .cse1 .cse3 .cse14 .cse5 .cse18 .cse15 .cse8 .cse9 .cse17 .cse26 .cse22 .cse19 .cse2 .cse4 .cse27 .cse20) (and .cse0 .cse1 .cse3 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse19 .cse2 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse11 .cse12 .cse13 .cse14 .cse23 .cse21 .cse17)) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse18 .cse15 .cse8 .cse9 .cse17 .cse26 .cse22 .cse19 .cse2 .cse4 .cse27 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse21 .cse17)) (and .cse19 .cse2 .cse6 .cse16 .cse20 .cse8 .cse9 .cse17) (and .cse0 .cse2 (and .cse6 (and .cse11 .cse12 .cse13 .cse14 .cse16 .cse17)) .cse18 .cse7 .cse8 .cse9 (= ~q_read_ev~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse28 (and .cse1 .cse19 (and .cse29 .cse30 .cse15 .cse17) .cse3 .cse4 .cse5 .cse7 .cse26) .cse18) (and .cse0 .cse2 (and (and .cse11 .cse12 .cse13 .cse14 .cse17) .cse3 .cse5 .cse6) .cse18 .cse7 .cse8 .cse9) (and .cse28 .cse18 (or (and .cse0 (and .cse1 .cse2 (and .cse11 .cse12 .cse13 .cse15 .cse17) .cse3 .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse17))) (and .cse1 .cse13 .cse3 .cse14 .cse5 .cse8 .cse21 .cse9 .cse17 .cse26 .cse22 .cse2 .cse4 .cse23 .cse20 .cse24))))) [2019-10-22 08:58:48,642 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-10-22 08:58:48,643 INFO L443 ceAbstractionStarter]: For program point L330(line 330) no Hoare annotation was computed. [2019-10-22 08:58:48,643 INFO L439 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse3 (= 0 ~p_dw_st~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse1 (= ~q_free~0 1)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse4 (= 0 ~p_dw_pc~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 0 ~p_num_write~0))) (or (and (<= ~q_req_up~0 0) .cse0 .cse1 .cse2 (<= 2 ~q_read_ev~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse8 .cse3 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse12 .cse2 .cse8 .cse9 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse12 .cse2 .cse11 .cse8 .cse9 .cse4 .cse5 .cse10))) [2019-10-22 08:58:48,643 INFO L439 ceAbstractionStarter]: At program point L66-1(lines 54 68) the Hoare annotation is: (let ((.cse29 (+ ~c_num_read~0 1))) (let ((.cse27 (<= .cse29 ~p_num_write~0)) (.cse28 (<= ~p_num_write~0 .cse29)) (.cse8 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~c_dr_st~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse1 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= 2 ~q_read_ev~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse25 (= 1 ~p_num_write~0)) (.cse24 (= ~q_write_ev~0 1)) (.cse23 (and .cse8 .cse13 .cse9 .cse10 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7))) (.cse12 (= 0 ~q_free~0)) (.cse14 (and .cse27 .cse4 .cse28 .cse5 .cse7)) (.cse6 (= 0 ~p_dw_st~0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse20 (= 0 ~p_dw_pc~0)) (.cse18 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse15 (= ~c_dr_st~0 0)) (.cse21 (= ~c_num_read~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse22 (= 0 ~p_num_write~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse26 (and .cse1 .cse2 .cse3 .cse4 .cse7))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10) .cse11) (and .cse0 (and .cse8 .cse12 .cse13 .cse14 .cse10 .cse15) .cse11) (and .cse12 .cse9 .cse6 .cse16 .cse17 .cse18 .cse7) (and .cse8 .cse13 .cse9 .cse10 .cse17 .cse18 (and .cse1 .cse2 .cse3 .cse4 .cse19 .cse20 .cse7)) (and .cse8 .cse3 .cse13 .cse4 .cse17 .cse20 .cse18 .cse7 .cse15 .cse21 .cse19 .cse16 .cse22) (and .cse12 .cse13 .cse9 .cse16 .cse17 .cse18 .cse7) (and .cse0 .cse23) (and .cse0 .cse8 .cse13 .cse24 .cse11 .cse5 .cse17 .cse18 .cse7 .cse15 .cse21 .cse12 .cse25 .cse16) (and .cse0 .cse8 .cse9 .cse10 .cse17 .cse18 (and .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse20 .cse7)) (and .cse0 .cse11 (= ~q_read_ev~0 1) (and .cse26 .cse13 .cse9 .cse10)) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse17 .cse20 .cse18 .cse7 .cse21 .cse19 .cse16 .cse22) (and .cse8 .cse3 .cse4 .cse9 .cse6 .cse17 .cse20 .cse18 .cse7 .cse21 .cse19 .cse16 .cse22) (and .cse8 .cse13 .cse4 .cse11 .cse5 .cse17 .cse18 .cse7 .cse15 .cse21 .cse12 .cse25 .cse16) (and .cse0 .cse24 .cse11 (and .cse8 .cse12 (and .cse27 .cse28 .cse5 .cse7) .cse13 .cse9 .cse10)) (and .cse0 .cse8 .cse12 .cse13 .cse4 .cse9 .cse10 .cse5 .cse7) (and .cse23 .cse11) (and .cse11 (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10)) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse6 .cse17 .cse20 .cse18 .cse7 .cse15 .cse21 .cse19 .cse16 .cse22) (and .cse0 .cse11 (and .cse8 .cse26 .cse13 .cse9 .cse10)))))) [2019-10-22 08:58:48,643 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-10-22 08:58:48,643 INFO L443 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2019-10-22 08:58:48,643 INFO L439 ceAbstractionStarter]: At program point L232-1(lines 265 269) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse1 (= ~q_free~0 1)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 0 ~p_dw_st~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= 0 ~p_dw_pc~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse9 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (and .cse0 (<= ~q_req_up~0 0) .cse1 .cse3 .cse5 (<= 2 ~q_read_ev~0) .cse10 .cse6 .cse7 .cse8 .cse11 .cse9))) [2019-10-22 08:58:48,644 INFO L443 ceAbstractionStarter]: For program point L265-2(lines 265 269) no Hoare annotation was computed. [2019-10-22 08:58:48,644 INFO L443 ceAbstractionStarter]: For program point L265-4(lines 264 277) no Hoare annotation was computed. [2019-10-22 08:58:48,645 INFO L439 ceAbstractionStarter]: At program point L67(lines 51 69) the Hoare annotation is: (let ((.cse6 (<= 2 ~c_dr_st~0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse4 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= ~c_dr_st~0 0)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= ~q_req_up~0 0) .cse1 .cse2 .cse5 (<= 2 ~q_read_ev~0) .cse12 .cse9 .cse10 .cse13 .cse0 .cse4 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11))) [2019-10-22 08:58:48,645 INFO L439 ceAbstractionStarter]: At program point L67-1(lines 51 69) the Hoare annotation is: (let ((.cse30 (+ ~c_num_read~0 1))) (let ((.cse28 (<= .cse30 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 .cse30)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse11 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse14 (<= 2 ~c_dr_st~0)) (.cse18 (= ~c_dr_pc~0 1)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~q_free~0 1)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse12 (= 1 ~p_num_write~0)) (.cse26 (= ~q_write_ev~0 1)) (.cse27 (and .cse19 .cse20 .cse21 .cse2 .cse7)) (.cse17 (and .cse0 .cse1 .cse11 .cse14 .cse18 (and .cse19 .cse20 .cse21 .cse2 .cse4 .cse7))) (.cse9 (= ~c_num_read~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse10 (= 0 ~q_free~0)) (.cse25 (and .cse28 .cse2 .cse29 .cse4 .cse7)) (.cse8 (= ~c_dr_st~0 0)) (.cse16 (<= ~q_req_up~0 0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse23 (= 0 ~p_dw_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse10 .cse14 .cse15 .cse13 .cse5 .cse6 .cse7) (and .cse16 .cse17) (and .cse0 .cse1 .cse11 .cse14 .cse18 .cse5 .cse6 (and .cse19 .cse20 .cse21 .cse2 .cse22 .cse23 .cse7)) (and .cse0 .cse21 .cse1 .cse2 .cse14 .cse5 .cse23 .cse6 .cse7 .cse9 .cse11 .cse22 .cse13 .cse24) (and (and .cse0 .cse10 .cse1 .cse11 .cse25 .cse14 .cse18) .cse3) (and .cse16 .cse0 .cse21 .cse2 .cse4 .cse15 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse22 .cse13 .cse24) (and .cse16 .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse16 .cse3 (and .cse0 .cse27 .cse1 .cse11 .cse14 .cse18)) (and .cse10 .cse1 .cse14 .cse13 .cse5 .cse6 .cse7) (and .cse16 .cse0 .cse10 .cse1 .cse11 .cse2 .cse14 .cse18 .cse4 .cse7) (and .cse16 .cse26 .cse3 (and .cse0 .cse10 (and .cse28 .cse29 .cse4 .cse7) .cse1 .cse11 .cse14 .cse18)) (and .cse16 (and (and .cse19 .cse20 .cse21 .cse2 .cse4 .cse15 .cse7) .cse0 .cse11 .cse14 .cse18) .cse3) (and .cse16 .cse3 (= ~q_read_ev~0 1) (and .cse27 .cse1 .cse14 .cse18)) (and .cse0 .cse21 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse22 .cse13 .cse24) (and .cse3 .cse17) (and .cse0 .cse21 .cse2 .cse14 .cse15 .cse5 .cse23 .cse6 .cse7 .cse9 .cse11 .cse22 .cse13 .cse24) (and .cse16 .cse3 (and .cse0 .cse10 .cse1 .cse11 .cse25 .cse18 .cse8)) (and .cse16 .cse0 .cse11 .cse14 .cse18 .cse5 .cse6 (and .cse19 .cse20 .cse21 .cse2 .cse22 .cse4 .cse15 .cse23 .cse7)))))) [2019-10-22 08:58:48,645 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-10-22 08:58:48,645 INFO L443 ceAbstractionStarter]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2019-10-22 08:58:48,645 INFO L446 ceAbstractionStarter]: At program point L464(lines 455 466) the Hoare annotation is: true [2019-10-22 08:58:48,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:48 BoogieIcfgContainer [2019-10-22 08:58:48,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:48,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:48,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:48,770 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:48,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:23" (3/4) ... [2019-10-22 08:58:48,774 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:58:48,788 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 08:58:48,790 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:58:48,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) [2019-10-22 08:58:48,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (((((((((((((q_req_up <= 0 && 2 <= p_dw_st) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && (((0 == q_free && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_write_ev == 0) && p_dw_pc == 1)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (((q_req_up <= 0 && (((0 == q_free && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_write_ev == 1) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((q_req_up <= 0 && q_write_ev == 1) && 2 <= p_dw_st) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((q_req_up <= 0 && ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1) || ((q_req_up <= 0 && ((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_pc == 1) && c_dr_st == 0) && p_dw_pc == 1)) || ((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (q_req_up <= 0 && (((0 == __retres1 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((q_req_up <= 0 && 0 == __retres1) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && p_dw_pc == 1) && q_read_ev == 1) && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0)) || (((q_req_up <= 0 && q_write_ev == 1) && p_dw_pc == 1) && ((((0 == __retres1 && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((0 == __retres1 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (p_dw_pc == 1 && ((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && p_dw_pc == 1) && (((0 == __retres1 && (((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) [2019-10-22 08:58:48,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0) || ((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (q_req_up <= 0 && ((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && p_dw_pc == 1) && ((((0 == __retres1 && (((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && q_write_ev == 1) && p_dw_pc == 1) && (((((0 == __retres1 && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((q_req_up <= 0 && (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((q_req_up <= 0 && p_dw_pc == 1) && q_read_ev == 1) && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && ((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && p_dw_pc == 1) && (((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_pc == 1) && c_dr_st == 0)) || (((((((q_req_up <= 0 && 0 == __retres1) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) [2019-10-22 08:58:48,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || ((((((((((c_num_read == 0 && 0 == q_free) && tmp___0 == 0) && 2 <= q_write_ev) && 1 == p_num_write) && 2 <= q_read_ev) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0)) || (c_dr_pc == 1 && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read == 0 && ((q_free == 1 && 2 <= q_write_ev) && c_dr_pc == 0) && p_last_write == q_buf_0) && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == \result) && 0 == p_num_write)) || (c_dr_pc == 1 && (0 == q_free && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) [2019-10-22 08:58:48,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= q_write_ev && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) [2019-10-22 08:58:48,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((tmp___0 == 0 && __retres1 == 0) && 0 == \result) && (((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (p_dw_pc == 1 && ((tmp___0 == 0 && (0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && __retres1 == 0) && 0 == \result)) || ((((q_req_up <= 0 && tmp___0 == 0) && __retres1 == 0) && 0 == \result) && ((0 == __retres1 && 0 == \result) && 0 == tmp) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) [2019-10-22 08:58:48,825 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && c_dr_st == 0) || (((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && p_last_write == q_buf_0)) || (((((((q_req_up <= 0 && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((q_req_up <= 0 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((((q_req_up <= 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0)) || (((((q_req_up <= 0 && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && q_read_ev == 1)) || ((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((0 == q_free && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && p_last_write == q_buf_0)) || ((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) [2019-10-22 08:58:48,826 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == q_free) && 0 == \result)) || ((((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((q_req_up <= 0 && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && q_read_ev == 1)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((q_req_up <= 0 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || (((((((0 == q_free && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((q_req_up <= 0 && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((q_req_up <= 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((((((((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_st == 0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) [2019-10-22 08:58:48,826 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || ((((((((((q_req_up <= 0 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_st == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result)) || (((((((((((0 == __retres1 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == q_free) && tmp___0 == 0) && 0 == \result)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((q_req_up <= 0 && tmp___0 == 0) && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && q_read_ev == 1)) || ((((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && q_write_ev == 1) && ((((((0 == __retres1 && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && c_dr_pc == 1) && c_dr_st == 0) && p_dw_pc == 1)) || ((((((q_req_up <= 0 && tmp___0 == 0) && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((q_write_ev == 1 && p_dw_pc == 1) && ((q_req_up <= 0 && ((((((0 == __retres1 && tmp___0 == 0) && (((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) || ((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)))) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,827 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,827 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) [2019-10-22 08:58:48,871 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ea301da6-1ffb-4638-be23-0abdfde5791a/bin/uautomizer/witness.graphml [2019-10-22 08:58:48,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:48,874 INFO L168 Benchmark]: Toolchain (without parser) took 26221.12 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -249.4 MB). Peak memory consumption was 869.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,874 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:48,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,875 INFO L168 Benchmark]: Boogie Preprocessor took 25.73 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. [2019-10-22 08:58:48,875 INFO L168 Benchmark]: RCFGBuilder took 486.78 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,875 INFO L168 Benchmark]: TraceAbstraction took 25264.53 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 975.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -128.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,876 INFO L168 Benchmark]: Witness Printer took 102.82 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:48,877 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.73 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. * RCFGBuilder took 486.78 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25264.53 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 975.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -128.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 102.82 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (((((((((((((q_req_up <= 0 && 2 <= p_dw_st) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && (((0 == q_free && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_write_ev == 0) && p_dw_pc == 1)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && q_req_up <= 0) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0 && q_req_up <= 0) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || ((((((((((q_req_up <= 0 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_st == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result)) || (((((((((((0 == __retres1 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == q_free) && tmp___0 == 0) && 0 == \result)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((q_req_up <= 0 && tmp___0 == 0) && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && q_read_ev == 1)) || ((((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && q_write_ev == 1) && ((((((0 == __retres1 && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && c_dr_pc == 1) && c_dr_st == 0) && p_dw_pc == 1)) || ((((((q_req_up <= 0 && tmp___0 == 0) && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((q_write_ev == 1 && p_dw_pc == 1) && ((q_req_up <= 0 && ((((((0 == __retres1 && tmp___0 == 0) && (((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) || ((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)))) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || ((((((((((c_num_read == 0 && 0 == q_free) && tmp___0 == 0) && 2 <= q_write_ev) && 1 == p_num_write) && 2 <= q_read_ev) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0)) || (c_dr_pc == 1 && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read == 0 && ((q_free == 1 && 2 <= q_write_ev) && c_dr_pc == 0) && p_last_write == q_buf_0) && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == \result) && 0 == p_num_write)) || (c_dr_pc == 1 && (0 == q_free && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (((q_req_up <= 0 && (((0 == q_free && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_write_ev == 1) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((q_req_up <= 0 && q_write_ev == 1) && 2 <= p_dw_st) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0) || ((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (q_req_up <= 0 && ((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && p_dw_pc == 1) && ((((0 == __retres1 && (((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && q_write_ev == 1) && p_dw_pc == 1) && (((((0 == __retres1 && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((q_req_up <= 0 && (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((q_req_up <= 0 && p_dw_pc == 1) && q_read_ev == 1) && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && ((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && p_dw_pc == 1) && (((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_pc == 1) && c_dr_st == 0)) || (((((((q_req_up <= 0 && 0 == __retres1) && 0 == \result) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && q_req_up <= 0) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= q_write_ev && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0 && q_req_up <= 0) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && c_dr_st == 0) || (((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && p_last_write == q_buf_0)) || (((((((q_req_up <= 0 && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0)) || (((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((q_req_up <= 0 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((((q_req_up <= 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0)) || (((((q_req_up <= 0 && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && q_read_ev == 1)) || ((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((0 == q_free && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && p_last_write == q_buf_0)) || ((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((tmp___0 == 0 && __retres1 == 0) && 0 == \result) && (((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (p_dw_pc == 1 && ((tmp___0 == 0 && (0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && __retres1 == 0) && 0 == \result)) || ((((q_req_up <= 0 && tmp___0 == 0) && __retres1 == 0) && 0 == \result) && ((0 == __retres1 && 0 == \result) && 0 == tmp) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == q_free) && 0 == \result)) || ((((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((q_req_up <= 0 && 2 <= c_dr_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && q_read_ev == 1)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((q_req_up <= 0 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || (((((((0 == q_free && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((q_req_up <= 0 && 0 == __retres1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((q_req_up <= 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((((((((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result)) || ((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_st == 0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && p_dw_pc == 1) && c_dr_pc == 1) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((q_req_up <= 0 && ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 0 == __retres1) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1) || ((q_req_up <= 0 && ((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_pc == 1) && c_dr_st == 0) && p_dw_pc == 1)) || ((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (q_req_up <= 0 && (((0 == __retres1 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((q_req_up <= 0 && 0 == __retres1) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((q_req_up <= 0 && p_dw_pc == 1) && q_read_ev == 1) && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0)) || (((q_req_up <= 0 && q_write_ev == 1) && p_dw_pc == 1) && ((((0 == __retres1 && 0 == q_free) && ((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((0 == __retres1 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (p_dw_pc == 1 && ((((0 == __retres1 && 0 == q_free) && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && p_dw_pc == 1) && (((0 == __retres1 && (((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((q_req_up <= 0 && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (p_dw_pc == 1 && (tmp___0 == 0 && c_dr_pc == 1) && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && 2 <= c_dr_st)) || (q_req_up <= 0 && (tmp___0 == 0 && c_dr_pc == 1) && ((2 <= p_dw_st && 0 == tmp) && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && (tmp___0 == 0 && ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((q_req_up <= 0 && p_dw_pc == 1) && c_dr_pc == 1 && (((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 0 == tmp) && c_dr_st == 0)) || (q_req_up <= 0 && (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) || ((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || ((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write)) || ((((((((((c_num_read == 0 && 0 == __retres1) && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((((q_req_up <= 0 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((q_req_up <= 0 && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 <= c_dr_st) && c_dr_pc == 1) && p_dw_pc == 1)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && p_last_write == q_buf_0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= 0) && p_dw_pc == 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && q_free == 1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && p_dw_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || ((q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && p_dw_pc == 1)) || (((((((((0 == __retres1 && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_dw_pc == 1)) || (q_req_up <= 0 && c_dr_pc == 1 && ((0 == q_free && 2 <= p_dw_st) && (((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 2 <= c_dr_st)) || (p_dw_pc == 1 && c_dr_pc == 1 && (2 <= p_dw_st && 2 <= c_dr_st) && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((0 == __retres1 && q_free == 1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 2 error locations. Result: SAFE, OverallTime: 25.0s, OverallIterations: 20, TraceHistogramMax: 5, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.5s, HoareTripleCheckerStatistics: 2973 SDtfs, 2477 SDslu, 3468 SDs, 0 SdLazy, 279 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4703occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 10890 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 806 NumberOfFragments, 14956 HoareAnnotationTreeSize, 33 FomulaSimplifications, 60286 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 33 FomulaSimplificationsInter, 46100 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1601 NumberOfCodeBlocks, 1601 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1580 ConstructedInterpolants, 0 QuantifiedInterpolants, 222608 SizeOfPredicates, 2 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 644/648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...