./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/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/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-11-15 20:47:51,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:47:51,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:47:51,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:47:51,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:47:51,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:47:51,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:47:51,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:47:51,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:47:51,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:47:51,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:47:51,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:47:51,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:47:51,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:47:51,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:47:51,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:47:51,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:47:51,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:47:51,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:47:51,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:47:51,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:47:51,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:47:51,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:47:51,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:47:51,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:47:51,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:47:51,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:47:51,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:47:51,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:47:51,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:47:51,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:47:51,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:47:51,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:47:51,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:47:51,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:47:51,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:47:51,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:47:51,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:47:51,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:47:51,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:47:51,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:47:51,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:47:51,561 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:47:51,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:47:51,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:47:51,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:47:51,563 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:47:51,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:47:51,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:47:51,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:47:51,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:47:51,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:47:51,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:47:51,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:47:51,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:47:51,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:47:51,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:47:51,565 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:47:51,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:47:51,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:47:51,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:47:51,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:47:51,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:47:51,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:47:51,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:47:51,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:47:51,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:47:51,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:47:51,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:47:51,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:47:51,568 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/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/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-11-15 20:47:51,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:47:51,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:47:51,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:47:51,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:47:51,607 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:47:51,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-11-15 20:47:51,658 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/data/3822b8830/924f5c5c54fa4ccc9661de8475c98d22/FLAGa3c0cf30b [2019-11-15 20:47:52,109 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:47:52,109 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-11-15 20:47:52,121 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/data/3822b8830/924f5c5c54fa4ccc9661de8475c98d22/FLAGa3c0cf30b [2019-11-15 20:47:52,627 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/data/3822b8830/924f5c5c54fa4ccc9661de8475c98d22 [2019-11-15 20:47:52,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:47:52,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:47:52,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:47:52,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:47:52,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:47:52,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:47:52" (1/1) ... [2019-11-15 20:47:52,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277e830e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:52, skipping insertion in model container [2019-11-15 20:47:52,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:47:52" (1/1) ... [2019-11-15 20:47:52,647 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:47:52,681 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:47:52,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:47:52,940 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:47:52,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:47:53,013 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:47:53,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53 WrapperNode [2019-11-15 20:47:53,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:47:53,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:47:53,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:47:53,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:47:53,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:47:53,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:47:53,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:47:53,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:47:53,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... [2019-11-15 20:47:53,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:47:53,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:47:53,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:47:53,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:47:53,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/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-11-15 20:47:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:47:53,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:47:53,638 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:47:53,638 INFO L284 CfgBuilder]: Removed 58 assume(true) statements. [2019-11-15 20:47:53,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:47:53 BoogieIcfgContainer [2019-11-15 20:47:53,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:47:53,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:47:53,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:47:53,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:47:53,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:47:52" (1/3) ... [2019-11-15 20:47:53,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729bf372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:47:53, skipping insertion in model container [2019-11-15 20:47:53,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:53" (2/3) ... [2019-11-15 20:47:53,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729bf372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:47:53, skipping insertion in model container [2019-11-15 20:47:53,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:47:53" (3/3) ... [2019-11-15 20:47:53,647 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-11-15 20:47:53,655 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:47:53,661 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-15 20:47:53,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-15 20:47:53,696 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:47:53,696 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:47:53,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:47:53,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:47:53,697 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:47:53,697 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:47:53,697 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:47:53,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:47:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2019-11-15 20:47:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 20:47:53,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:53,721 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-11-15 20:47:53,723 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595671, now seen corresponding path program 1 times [2019-11-15 20:47:53,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:53,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259016970] [2019-11-15 20:47:53,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:53,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:53,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:53,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259016970] [2019-11-15 20:47:53,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:53,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:53,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155753104] [2019-11-15 20:47:53,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:53,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:53,923 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2019-11-15 20:47:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:54,062 INFO L93 Difference]: Finished difference Result 266 states and 419 transitions. [2019-11-15 20:47:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:54,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 20:47:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:54,076 INFO L225 Difference]: With dead ends: 266 [2019-11-15 20:47:54,076 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 20:47:54,080 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-11-15 20:47:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 20:47:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2019-11-15 20:47:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 20:47:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2019-11-15 20:47:54,134 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2019-11-15 20:47:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:54,134 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2019-11-15 20:47:54,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2019-11-15 20:47:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 20:47:54,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:54,137 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-11-15 20:47:54,138 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash 32121146, now seen corresponding path program 1 times [2019-11-15 20:47:54,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:54,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854309986] [2019-11-15 20:47:54,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:54,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854309986] [2019-11-15 20:47:54,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:54,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:54,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833473377] [2019-11-15 20:47:54,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:54,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:54,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:54,197 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 3 states. [2019-11-15 20:47:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:54,281 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2019-11-15 20:47:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:54,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 20:47:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:54,285 INFO L225 Difference]: With dead ends: 489 [2019-11-15 20:47:54,285 INFO L226 Difference]: Without dead ends: 335 [2019-11-15 20:47:54,287 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-11-15 20:47:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-15 20:47:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2019-11-15 20:47:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-15 20:47:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 481 transitions. [2019-11-15 20:47:54,323 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 481 transitions. Word has length 39 [2019-11-15 20:47:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:54,324 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 481 transitions. [2019-11-15 20:47:54,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 481 transitions. [2019-11-15 20:47:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 20:47:54,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:54,327 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-11-15 20:47:54,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1962023560, now seen corresponding path program 1 times [2019-11-15 20:47:54,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:54,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134588982] [2019-11-15 20:47:54,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:54,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134588982] [2019-11-15 20:47:54,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:54,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:54,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238579734] [2019-11-15 20:47:54,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:54,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:54,378 INFO L87 Difference]: Start difference. First operand 331 states and 481 transitions. Second operand 3 states. [2019-11-15 20:47:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:54,466 INFO L93 Difference]: Finished difference Result 855 states and 1233 transitions. [2019-11-15 20:47:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:54,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 20:47:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:54,475 INFO L225 Difference]: With dead ends: 855 [2019-11-15 20:47:54,475 INFO L226 Difference]: Without dead ends: 615 [2019-11-15 20:47:54,477 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-11-15 20:47:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-15 20:47:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2019-11-15 20:47:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-15 20:47:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 869 transitions. [2019-11-15 20:47:54,534 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 869 transitions. Word has length 39 [2019-11-15 20:47:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:54,535 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 869 transitions. [2019-11-15 20:47:54,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 869 transitions. [2019-11-15 20:47:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:47:54,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:54,546 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-11-15 20:47:54,546 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:54,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:54,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1461928521, now seen corresponding path program 1 times [2019-11-15 20:47:54,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:54,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147128025] [2019-11-15 20:47:54,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:54,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147128025] [2019-11-15 20:47:54,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:54,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:54,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597219908] [2019-11-15 20:47:54,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:54,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:54,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:54,610 INFO L87 Difference]: Start difference. First operand 611 states and 869 transitions. Second operand 3 states. [2019-11-15 20:47:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:54,664 INFO L93 Difference]: Finished difference Result 1523 states and 2157 transitions. [2019-11-15 20:47:54,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:54,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-15 20:47:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:54,670 INFO L225 Difference]: With dead ends: 1523 [2019-11-15 20:47:54,671 INFO L226 Difference]: Without dead ends: 1023 [2019-11-15 20:47:54,672 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-11-15 20:47:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-11-15 20:47:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 979. [2019-11-15 20:47:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-11-15 20:47:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1361 transitions. [2019-11-15 20:47:54,720 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1361 transitions. Word has length 40 [2019-11-15 20:47:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:54,720 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1361 transitions. [2019-11-15 20:47:54,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1361 transitions. [2019-11-15 20:47:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:47:54,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:54,723 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-11-15 20:47:54,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1414888532, now seen corresponding path program 1 times [2019-11-15 20:47:54,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:54,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919911839] [2019-11-15 20:47:54,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:54,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919911839] [2019-11-15 20:47:54,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:54,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:54,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095351210] [2019-11-15 20:47:54,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:54,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:54,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:54,771 INFO L87 Difference]: Start difference. First operand 979 states and 1361 transitions. Second operand 3 states. [2019-11-15 20:47:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:54,892 INFO L93 Difference]: Finished difference Result 2628 states and 3649 transitions. [2019-11-15 20:47:54,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:54,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-15 20:47:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:54,902 INFO L225 Difference]: With dead ends: 2628 [2019-11-15 20:47:54,903 INFO L226 Difference]: Without dead ends: 1693 [2019-11-15 20:47:54,905 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-11-15 20:47:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-11-15 20:47:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1653. [2019-11-15 20:47:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-11-15 20:47:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2260 transitions. [2019-11-15 20:47:54,981 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2260 transitions. Word has length 40 [2019-11-15 20:47:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:54,982 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 2260 transitions. [2019-11-15 20:47:54,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2260 transitions. [2019-11-15 20:47:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:47:54,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:54,984 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-11-15 20:47:54,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:54,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2068899576, now seen corresponding path program 1 times [2019-11-15 20:47:54,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:54,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699809804] [2019-11-15 20:47:54,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:54,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:55,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699809804] [2019-11-15 20:47:55,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:55,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:55,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14973978] [2019-11-15 20:47:55,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:55,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:55,032 INFO L87 Difference]: Start difference. First operand 1653 states and 2260 transitions. Second operand 3 states. [2019-11-15 20:47:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:55,137 INFO L93 Difference]: Finished difference Result 3689 states and 5014 transitions. [2019-11-15 20:47:55,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:55,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-15 20:47:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:55,150 INFO L225 Difference]: With dead ends: 3689 [2019-11-15 20:47:55,150 INFO L226 Difference]: Without dead ends: 2065 [2019-11-15 20:47:55,153 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-11-15 20:47:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2019-11-15 20:47:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 2021. [2019-11-15 20:47:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-11-15 20:47:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2730 transitions. [2019-11-15 20:47:55,251 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2730 transitions. Word has length 45 [2019-11-15 20:47:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:55,252 INFO L462 AbstractCegarLoop]: Abstraction has 2021 states and 2730 transitions. [2019-11-15 20:47:55,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2730 transitions. [2019-11-15 20:47:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:47:55,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:55,255 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-11-15 20:47:55,255 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1733130536, now seen corresponding path program 1 times [2019-11-15 20:47:55,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:55,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692227758] [2019-11-15 20:47:55,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:55,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:55,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:55,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692227758] [2019-11-15 20:47:55,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:55,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:47:55,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526620314] [2019-11-15 20:47:55,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:47:55,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:55,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:47:55,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:47:55,384 INFO L87 Difference]: Start difference. First operand 2021 states and 2730 transitions. Second operand 4 states. [2019-11-15 20:47:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:55,471 INFO L93 Difference]: Finished difference Result 2439 states and 3292 transitions. [2019-11-15 20:47:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:47:55,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-15 20:47:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:55,487 INFO L225 Difference]: With dead ends: 2439 [2019-11-15 20:47:55,487 INFO L226 Difference]: Without dead ends: 2437 [2019-11-15 20:47:55,488 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-11-15 20:47:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-11-15 20:47:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2019. [2019-11-15 20:47:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-11-15 20:47:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2717 transitions. [2019-11-15 20:47:55,588 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2717 transitions. Word has length 46 [2019-11-15 20:47:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:55,589 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 2717 transitions. [2019-11-15 20:47:55,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:47:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2717 transitions. [2019-11-15 20:47:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 20:47:55,590 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:55,590 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-11-15 20:47:55,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2107539801, now seen corresponding path program 1 times [2019-11-15 20:47:55,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:55,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309777537] [2019-11-15 20:47:55,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:55,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:55,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:55,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309777537] [2019-11-15 20:47:55,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377543631] [2019-11-15 20:47:55,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/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-11-15 20:47:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:55,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:47:55,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:55,850 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:55,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-15 20:47:55,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296694886] [2019-11-15 20:47:55,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:47:55,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:55,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:47:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:47:55,852 INFO L87 Difference]: Start difference. First operand 2019 states and 2717 transitions. Second operand 7 states. [2019-11-15 20:47:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:56,142 INFO L93 Difference]: Finished difference Result 5451 states and 7392 transitions. [2019-11-15 20:47:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:47:56,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-15 20:47:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:56,171 INFO L225 Difference]: With dead ends: 5451 [2019-11-15 20:47:56,172 INFO L226 Difference]: Without dead ends: 5449 [2019-11-15 20:47:56,174 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-11-15 20:47:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-11-15 20:47:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 3949. [2019-11-15 20:47:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2019-11-15 20:47:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5343 transitions. [2019-11-15 20:47:56,475 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5343 transitions. Word has length 47 [2019-11-15 20:47:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:56,476 INFO L462 AbstractCegarLoop]: Abstraction has 3949 states and 5343 transitions. [2019-11-15 20:47:56,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:47:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5343 transitions. [2019-11-15 20:47:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 20:47:56,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:56,478 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-11-15 20:47:56,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:56,683 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1562188045, now seen corresponding path program 2 times [2019-11-15 20:47:56,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:56,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623777728] [2019-11-15 20:47:56,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:56,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:56,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:56,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623777728] [2019-11-15 20:47:56,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:56,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:56,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106363998] [2019-11-15 20:47:56,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:56,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:56,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:56,726 INFO L87 Difference]: Start difference. First operand 3949 states and 5343 transitions. Second operand 3 states. [2019-11-15 20:47:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:56,883 INFO L93 Difference]: Finished difference Result 5955 states and 8100 transitions. [2019-11-15 20:47:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:56,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 20:47:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:56,896 INFO L225 Difference]: With dead ends: 5955 [2019-11-15 20:47:56,897 INFO L226 Difference]: Without dead ends: 2461 [2019-11-15 20:47:56,902 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-11-15 20:47:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2019-11-15 20:47:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2429. [2019-11-15 20:47:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-11-15 20:47:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 3223 transitions. [2019-11-15 20:47:57,030 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 3223 transitions. Word has length 50 [2019-11-15 20:47:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:57,031 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 3223 transitions. [2019-11-15 20:47:57,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3223 transitions. [2019-11-15 20:47:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 20:47:57,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:57,033 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-11-15 20:47:57,033 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1320977374, now seen corresponding path program 1 times [2019-11-15 20:47:57,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:57,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179110495] [2019-11-15 20:47:57,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:57,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:57,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:57,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179110495] [2019-11-15 20:47:57,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:57,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:57,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938954005] [2019-11-15 20:47:57,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:57,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:57,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:57,069 INFO L87 Difference]: Start difference. First operand 2429 states and 3223 transitions. Second operand 3 states. [2019-11-15 20:47:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:57,291 INFO L93 Difference]: Finished difference Result 6935 states and 9176 transitions. [2019-11-15 20:47:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:57,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 20:47:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:57,315 INFO L225 Difference]: With dead ends: 6935 [2019-11-15 20:47:57,315 INFO L226 Difference]: Without dead ends: 4583 [2019-11-15 20:47:57,319 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-11-15 20:47:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-15 20:47:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4583. [2019-11-15 20:47:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-11-15 20:47:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5953 transitions. [2019-11-15 20:47:57,564 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5953 transitions. Word has length 54 [2019-11-15 20:47:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:57,564 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5953 transitions. [2019-11-15 20:47:57,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5953 transitions. [2019-11-15 20:47:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:47:57,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:57,567 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-11-15 20:47:57,568 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:57,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:57,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1050588449, now seen corresponding path program 1 times [2019-11-15 20:47:57,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:57,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895753072] [2019-11-15 20:47:57,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:57,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:57,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:47:57,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895753072] [2019-11-15 20:47:57,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:57,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:57,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803755562] [2019-11-15 20:47:57,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:57,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:57,605 INFO L87 Difference]: Start difference. First operand 4583 states and 5953 transitions. Second operand 3 states. [2019-11-15 20:47:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:57,880 INFO L93 Difference]: Finished difference Result 8165 states and 10658 transitions. [2019-11-15 20:47:57,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:57,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-15 20:47:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:57,904 INFO L225 Difference]: With dead ends: 8165 [2019-11-15 20:47:57,904 INFO L226 Difference]: Without dead ends: 4583 [2019-11-15 20:47:57,909 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-11-15 20:47:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-15 20:47:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4583. [2019-11-15 20:47:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-11-15 20:47:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5857 transitions. [2019-11-15 20:47:58,139 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5857 transitions. Word has length 61 [2019-11-15 20:47:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:58,139 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5857 transitions. [2019-11-15 20:47:58,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5857 transitions. [2019-11-15 20:47:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 20:47:58,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:58,143 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-11-15 20:47:58,143 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash -117700456, now seen corresponding path program 1 times [2019-11-15 20:47:58,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:58,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058684740] [2019-11-15 20:47:58,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:58,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:58,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:47:58,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058684740] [2019-11-15 20:47:58,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:58,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:58,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207305863] [2019-11-15 20:47:58,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:58,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:58,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:58,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:58,182 INFO L87 Difference]: Start difference. First operand 4583 states and 5857 transitions. Second operand 3 states. [2019-11-15 20:47:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:58,395 INFO L93 Difference]: Finished difference Result 8677 states and 11107 transitions. [2019-11-15 20:47:58,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:47:58,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-15 20:47:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:58,430 INFO L225 Difference]: With dead ends: 8677 [2019-11-15 20:47:58,431 INFO L226 Difference]: Without dead ends: 4585 [2019-11-15 20:47:58,436 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-11-15 20:47:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2019-11-15 20:47:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4583. [2019-11-15 20:47:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-11-15 20:47:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5713 transitions. [2019-11-15 20:47:58,707 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5713 transitions. Word has length 62 [2019-11-15 20:47:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:58,707 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5713 transitions. [2019-11-15 20:47:58,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:47:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5713 transitions. [2019-11-15 20:47:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 20:47:58,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:58,715 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-11-15 20:47:58,715 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1892541846, now seen corresponding path program 1 times [2019-11-15 20:47:58,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:58,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295400189] [2019-11-15 20:47:58,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:58,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:58,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:47:58,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295400189] [2019-11-15 20:47:58,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:58,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:47:58,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125223798] [2019-11-15 20:47:58,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:47:58,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:58,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:47:58,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:47:58,764 INFO L87 Difference]: Start difference. First operand 4583 states and 5713 transitions. Second operand 5 states. [2019-11-15 20:47:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:59,329 INFO L93 Difference]: Finished difference Result 14009 states and 17462 transitions. [2019-11-15 20:47:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:47:59,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-15 20:47:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:59,347 INFO L225 Difference]: With dead ends: 14009 [2019-11-15 20:47:59,347 INFO L226 Difference]: Without dead ends: 9885 [2019-11-15 20:47:59,354 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-11-15 20:47:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9885 states. [2019-11-15 20:47:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9885 to 4703. [2019-11-15 20:47:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4703 states. [2019-11-15 20:47:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 5769 transitions. [2019-11-15 20:47:59,733 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 5769 transitions. Word has length 89 [2019-11-15 20:47:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:59,733 INFO L462 AbstractCegarLoop]: Abstraction has 4703 states and 5769 transitions. [2019-11-15 20:47:59,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:47:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 5769 transitions. [2019-11-15 20:47:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 20:47:59,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:59,739 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-11-15 20:47:59,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:59,740 INFO L82 PathProgramCache]: Analyzing trace with hash -69278234, now seen corresponding path program 1 times [2019-11-15 20:47:59,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:59,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929824932] [2019-11-15 20:47:59,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:59,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:59,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:59,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929824932] [2019-11-15 20:47:59,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:59,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:47:59,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501017437] [2019-11-15 20:47:59,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:47:59,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:47:59,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:47:59,790 INFO L87 Difference]: Start difference. First operand 4703 states and 5769 transitions. Second operand 3 states. [2019-11-15 20:48:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:00,149 INFO L93 Difference]: Finished difference Result 7531 states and 9279 transitions. [2019-11-15 20:48:00,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:00,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-15 20:48:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:00,158 INFO L225 Difference]: With dead ends: 7531 [2019-11-15 20:48:00,159 INFO L226 Difference]: Without dead ends: 4777 [2019-11-15 20:48:00,163 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-11-15 20:48:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2019-11-15 20:48:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4687. [2019-11-15 20:48:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2019-11-15 20:48:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 5641 transitions. [2019-11-15 20:48:00,437 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 5641 transitions. Word has length 89 [2019-11-15 20:48:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:00,437 INFO L462 AbstractCegarLoop]: Abstraction has 4687 states and 5641 transitions. [2019-11-15 20:48:00,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 5641 transitions. [2019-11-15 20:48:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 20:48:00,442 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:00,443 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-11-15 20:48:00,443 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1125340559, now seen corresponding path program 1 times [2019-11-15 20:48:00,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:00,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231798508] [2019-11-15 20:48:00,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:00,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:00,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:48:00,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231798508] [2019-11-15 20:48:00,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:00,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:48:00,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480270596] [2019-11-15 20:48:00,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:48:00,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:48:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:48:00,498 INFO L87 Difference]: Start difference. First operand 4687 states and 5641 transitions. Second operand 5 states. [2019-11-15 20:48:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:00,920 INFO L93 Difference]: Finished difference Result 11329 states and 13692 transitions. [2019-11-15 20:48:00,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:48:00,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-11-15 20:48:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:00,932 INFO L225 Difference]: With dead ends: 11329 [2019-11-15 20:48:00,932 INFO L226 Difference]: Without dead ends: 6505 [2019-11-15 20:48:00,941 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-11-15 20:48:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6505 states. [2019-11-15 20:48:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6505 to 3411. [2019-11-15 20:48:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2019-11-15 20:48:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4075 transitions. [2019-11-15 20:48:01,202 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4075 transitions. Word has length 90 [2019-11-15 20:48:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:01,203 INFO L462 AbstractCegarLoop]: Abstraction has 3411 states and 4075 transitions. [2019-11-15 20:48:01,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:48:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4075 transitions. [2019-11-15 20:48:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:48:01,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:01,206 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-11-15 20:48:01,207 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2125598100, now seen corresponding path program 1 times [2019-11-15 20:48:01,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:01,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949174220] [2019-11-15 20:48:01,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:01,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:01,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 20:48:01,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949174220] [2019-11-15 20:48:01,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:01,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:01,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287517911] [2019-11-15 20:48:01,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:01,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:01,232 INFO L87 Difference]: Start difference. First operand 3411 states and 4075 transitions. Second operand 3 states. [2019-11-15 20:48:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:01,503 INFO L93 Difference]: Finished difference Result 8333 states and 9990 transitions. [2019-11-15 20:48:01,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:01,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-15 20:48:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:01,512 INFO L225 Difference]: With dead ends: 8333 [2019-11-15 20:48:01,512 INFO L226 Difference]: Without dead ends: 4816 [2019-11-15 20:48:01,517 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-11-15 20:48:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-11-15 20:48:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4437. [2019-11-15 20:48:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2019-11-15 20:48:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 5305 transitions. [2019-11-15 20:48:01,785 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 5305 transitions. Word has length 101 [2019-11-15 20:48:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:01,785 INFO L462 AbstractCegarLoop]: Abstraction has 4437 states and 5305 transitions. [2019-11-15 20:48:01,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 5305 transitions. [2019-11-15 20:48:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 20:48:01,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:01,791 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-11-15 20:48:01,791 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:01,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:01,791 INFO L82 PathProgramCache]: Analyzing trace with hash -459464668, now seen corresponding path program 1 times [2019-11-15 20:48:01,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:01,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972685599] [2019-11-15 20:48:01,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:01,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:01,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-15 20:48:01,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972685599] [2019-11-15 20:48:01,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:01,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:01,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861189803] [2019-11-15 20:48:01,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:01,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:01,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:01,840 INFO L87 Difference]: Start difference. First operand 4437 states and 5305 transitions. Second operand 3 states. [2019-11-15 20:48:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:02,144 INFO L93 Difference]: Finished difference Result 8727 states and 10456 transitions. [2019-11-15 20:48:02,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:02,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-15 20:48:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:02,153 INFO L225 Difference]: With dead ends: 8727 [2019-11-15 20:48:02,153 INFO L226 Difference]: Without dead ends: 4400 [2019-11-15 20:48:02,160 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-11-15 20:48:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-11-15 20:48:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4353. [2019-11-15 20:48:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4353 states. [2019-11-15 20:48:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 5057 transitions. [2019-11-15 20:48:02,555 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 5057 transitions. Word has length 152 [2019-11-15 20:48:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:02,556 INFO L462 AbstractCegarLoop]: Abstraction has 4353 states and 5057 transitions. [2019-11-15 20:48:02,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 5057 transitions. [2019-11-15 20:48:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 20:48:02,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:02,561 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-11-15 20:48:02,561 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1055203894, now seen corresponding path program 1 times [2019-11-15 20:48:02,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:02,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751120337] [2019-11-15 20:48:02,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:02,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:02,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 20:48:02,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751120337] [2019-11-15 20:48:02,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:02,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:02,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385146725] [2019-11-15 20:48:02,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:02,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:02,618 INFO L87 Difference]: Start difference. First operand 4353 states and 5057 transitions. Second operand 3 states. [2019-11-15 20:48:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:02,867 INFO L93 Difference]: Finished difference Result 8538 states and 9960 transitions. [2019-11-15 20:48:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:02,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-15 20:48:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:02,874 INFO L225 Difference]: With dead ends: 8538 [2019-11-15 20:48:02,875 INFO L226 Difference]: Without dead ends: 4337 [2019-11-15 20:48:02,881 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-11-15 20:48:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2019-11-15 20:48:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 4331. [2019-11-15 20:48:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-11-15 20:48:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 4974 transitions. [2019-11-15 20:48:03,124 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 4974 transitions. Word has length 154 [2019-11-15 20:48:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:03,125 INFO L462 AbstractCegarLoop]: Abstraction has 4331 states and 4974 transitions. [2019-11-15 20:48:03,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 4974 transitions. [2019-11-15 20:48:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 20:48:03,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:03,129 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-11-15 20:48:03,129 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:03,130 INFO L82 PathProgramCache]: Analyzing trace with hash 842292872, now seen corresponding path program 1 times [2019-11-15 20:48:03,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:03,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529582184] [2019-11-15 20:48:03,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:03,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:03,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-15 20:48:03,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529582184] [2019-11-15 20:48:03,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:03,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:03,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997374816] [2019-11-15 20:48:03,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:03,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:03,171 INFO L87 Difference]: Start difference. First operand 4331 states and 4974 transitions. Second operand 3 states. [2019-11-15 20:48:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:03,293 INFO L93 Difference]: Finished difference Result 6029 states and 6890 transitions. [2019-11-15 20:48:03,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:03,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-15 20:48:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:03,297 INFO L225 Difference]: With dead ends: 6029 [2019-11-15 20:48:03,298 INFO L226 Difference]: Without dead ends: 1854 [2019-11-15 20:48:03,303 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-11-15 20:48:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-15 20:48:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854. [2019-11-15 20:48:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-11-15 20:48:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2070 transitions. [2019-11-15 20:48:03,411 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2070 transitions. Word has length 154 [2019-11-15 20:48:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:03,411 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 2070 transitions. [2019-11-15 20:48:03,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2070 transitions. [2019-11-15 20:48:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 20:48:03,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:03,414 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-11-15 20:48:03,415 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1206640657, now seen corresponding path program 1 times [2019-11-15 20:48:03,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:03,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156205431] [2019-11-15 20:48:03,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:03,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:03,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-15 20:48:03,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156205431] [2019-11-15 20:48:03,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:03,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:03,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347254540] [2019-11-15 20:48:03,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:03,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:03,467 INFO L87 Difference]: Start difference. First operand 1854 states and 2070 transitions. Second operand 3 states. [2019-11-15 20:48:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:03,517 INFO L93 Difference]: Finished difference Result 2119 states and 2354 transitions. [2019-11-15 20:48:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:03,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-15 20:48:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:03,518 INFO L225 Difference]: With dead ends: 2119 [2019-11-15 20:48:03,518 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:48:03,520 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-11-15 20:48:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:48:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:48:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:48:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:48:03,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2019-11-15 20:48:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:03,522 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:48:03,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:48:03,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:48:03,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:48:03,744 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-15 20:48:03,931 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-15 20:48:04,133 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 151 [2019-11-15 20:48:04,325 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 133 [2019-11-15 20:48:04,544 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-15 20:48:04,717 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 153 [2019-11-15 20:48:04,861 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-15 20:48:04,998 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-15 20:48:05,292 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-15 20:48:05,652 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-15 20:48:05,883 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-15 20:48:06,196 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-15 20:48:07,614 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-15 20:48:08,884 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-15 20:48:10,090 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-11-15 20:48:11,563 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2019-11-15 20:48:11,670 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 20:48:12,049 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-11-15 20:48:12,860 WARN L191 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-15 20:48:13,812 WARN L191 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 91 [2019-11-15 20:48:14,624 WARN L191 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-15 20:48:15,420 WARN L191 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-15 20:48:16,252 WARN L191 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2019-11-15 20:48:16,617 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-11-15 20:48:16,756 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 20:48:17,561 WARN L191 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-15 20:48:18,438 WARN L191 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-11-15 20:48:18,769 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-11-15 20:48:19,920 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-15 20:48:20,760 WARN L191 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-15 20:48:21,554 WARN L191 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-15 20:48:21,669 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-15 20:48:22,442 WARN L191 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-15 20:48:23,213 WARN L191 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-11-15 20:48:24,014 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-15 20:48:24,139 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 20:48:24,933 WARN L191 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-15 20:48:25,004 INFO L443 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2019-11-15 20:48:25,004 INFO L443 ceAbstractionStarter]: For program point L283-3(lines 282 295) no Hoare annotation was computed. [2019-11-15 20:48:25,004 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 126) no Hoare annotation was computed. [2019-11-15 20:48:25,006 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-11-15 20:48:25,006 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-11-15 20:48:25,006 INFO L446 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2019-11-15 20:48:25,007 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:48:25,007 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-11-15 20:48:25,007 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-11-15 20:48:25,007 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2019-11-15 20:48:25,007 INFO L443 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2019-11-15 20:48:25,007 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2019-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2019-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2019-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L55-3(lines 55 64) no Hoare annotation was computed. [2019-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L55-5(lines 55 64) no Hoare annotation was computed. [2019-11-15 20:48:25,008 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-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2019-11-15 20:48:25,008 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-11-15 20:48:25,008 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-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2019-11-15 20:48:25,008 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2019-11-15 20:48:25,009 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 56 61) no Hoare annotation was computed. [2019-11-15 20:48:25,009 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-11-15 20:48:25,009 INFO L443 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2019-11-15 20:48:25,009 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-11-15 20:48:25,009 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2019-11-15 20:48:25,010 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-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 305 309) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L305-3(lines 305 309) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L305-5(lines 305 309) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L74-3(lines 74 83) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L74-5(lines 74 83) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2019-11-15 20:48:25,010 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 24 39) no Hoare annotation was computed. [2019-11-15 20:48:25,011 INFO L443 ceAbstractionStarter]: For program point L25-3(lines 25 29) no Hoare annotation was computed. [2019-11-15 20:48:25,011 INFO L443 ceAbstractionStarter]: For program point L25-5(lines 24 39) no Hoare annotation was computed. [2019-11-15 20:48:25,011 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-11-15 20:48:25,011 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-15 20:48:25,011 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 75 80) no Hoare annotation was computed. [2019-11-15 20:48:25,012 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-11-15 20:48:25,012 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-11-15 20:48:25,012 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-15 20:48:25,012 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-15 20:48:25,013 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-11-15 20:48:25,013 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-11-15 20:48:25,014 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2019-11-15 20:48:25,014 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-11-15 20:48:25,015 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-11-15 20:48:25,015 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2019-11-15 20:48:25,015 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:48:25,015 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-11-15 20:48:25,016 INFO L443 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2019-11-15 20:48:25,016 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-11-15 20:48:25,016 INFO L443 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2019-11-15 20:48:25,016 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-15 20:48:25,016 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2019-11-15 20:48:25,017 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-11-15 20:48:25,017 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2019-11-15 20:48:25,017 INFO L443 ceAbstractionStarter]: For program point L30-3(lines 30 34) no Hoare annotation was computed. [2019-11-15 20:48:25,017 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 20:48:25,017 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2019-11-15 20:48:25,018 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 218) no Hoare annotation was computed. [2019-11-15 20:48:25,018 INFO L443 ceAbstractionStarter]: For program point L245-1(lines 245 255) no Hoare annotation was computed. [2019-11-15 20:48:25,018 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-11-15 20:48:25,018 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 218) no Hoare annotation was computed. [2019-11-15 20:48:25,018 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-11-15 20:48:25,019 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-11-15 20:48:25,019 INFO L443 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2019-11-15 20:48:25,019 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-15 20:48:25,019 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-11-15 20:48:25,020 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:48:25,020 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-15 20:48:25,020 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-11-15 20:48:25,020 INFO L443 ceAbstractionStarter]: For program point L313-3(lines 313 317) no Hoare annotation was computed. [2019-11-15 20:48:25,021 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-11-15 20:48:25,021 INFO L443 ceAbstractionStarter]: For program point L330(line 330) no Hoare annotation was computed. [2019-11-15 20:48:25,021 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-11-15 20:48:25,022 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-11-15 20:48:25,022 INFO L443 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2019-11-15 20:48:25,022 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-11-15 20:48:25,022 INFO L443 ceAbstractionStarter]: For program point L265-2(lines 265 269) no Hoare annotation was computed. [2019-11-15 20:48:25,022 INFO L443 ceAbstractionStarter]: For program point L265-4(lines 264 277) no Hoare annotation was computed. [2019-11-15 20:48:25,023 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-11-15 20:48:25,023 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-11-15 20:48:25,023 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-11-15 20:48:25,024 INFO L443 ceAbstractionStarter]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2019-11-15 20:48:25,024 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-15 20:48:25,024 INFO L446 ceAbstractionStarter]: At program point L464(lines 455 466) the Hoare annotation is: true [2019-11-15 20:48:25,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:48:25 BoogieIcfgContainer [2019-11-15 20:48:25,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:48:25,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:48:25,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:48:25,160 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:48:25,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:47:53" (3/4) ... [2019-11-15 20:48:25,164 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:48:25,177 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 20:48:25,177 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:48:25,204 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-11-15 20:48:25,204 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-11-15 20:48:25,205 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-11-15 20:48:25,205 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-11-15 20:48:25,205 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-11-15 20:48:25,206 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-11-15 20:48:25,206 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-11-15 20:48:25,206 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-11-15 20:48:25,207 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-11-15 20:48:25,207 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-11-15 20:48:25,207 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-11-15 20:48:25,208 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-11-15 20:48:25,208 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-11-15 20:48:25,208 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-11-15 20:48:25,208 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-11-15 20:48:25,209 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-11-15 20:48:25,209 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-11-15 20:48:25,209 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-11-15 20:48:25,210 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-11-15 20:48:25,210 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-11-15 20:48:25,210 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-11-15 20:48:25,211 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-11-15 20:48:25,211 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-11-15 20:48:25,211 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-11-15 20:48:25,212 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-11-15 20:48:25,251 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_421cafbb-044d-4b68-85f4-772f6e1677d1/bin/uautomizer/witness.graphml [2019-11-15 20:48:25,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:48:25,253 INFO L168 Benchmark]: Toolchain (without parser) took 32622.89 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 943.5 MB in the beginning and 957.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 20:48:25,253 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:48:25,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:25,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.54 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-11-15 20:48:25,254 INFO L168 Benchmark]: Boogie Preprocessor took 34.13 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:25,255 INFO L168 Benchmark]: RCFGBuilder took 550.87 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:25,255 INFO L168 Benchmark]: TraceAbstraction took 31519.22 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 966.0 MB in the end (delta: 129.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 20:48:25,255 INFO L168 Benchmark]: Witness Printer took 91.86 ms. Allocated memory is still 2.2 GB. Free memory was 966.0 MB in the beginning and 957.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:25,257 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.13 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 550.87 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31519.22 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 966.0 MB in the end (delta: 129.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 91.86 ms. Allocated memory is still 2.2 GB. Free memory was 966.0 MB in the beginning and 957.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 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: 31.3s, OverallIterations: 20, TraceHistogramMax: 5, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.4s, HoareTripleCheckerStatistics: 2973 SDtfs, 2477 SDslu, 3468 SDs, 0 SdLazy, 279 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s 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.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 10890 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 806 NumberOfFragments, 14956 HoareAnnotationTreeSize, 33 FomulaSimplifications, 60286 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 33 FomulaSimplificationsInter, 46100 FormulaSimplificationTreeSizeReductionInter, 18.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s 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...