./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/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.23-635dfa2 [2018-12-09 09:31:41,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:31:41,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:31:41,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:31:41,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:31:41,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:31:41,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:31:41,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:31:41,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:31:41,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:31:41,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:31:41,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:31:41,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:31:41,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:31:41,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:31:41,954 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:31:41,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:31:41,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:31:41,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:31:41,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:31:41,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:31:41,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:31:41,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:31:41,961 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:31:41,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:31:41,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:31:41,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:31:41,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:31:41,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:31:41,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:31:41,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:31:41,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:31:41,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:31:41,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:31:41,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:31:41,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:31:41,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 09:31:41,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:31:41,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:31:41,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:31:41,977 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:31:41,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:31:41,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:31:41,978 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:31:41,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:31:41,978 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:31:41,979 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:31:41,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:31:41,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:31:41,980 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:31:41,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:31:41,981 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/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 [2018-12-09 09:31:42,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:31:42,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:31:42,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:31:42,012 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:31:42,012 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:31:42,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-09 09:31:42,045 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/data/19e8f19a5/f8cca7fd11e64471899e447efa8bae1d/FLAGa34b58567 [2018-12-09 09:31:42,473 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:31:42,473 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-09 09:31:42,479 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/data/19e8f19a5/f8cca7fd11e64471899e447efa8bae1d/FLAGa34b58567 [2018-12-09 09:31:42,487 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/data/19e8f19a5/f8cca7fd11e64471899e447efa8bae1d [2018-12-09 09:31:42,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:31:42,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:31:42,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:31:42,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:31:42,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:31:42,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a03fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42, skipping insertion in model container [2018-12-09 09:31:42,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:31:42,519 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:31:42,625 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:31:42,628 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:31:42,648 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:31:42,658 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:31:42,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42 WrapperNode [2018-12-09 09:31:42,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:31:42,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:31:42,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:31:42,658 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:31:42,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:31:42,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:31:42,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:31:42,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:31:42,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... [2018-12-09 09:31:42,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:31:42,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:31:42,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:31:42,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:31:42,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/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 [2018-12-09 09:31:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-09 09:31:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-09 09:31:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-09 09:31:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-09 09:31:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-12-09 09:31:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-12-09 09:31:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-09 09:31:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-09 09:31:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-09 09:31:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-09 09:31:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:31:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:31:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-12-09 09:31:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-12-09 09:31:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-09 09:31:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-09 09:31:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:31:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-09 09:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-09 09:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-12-09 09:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-09 09:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-09 09:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-09 09:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:31:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-12-09 09:31:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-12-09 09:31:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-12-09 09:31:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-12-09 09:31:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-09 09:31:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-09 09:31:42,979 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:31:42,979 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 09:31:42,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:42 BoogieIcfgContainer [2018-12-09 09:31:42,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:31:42,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:31:42,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:31:42,982 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:31:42,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:31:42" (1/3) ... [2018-12-09 09:31:42,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af6b72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:31:42, skipping insertion in model container [2018-12-09 09:31:42,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:42" (2/3) ... [2018-12-09 09:31:42,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af6b72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:31:42, skipping insertion in model container [2018-12-09 09:31:42,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:42" (3/3) ... [2018-12-09 09:31:42,984 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-09 09:31:42,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:31:42,995 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:31:43,005 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:31:43,024 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:31:43,024 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:31:43,024 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:31:43,024 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:31:43,024 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:31:43,024 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:31:43,024 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:31:43,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:31:43,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:31:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-12-09 09:31:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 09:31:43,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:43,042 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:43,043 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:43,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash 11439179, now seen corresponding path program 1 times [2018-12-09 09:31:43,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:43,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:43,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:43,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:43,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:43,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:31:43,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:43,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:43,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:43,213 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2018-12-09 09:31:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:43,573 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-12-09 09:31:43,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:31:43,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 09:31:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:43,583 INFO L225 Difference]: With dead ends: 379 [2018-12-09 09:31:43,583 INFO L226 Difference]: Without dead ends: 252 [2018-12-09 09:31:43,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-09 09:31:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2018-12-09 09:31:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-09 09:31:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2018-12-09 09:31:43,633 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2018-12-09 09:31:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:43,633 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2018-12-09 09:31:43,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2018-12-09 09:31:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 09:31:43,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:43,636 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:43,636 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:43,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1438317323, now seen corresponding path program 1 times [2018-12-09 09:31:43,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:43,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:43,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:43,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:43,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:43,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:43,712 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2018-12-09 09:31:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:44,164 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2018-12-09 09:31:44,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:31:44,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 09:31:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:44,168 INFO L225 Difference]: With dead ends: 628 [2018-12-09 09:31:44,168 INFO L226 Difference]: Without dead ends: 422 [2018-12-09 09:31:44,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:31:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-12-09 09:31:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2018-12-09 09:31:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-09 09:31:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-12-09 09:31:44,218 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2018-12-09 09:31:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:44,218 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-12-09 09:31:44,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-12-09 09:31:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 09:31:44,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:44,221 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:44,221 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:44,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1469864563, now seen corresponding path program 1 times [2018-12-09 09:31:44,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:44,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:44,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:44,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:44,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:44,277 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2018-12-09 09:31:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:44,312 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2018-12-09 09:31:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:31:44,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 09:31:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:44,314 INFO L225 Difference]: With dead ends: 685 [2018-12-09 09:31:44,315 INFO L226 Difference]: Without dead ends: 369 [2018-12-09 09:31:44,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-09 09:31:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2018-12-09 09:31:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-09 09:31:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2018-12-09 09:31:44,338 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2018-12-09 09:31:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:44,339 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2018-12-09 09:31:44,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2018-12-09 09:31:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 09:31:44,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:44,341 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:44,341 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:44,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1221718069, now seen corresponding path program 1 times [2018-12-09 09:31:44,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:44,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:31:44,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:31:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:31:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:31:44,396 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2018-12-09 09:31:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:44,496 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2018-12-09 09:31:44,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:31:44,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 09:31:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:44,498 INFO L225 Difference]: With dead ends: 991 [2018-12-09 09:31:44,499 INFO L226 Difference]: Without dead ends: 670 [2018-12-09 09:31:44,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:31:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-09 09:31:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-12-09 09:31:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-12-09 09:31:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2018-12-09 09:31:44,530 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2018-12-09 09:31:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:44,530 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2018-12-09 09:31:44,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:31:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2018-12-09 09:31:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 09:31:44,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:44,532 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:44,532 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:44,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2116320844, now seen corresponding path program 1 times [2018-12-09 09:31:44,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:44,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:44,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:44,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:44,588 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2018-12-09 09:31:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:44,623 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2018-12-09 09:31:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:31:44,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 09:31:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:44,626 INFO L225 Difference]: With dead ends: 1280 [2018-12-09 09:31:44,626 INFO L226 Difference]: Without dead ends: 672 [2018-12-09 09:31:44,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-12-09 09:31:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2018-12-09 09:31:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-12-09 09:31:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2018-12-09 09:31:44,647 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2018-12-09 09:31:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:44,647 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2018-12-09 09:31:44,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2018-12-09 09:31:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 09:31:44,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:44,648 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:44,649 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:44,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934286, now seen corresponding path program 1 times [2018-12-09 09:31:44,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:44,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:44,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:44,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:44,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:44,698 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2018-12-09 09:31:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:45,138 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2018-12-09 09:31:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:31:45,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 09:31:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:45,141 INFO L225 Difference]: With dead ends: 1359 [2018-12-09 09:31:45,141 INFO L226 Difference]: Without dead ends: 831 [2018-12-09 09:31:45,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:31:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-09 09:31:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2018-12-09 09:31:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-12-09 09:31:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2018-12-09 09:31:45,175 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2018-12-09 09:31:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:45,175 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2018-12-09 09:31:45,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2018-12-09 09:31:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 09:31:45,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:45,177 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:45,177 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:45,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1534461196, now seen corresponding path program 1 times [2018-12-09 09:31:45,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:45,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:45,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:45,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:31:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:31:45,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:31:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:31:45,207 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2018-12-09 09:31:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:45,272 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2018-12-09 09:31:45,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:31:45,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-09 09:31:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:45,279 INFO L225 Difference]: With dead ends: 1887 [2018-12-09 09:31:45,279 INFO L226 Difference]: Without dead ends: 1276 [2018-12-09 09:31:45,281 INFO L631 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 [2018-12-09 09:31:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-12-09 09:31:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2018-12-09 09:31:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-09 09:31:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2018-12-09 09:31:45,343 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2018-12-09 09:31:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:45,344 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2018-12-09 09:31:45,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:31:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2018-12-09 09:31:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 09:31:45,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:45,345 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:45,345 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:45,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:45,345 INFO L82 PathProgramCache]: Analyzing trace with hash -578263435, now seen corresponding path program 1 times [2018-12-09 09:31:45,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:45,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:45,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:31:45,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:45,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:45,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:45,398 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2018-12-09 09:31:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:45,504 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2018-12-09 09:31:45,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:31:45,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-09 09:31:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:45,513 INFO L225 Difference]: With dead ends: 3564 [2018-12-09 09:31:45,513 INFO L226 Difference]: Without dead ends: 2309 [2018-12-09 09:31:45,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:31:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-12-09 09:31:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2018-12-09 09:31:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-12-09 09:31:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2018-12-09 09:31:45,614 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2018-12-09 09:31:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:45,615 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2018-12-09 09:31:45,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2018-12-09 09:31:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 09:31:45,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:45,616 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:45,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:45,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:45,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1713093210, now seen corresponding path program 1 times [2018-12-09 09:31:45,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:45,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:45,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:45,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:31:45,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:45,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:45,656 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2018-12-09 09:31:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:46,146 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2018-12-09 09:31:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:31:46,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-12-09 09:31:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:46,161 INFO L225 Difference]: With dead ends: 6956 [2018-12-09 09:31:46,161 INFO L226 Difference]: Without dead ends: 4830 [2018-12-09 09:31:46,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-12-09 09:31:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2018-12-09 09:31:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2018-12-09 09:31:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2018-12-09 09:31:46,375 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2018-12-09 09:31:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:46,375 INFO L480 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2018-12-09 09:31:46,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2018-12-09 09:31:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 09:31:46,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:46,377 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:46,377 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:46,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1838635891, now seen corresponding path program 1 times [2018-12-09 09:31:46,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:46,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:46,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:46,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 09:31:46,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:46,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:31:46,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:31:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:31:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:31:46,402 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2018-12-09 09:31:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:46,592 INFO L93 Difference]: Finished difference Result 9202 states and 12339 transitions. [2018-12-09 09:31:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:31:46,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-09 09:31:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:46,606 INFO L225 Difference]: With dead ends: 9202 [2018-12-09 09:31:46,606 INFO L226 Difference]: Without dead ends: 4574 [2018-12-09 09:31:46,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:31:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2018-12-09 09:31:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2018-12-09 09:31:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2018-12-09 09:31:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6130 transitions. [2018-12-09 09:31:46,768 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6130 transitions. Word has length 88 [2018-12-09 09:31:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:46,769 INFO L480 AbstractCegarLoop]: Abstraction has 4574 states and 6130 transitions. [2018-12-09 09:31:46,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:31:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6130 transitions. [2018-12-09 09:31:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 09:31:46,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:46,770 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:46,770 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:46,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:46,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1488980751, now seen corresponding path program 1 times [2018-12-09 09:31:46,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:46,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:46,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:46,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:31:46,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:31:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:31:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:31:46,803 INFO L87 Difference]: Start difference. First operand 4574 states and 6130 transitions. Second operand 4 states. [2018-12-09 09:31:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:47,091 INFO L93 Difference]: Finished difference Result 6044 states and 8116 transitions. [2018-12-09 09:31:47,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:31:47,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-09 09:31:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:47,106 INFO L225 Difference]: With dead ends: 6044 [2018-12-09 09:31:47,106 INFO L226 Difference]: Without dead ends: 6041 [2018-12-09 09:31:47,108 INFO L631 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 [2018-12-09 09:31:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2018-12-09 09:31:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5872. [2018-12-09 09:31:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2018-12-09 09:31:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2018-12-09 09:31:47,309 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 88 [2018-12-09 09:31:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:47,309 INFO L480 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2018-12-09 09:31:47,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:31:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2018-12-09 09:31:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 09:31:47,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:47,310 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:47,311 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:47,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:47,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1085920016, now seen corresponding path program 1 times [2018-12-09 09:31:47,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:47,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:47,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:47,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:47,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:47,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:47,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:47,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:31:47,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-09 09:31:47,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:31:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:31:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:31:47,536 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 11 states. [2018-12-09 09:31:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:49,450 INFO L93 Difference]: Finished difference Result 15758 states and 23867 transitions. [2018-12-09 09:31:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 09:31:49,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-12-09 09:31:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:49,498 INFO L225 Difference]: With dead ends: 15758 [2018-12-09 09:31:49,499 INFO L226 Difference]: Without dead ends: 15755 [2018-12-09 09:31:49,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-12-09 09:31:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15755 states. [2018-12-09 09:31:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15755 to 15192. [2018-12-09 09:31:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15192 states. [2018-12-09 09:31:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15192 states to 15192 states and 22734 transitions. [2018-12-09 09:31:50,214 INFO L78 Accepts]: Start accepts. Automaton has 15192 states and 22734 transitions. Word has length 89 [2018-12-09 09:31:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 15192 states and 22734 transitions. [2018-12-09 09:31:50,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:31:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15192 states and 22734 transitions. [2018-12-09 09:31:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:31:50,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:50,216 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:50,216 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:50,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2042764433, now seen corresponding path program 2 times [2018-12-09 09:31:50,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:50,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:50,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:50,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:31:50,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:31:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:31:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:31:50,240 INFO L87 Difference]: Start difference. First operand 15192 states and 22734 transitions. Second operand 3 states. [2018-12-09 09:31:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:50,751 INFO L93 Difference]: Finished difference Result 24841 states and 38821 transitions. [2018-12-09 09:31:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:31:50,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-09 09:31:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:50,777 INFO L225 Difference]: With dead ends: 24841 [2018-12-09 09:31:50,777 INFO L226 Difference]: Without dead ends: 10372 [2018-12-09 09:31:50,817 INFO L631 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 [2018-12-09 09:31:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10372 states. [2018-12-09 09:31:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10372 to 10116. [2018-12-09 09:31:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10116 states. [2018-12-09 09:31:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 14383 transitions. [2018-12-09 09:31:51,211 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 14383 transitions. Word has length 92 [2018-12-09 09:31:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:51,211 INFO L480 AbstractCegarLoop]: Abstraction has 10116 states and 14383 transitions. [2018-12-09 09:31:51,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:31:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 14383 transitions. [2018-12-09 09:31:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:31:51,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:51,212 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:51,213 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:51,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -131765010, now seen corresponding path program 1 times [2018-12-09 09:31:51,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:51,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:51,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:31:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 09:31:51,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:51,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:31:51,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:31:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:31:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:51,276 INFO L87 Difference]: Start difference. First operand 10116 states and 14383 transitions. Second operand 7 states. [2018-12-09 09:31:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:53,176 INFO L93 Difference]: Finished difference Result 35655 states and 58048 transitions. [2018-12-09 09:31:53,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:31:53,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 09:31:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:53,223 INFO L225 Difference]: With dead ends: 35655 [2018-12-09 09:31:53,223 INFO L226 Difference]: Without dead ends: 19845 [2018-12-09 09:31:53,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-12-09 09:31:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2018-12-09 09:31:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 18429. [2018-12-09 09:31:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18429 states. [2018-12-09 09:31:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18429 states to 18429 states and 25148 transitions. [2018-12-09 09:31:53,918 INFO L78 Accepts]: Start accepts. Automaton has 18429 states and 25148 transitions. Word has length 100 [2018-12-09 09:31:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:53,918 INFO L480 AbstractCegarLoop]: Abstraction has 18429 states and 25148 transitions. [2018-12-09 09:31:53,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:31:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18429 states and 25148 transitions. [2018-12-09 09:31:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 09:31:53,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:53,920 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:53,920 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:53,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash 193904721, now seen corresponding path program 1 times [2018-12-09 09:31:53,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:53,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:53,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 09:31:53,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:53,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:53,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:54,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 09:31:54,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:31:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-09 09:31:54,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:31:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:31:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:31:54,129 INFO L87 Difference]: Start difference. First operand 18429 states and 25148 transitions. Second operand 9 states. [2018-12-09 09:31:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:55,324 INFO L93 Difference]: Finished difference Result 32556 states and 45174 transitions. [2018-12-09 09:31:55,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 09:31:55,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-12-09 09:31:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:55,366 INFO L225 Difference]: With dead ends: 32556 [2018-12-09 09:31:55,367 INFO L226 Difference]: Without dead ends: 15096 [2018-12-09 09:31:55,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-12-09 09:31:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15096 states. [2018-12-09 09:31:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15096 to 14338. [2018-12-09 09:31:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14338 states. [2018-12-09 09:31:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 17118 transitions. [2018-12-09 09:31:55,963 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 17118 transitions. Word has length 110 [2018-12-09 09:31:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:55,964 INFO L480 AbstractCegarLoop]: Abstraction has 14338 states and 17118 transitions. [2018-12-09 09:31:55,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:31:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 17118 transitions. [2018-12-09 09:31:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 09:31:55,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:55,968 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:55,968 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:55,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash 716240703, now seen corresponding path program 1 times [2018-12-09 09:31:55,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:55,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:55,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:55,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:55,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 09:31:56,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:56,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:56,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:56,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 09:31:56,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:31:56,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-12-09 09:31:56,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:31:56,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:31:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:31:56,160 INFO L87 Difference]: Start difference. First operand 14338 states and 17118 transitions. Second operand 8 states. [2018-12-09 09:31:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:57,074 INFO L93 Difference]: Finished difference Result 31805 states and 38553 transitions. [2018-12-09 09:31:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:31:57,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2018-12-09 09:31:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:57,107 INFO L225 Difference]: With dead ends: 31805 [2018-12-09 09:31:57,107 INFO L226 Difference]: Without dead ends: 17865 [2018-12-09 09:31:57,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:31:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17865 states. [2018-12-09 09:31:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17865 to 17655. [2018-12-09 09:31:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17655 states. [2018-12-09 09:31:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17655 states to 17655 states and 21178 transitions. [2018-12-09 09:31:57,711 INFO L78 Accepts]: Start accepts. Automaton has 17655 states and 21178 transitions. Word has length 174 [2018-12-09 09:31:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:57,711 INFO L480 AbstractCegarLoop]: Abstraction has 17655 states and 21178 transitions. [2018-12-09 09:31:57,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:31:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17655 states and 21178 transitions. [2018-12-09 09:31:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-09 09:31:57,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:57,714 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:57,714 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:57,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash 745588165, now seen corresponding path program 1 times [2018-12-09 09:31:57,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:31:57,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:31:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 09:31:57,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:57,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:57,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:57,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 09:31:57,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:31:57,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-12-09 09:31:57,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:31:57,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:31:57,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:31:57,928 INFO L87 Difference]: Start difference. First operand 17655 states and 21178 transitions. Second operand 11 states. [2018-12-09 09:31:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:59,692 INFO L93 Difference]: Finished difference Result 53069 states and 65336 transitions. [2018-12-09 09:31:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 09:31:59,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-12-09 09:31:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:59,749 INFO L225 Difference]: With dead ends: 53069 [2018-12-09 09:31:59,749 INFO L226 Difference]: Without dead ends: 30556 [2018-12-09 09:31:59,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-12-09 09:31:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30556 states. [2018-12-09 09:32:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30556 to 25958. [2018-12-09 09:32:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25958 states. [2018-12-09 09:32:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25958 states to 25958 states and 30391 transitions. [2018-12-09 09:32:00,808 INFO L78 Accepts]: Start accepts. Automaton has 25958 states and 30391 transitions. Word has length 189 [2018-12-09 09:32:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:32:00,809 INFO L480 AbstractCegarLoop]: Abstraction has 25958 states and 30391 transitions. [2018-12-09 09:32:00,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:32:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 25958 states and 30391 transitions. [2018-12-09 09:32:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-09 09:32:00,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:32:00,814 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-12-09 09:32:00,814 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:32:00,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:32:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash -622457563, now seen corresponding path program 1 times [2018-12-09 09:32:00,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:32:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:32:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:32:00,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:32:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-09 09:32:00,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:32:00,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:32:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:00,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:32:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-12-09 09:32:01,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:32:01,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-12-09 09:32:01,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:32:01,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:32:01,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:32:01,057 INFO L87 Difference]: Start difference. First operand 25958 states and 30391 transitions. Second operand 12 states. [2018-12-09 09:32:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:32:01,669 INFO L93 Difference]: Finished difference Result 40134 states and 47644 transitions. [2018-12-09 09:32:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:32:01,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 274 [2018-12-09 09:32:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:32:01,703 INFO L225 Difference]: With dead ends: 40134 [2018-12-09 09:32:01,703 INFO L226 Difference]: Without dead ends: 14225 [2018-12-09 09:32:01,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:32:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14225 states. [2018-12-09 09:32:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14225 to 11886. [2018-12-09 09:32:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2018-12-09 09:32:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 13870 transitions. [2018-12-09 09:32:02,303 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 13870 transitions. Word has length 274 [2018-12-09 09:32:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:32:02,303 INFO L480 AbstractCegarLoop]: Abstraction has 11886 states and 13870 transitions. [2018-12-09 09:32:02,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:32:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 13870 transitions. [2018-12-09 09:32:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-09 09:32:02,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:32:02,307 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1] [2018-12-09 09:32:02,307 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:32:02,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:32:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash 823377233, now seen corresponding path program 1 times [2018-12-09 09:32:02,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:32:02,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:32:02,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:32:02,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:02,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:32:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-12-09 09:32:02,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:32:02,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:32:02,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:02,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:32:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 09:32:02,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:32:02,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-09 09:32:02,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:32:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:32:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:32:02,523 INFO L87 Difference]: Start difference. First operand 11886 states and 13870 transitions. Second operand 8 states. [2018-12-09 09:32:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:32:03,216 INFO L93 Difference]: Finished difference Result 18360 states and 21485 transitions. [2018-12-09 09:32:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:32:03,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2018-12-09 09:32:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:32:03,228 INFO L225 Difference]: With dead ends: 18360 [2018-12-09 09:32:03,228 INFO L226 Difference]: Without dead ends: 7022 [2018-12-09 09:32:03,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:32:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2018-12-09 09:32:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 6787. [2018-12-09 09:32:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6787 states. [2018-12-09 09:32:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6787 states to 6787 states and 7840 transitions. [2018-12-09 09:32:03,518 INFO L78 Accepts]: Start accepts. Automaton has 6787 states and 7840 transitions. Word has length 293 [2018-12-09 09:32:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:32:03,518 INFO L480 AbstractCegarLoop]: Abstraction has 6787 states and 7840 transitions. [2018-12-09 09:32:03,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:32:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6787 states and 7840 transitions. [2018-12-09 09:32:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-09 09:32:03,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:32:03,522 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-12-09 09:32:03,522 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:32:03,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:32:03,523 INFO L82 PathProgramCache]: Analyzing trace with hash 370722374, now seen corresponding path program 1 times [2018-12-09 09:32:03,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:32:03,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:32:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:32:03,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:32:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-12-09 09:32:03,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:32:03,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:32:03,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:32:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:32:03,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:32:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-12-09 09:32:03,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:32:03,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-12-09 09:32:03,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:32:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:32:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:32:03,713 INFO L87 Difference]: Start difference. First operand 6787 states and 7840 transitions. Second operand 6 states. [2018-12-09 09:32:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:32:04,049 INFO L93 Difference]: Finished difference Result 7607 states and 8768 transitions. [2018-12-09 09:32:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:32:04,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 293 [2018-12-09 09:32:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:32:04,051 INFO L225 Difference]: With dead ends: 7607 [2018-12-09 09:32:04,051 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:32:04,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:32:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:32:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:32:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:32:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:32:04,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2018-12-09 09:32:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:32:04,060 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:32:04,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:32:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:32:04,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:32:04,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 09:32:04,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,609 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 400 DAG size of output: 264 [2018-12-09 09:32:04,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:04,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:05,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:06,323 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 274 [2018-12-09 09:32:07,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,500 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 246 [2018-12-09 09:32:07,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,737 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 374 DAG size of output: 242 [2018-12-09 09:32:07,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:07,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,515 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 253 [2018-12-09 09:32:08,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:08,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:09,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:09,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:09,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:09,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:09,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:09,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:09,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:10,278 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 269 [2018-12-09 09:32:11,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,366 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 269 [2018-12-09 09:32:11,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:11,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 09:32:12,204 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 83 [2018-12-09 09:32:13,400 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 270 DAG size of output: 103 [2018-12-09 09:32:14,727 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 231 DAG size of output: 94 [2018-12-09 09:32:19,348 WARN L180 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 420 DAG size of output: 162 [2018-12-09 09:32:23,291 WARN L180 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 399 DAG size of output: 114 [2018-12-09 09:32:23,654 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 1 [2018-12-09 09:32:23,772 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-12-09 09:32:25,130 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 285 DAG size of output: 120 [2018-12-09 09:32:27,421 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 485 DAG size of output: 95 [2018-12-09 09:32:27,607 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2018-12-09 09:32:30,217 WARN L180 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 280 DAG size of output: 107 [2018-12-09 09:32:30,483 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 1 [2018-12-09 09:32:30,756 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 1 [2018-12-09 09:32:32,377 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 382 DAG size of output: 98 [2018-12-09 09:32:33,631 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 381 DAG size of output: 90 [2018-12-09 09:32:33,831 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 1 [2018-12-09 09:32:34,980 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 261 DAG size of output: 101 [2018-12-09 09:32:35,564 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 81 [2018-12-09 09:32:36,627 WARN L180 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 88 [2018-12-09 09:32:38,976 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 256 DAG size of output: 100 [2018-12-09 09:32:41,147 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 252 DAG size of output: 98 [2018-12-09 09:32:42,861 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 382 DAG size of output: 98 [2018-12-09 09:32:49,053 WARN L180 SmtUtils]: Spent 6.18 s on a formula simplification. DAG size of input: 387 DAG size of output: 153 [2018-12-09 09:32:51,352 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 262 DAG size of output: 103 [2018-12-09 09:32:52,900 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 498 DAG size of output: 77 [2018-12-09 09:32:54,549 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 437 DAG size of output: 106 [2018-12-09 09:32:59,199 WARN L180 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 420 DAG size of output: 162 [2018-12-09 09:32:59,501 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 491 DAG size of output: 1 [2018-12-09 09:33:01,556 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 273 DAG size of output: 107 [2018-12-09 09:33:03,033 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 499 DAG size of output: 1 [2018-12-09 09:33:05,585 WARN L180 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 416 DAG size of output: 141 [2018-12-09 09:33:07,216 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 309 DAG size of output: 93 [2018-12-09 09:33:11,163 WARN L180 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 393 DAG size of output: 91 [2018-12-09 09:33:11,655 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 88 [2018-12-09 09:33:13,425 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 273 DAG size of output: 107 [2018-12-09 09:33:16,657 WARN L180 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 299 DAG size of output: 135 [2018-12-09 09:33:17,327 WARN L180 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 85 [2018-12-09 09:33:17,659 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 92 [2018-12-09 09:33:19,248 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 408 DAG size of output: 100 [2018-12-09 09:33:19,424 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2018-12-09 09:33:19,906 WARN L180 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 89 [2018-12-09 09:33:20,012 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-12-09 09:33:20,015 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-12-09 09:33:20,015 INFO L448 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-12-09 09:33:20,015 INFO L448 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-12-09 09:33:20,015 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-12-09 09:33:20,015 INFO L444 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse11 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse25 (= 2 ~c_dr_st~0)) (.cse21 (= 2 ~p_dw_st~0)) (.cse31 (not (= 0 ~c_dr_st~0))) (.cse28 (= ~p_dw_st~0 0))) (let ((.cse19 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (and .cse31 .cse28)) (.cse7 (and .cse25 .cse21)) (.cse24 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse8 (< 0 ~q_req_up~0)) (.cse29 (< ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~q_free~0 1)) (.cse18 (< 1 ~q_free~0)) (.cse30 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (and .cse31 .cse21)) (.cse0 (< ~p_num_write~0 .cse32)) (.cse3 (not .cse11)) (.cse4 (< .cse32 ~p_num_write~0)) (.cse6 (not (= |old(~p_dw_st~0)| 2))) (.cse13 (= 0 |old(~c_dr_st~0)|)) (.cse26 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse23 (= 1 ~q_req_up~0)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse15 (not (= |old(~p_dw_st~0)| 0))) (.cse16 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~q_write_ev~0) .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse1 .cse5 .cse21 .cse6 .cse22 .cse9 .cse23 .cse24 .cse16 .cse17) (or .cse11 .cse1 .cse12 .cse2 .cse10 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse1 .cse2 .cse3 .cse27 .cse9 .cse23 .cse13 .cse5 .cse6) (or .cse11 .cse1 .cse2 .cse28 .cse9 .cse13 .cse15) (or (= 0 ~p_dw_st~0) .cse2 .cse1 .cse5 .cse19 .cse22 .cse8 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse26 .cse1 .cse2 .cse9 .cse23 .cse13 .cse14 .cse5 .cse15 .cse16) (or .cse25 .cse11 .cse1 .cse2 .cse9 .cse10) (or (or .cse26 .cse29 .cse1 .cse12 .cse2 .cse3 .cse10 .cse6 .cse18 .cse30 .cse20 .cse8) .cse7) (or .cse26 .cse1 .cse2 .cse9 .cse10 .cse23 .cse25 .cse16 .cse6) (or .cse2 .cse1 .cse3 .cse5 .cse6 .cse29 .cse26 .cse12 .cse25 .cse10 .cse23 .cse18 .cse30 .cse20) (or .cse26 .cse1 .cse2 .cse9 .cse5 .cse21 .cse24 .cse16 .cse6 .cse17 .cse8) (or .cse2 .cse1 .cse3 .cse6 .cse29 .cse26 .cse12 .cse25 .cse10 .cse23 .cse16 .cse18 .cse30 .cse20) (or .cse2 .cse1 .cse3 .cse27 .cse6 .cse29 .cse26 .cse12 .cse23 .cse13 .cse16 .cse18 .cse30 .cse20) (or .cse2 .cse1 .cse3 .cse5 .cse6 .cse29 .cse26 .cse12 .cse23 .cse13 .cse18 .cse30 .cse20 .cse27) (or .cse27 .cse26 .cse1 .cse2 .cse3 .cse9 .cse23 .cse13 .cse16 .cse6) (or .cse26 .cse1 .cse2 .cse9 .cse10 .cse23 .cse5 .cse6 .cse25) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse9 .cse23 .cse21 .cse4 .cse16 .cse6) (or .cse11 .cse1 .cse2 .cse9 .cse13 .cse31) (or .cse26 .cse1 .cse2 .cse9 .cse10 .cse23 .cse5 .cse15 .cse16 .cse25)))) [2018-12-09 09:33:20,016 INFO L444 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse34 (+ ~c_num_read~0 1)) (.cse31 (= 1 ~p_num_write~0)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse28 (= activate_threads_~tmp~1 0)) (.cse12 (= 2 ~p_dw_st~0))) (let ((.cse6 (= ~p_dw_st~0 0)) (.cse24 (< 0 ~q_req_up~0)) (.cse19 (not (= 0 ~p_num_write~0))) (.cse25 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse26 (= 2 ~c_dr_st~0)) (.cse33 (and .cse16 .cse28 .cse12)) (.cse32 (and .cse16 .cse12)) (.cse29 (< ~p_num_write~0 ~c_num_read~0)) (.cse15 (< ~q_free~0 1)) (.cse18 (< 1 ~q_free~0)) (.cse30 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse21 (and .cse28 .cse12)) (.cse23 (not .cse31)) (.cse17 (not (= 0 ~c_num_read~0))) (.cse7 (< ~p_num_write~0 .cse34)) (.cse8 (< ~q_write_ev~0 2)) (.cse9 (not .cse0)) (.cse10 (= 1 ~q_req_up~0)) (.cse11 (< .cse34 ~p_num_write~0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse14 (not (= |old(~p_dw_st~0)| 2))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_free~0 0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse22 (not (= ~q_read_ev~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse4 (and .cse16 .cse6) .cse5 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse4) (or .cse8 .cse1 .cse2 .cse3 .cse21 .cse22 .cse23 .cse13 .cse14 .cse17 .cse24) (or .cse0 .cse1 .cse15 .cse2 .cse25 .cse26 .cse5 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse1 .cse22 .cse19 .cse27 .cse24 .cse0 .cse15 .cse5 (and (= 0 ~p_dw_st~0) .cse28) .cse13 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse26) (or (and .cse16 .cse6 .cse28) .cse8 .cse1 .cse2 .cse3 .cse10 .cse4 .cse22 .cse5 .cse13) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse22 .cse26 .cse14) (or (or .cse8 .cse29 .cse1 .cse15 .cse2 .cse9 .cse25 .cse14 .cse18 .cse30 .cse20 .cse24) (and (= 1 ~p_dw_pc~0) .cse26 .cse12) (and (and .cse6 .cse26) (= ~q_read_ev~0 1)) (and (not .cse13) .cse31)) (or .cse7 .cse1 .cse2 .cse9 .cse11 .cse22 .cse14 (= 0 ~q_write_ev~0) .cse24 .cse3 .cse25 (and .cse26 .cse28 .cse12)) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse26 .cse13 .cse14) (or .cse8 .cse1 .cse2 .cse32 .cse9 .cse3 .cse10 .cse4 .cse13 .cse14) (or .cse2 .cse1 .cse9 .cse22 .cse14 .cse29 .cse8 .cse15 .cse26 .cse25 .cse10 .cse18 .cse30 .cse20) (or .cse1 .cse2 .cse22 .cse19 .cse28 .cse0 .cse15 .cse4 .cse5 .cse13 .cse17 .cse18 .cse20) (or .cse2 .cse1 .cse9 .cse26 .cse14 .cse29 .cse8 .cse15 .cse25 .cse10 .cse13 .cse18 .cse30 .cse20) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse22 .cse5 .cse26 .cse13) (or .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse22 .cse14 .cse33) (or .cse2 .cse1 .cse9 .cse33 .cse22 .cse14 .cse29 .cse8 .cse15 .cse10 .cse4 .cse18 .cse30 .cse20) (or .cse32 .cse2 .cse1 .cse9 .cse14 .cse29 .cse8 .cse15 .cse10 .cse4 .cse13 .cse18 .cse30 .cse20) (or .cse2 .cse1 .cse22 .cse14 .cse27 .cse3 .cse10 .cse21 .cse23 .cse13 .cse17) (or .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse22 .cse13 .cse14 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse28)))) [2018-12-09 09:33:20,016 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse11 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse25 (= 2 ~c_dr_st~0)) (.cse21 (= 2 ~p_dw_st~0)) (.cse31 (not (= 0 ~c_dr_st~0))) (.cse28 (= ~p_dw_st~0 0))) (let ((.cse19 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (and .cse31 .cse28)) (.cse7 (and .cse25 .cse21)) (.cse24 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse8 (< 0 ~q_req_up~0)) (.cse29 (< ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~q_free~0 1)) (.cse18 (< 1 ~q_free~0)) (.cse30 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (and .cse31 .cse21)) (.cse0 (< ~p_num_write~0 .cse32)) (.cse3 (not .cse11)) (.cse4 (< .cse32 ~p_num_write~0)) (.cse6 (not (= |old(~p_dw_st~0)| 2))) (.cse13 (= 0 |old(~c_dr_st~0)|)) (.cse26 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse23 (= 1 ~q_req_up~0)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse15 (not (= |old(~p_dw_st~0)| 0))) (.cse16 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~q_write_ev~0) .cse8 .cse9 .cse10) (or .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse1 .cse5 .cse21 .cse6 .cse22 .cse9 .cse23 .cse24 .cse16 .cse17) (or .cse11 .cse1 .cse12 .cse2 .cse10 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse1 .cse2 .cse3 .cse27 .cse9 .cse23 .cse13 .cse5 .cse6) (or .cse11 .cse1 .cse2 .cse28 .cse9 .cse13 .cse15) (or (= 0 ~p_dw_st~0) .cse2 .cse1 .cse5 .cse19 .cse22 .cse8 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse26 .cse1 .cse2 .cse9 .cse23 .cse13 .cse14 .cse5 .cse15 .cse16) (or .cse25 .cse11 .cse1 .cse2 .cse9 .cse10) (or (or .cse26 .cse29 .cse1 .cse12 .cse2 .cse3 .cse10 .cse6 .cse18 .cse30 .cse20 .cse8) .cse7) (or .cse26 .cse1 .cse2 .cse9 .cse10 .cse23 .cse25 .cse16 .cse6) (or .cse2 .cse1 .cse3 .cse5 .cse6 .cse29 .cse26 .cse12 .cse25 .cse10 .cse23 .cse18 .cse30 .cse20) (or .cse26 .cse1 .cse2 .cse9 .cse5 .cse21 .cse24 .cse16 .cse6 .cse17 .cse8) (or .cse2 .cse1 .cse3 .cse6 .cse29 .cse26 .cse12 .cse25 .cse10 .cse23 .cse16 .cse18 .cse30 .cse20) (or .cse2 .cse1 .cse3 .cse27 .cse6 .cse29 .cse26 .cse12 .cse23 .cse13 .cse16 .cse18 .cse30 .cse20) (or .cse2 .cse1 .cse3 .cse5 .cse6 .cse29 .cse26 .cse12 .cse23 .cse13 .cse18 .cse30 .cse20 .cse27) (or .cse27 .cse26 .cse1 .cse2 .cse3 .cse9 .cse23 .cse13 .cse16 .cse6) (or .cse26 .cse1 .cse2 .cse9 .cse10 .cse23 .cse5 .cse6 .cse25) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse9 .cse23 .cse21 .cse4 .cse16 .cse6) (or .cse11 .cse1 .cse2 .cse9 .cse13 .cse31) (or .cse26 .cse1 .cse2 .cse9 .cse10 .cse23 .cse5 .cse15 .cse16 .cse25)))) [2018-12-09 09:33:20,016 INFO L448 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-12-09 09:33:20,016 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-12-09 09:33:20,016 INFO L444 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse7 (= 1 ~c_dr_pc~0)) (.cse11 (= 0 ~c_dr_st~0))) (let ((.cse16 (not (= 0 ~p_num_write~0))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse13 (< ~q_free~0 1)) (.cse12 (not (= ~p_dw_st~0 0))) (.cse10 (= 1 exists_runnable_thread_~__retres1~2)) (.cse14 (= ~p_dw_pc~0 1)) (.cse9 (not (= 0 ~c_num_read~0))) (.cse15 (< 1 ~q_free~0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse5 (not .cse11)) (.cse18 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse20 (not .cse7)) (.cse8 (not (= ~q_free~0 0))) (.cse19 (= 1 ~q_req_up~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse6 (= exists_runnable_thread_~__retres1~2 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 1 ~p_num_write~0)) .cse9) (or .cse7 .cse1 .cse0 .cse8 .cse10 .cse11 .cse12) (or .cse7 .cse1 .cse13 .cse0 .cse10 .cse11 .cse12 .cse14 .cse9 .cse15 .cse16 .cse17) (or .cse18 .cse1 .cse0 .cse8 .cse19 .cse11 .cse2 .cse12 .cse10 .cse14) (or .cse10 (or .cse0 .cse1 .cse20 .cse2 (< ~p_num_write~0 ~c_num_read~0) .cse18 .cse13 (not (= 2 ~c_dr_st~0)) .cse19 .cse12 .cse15 (< ~c_num_read~0 ~p_num_write~0) .cse17)) (or .cse0 .cse1 .cse2 .cse16 .cse4 (< 0 ~q_req_up~0) .cse7 .cse13 .cse12 .cse10 .cse14 .cse9 .cse15 .cse17) (or .cse5 (let ((.cse21 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse21) .cse18 .cse1 .cse0 .cse20 .cse8 .cse19 (< .cse21 ~p_num_write~0) .cse2 .cse3)) .cse6)))) [2018-12-09 09:33:20,016 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L444 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0))) (let ((.cse6 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse5 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse7 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse19 (< ~q_free~0 1)) (.cse23 (not .cse18)) (.cse20 (< 1 ~q_free~0))) (let ((.cse0 (< |old(~q_write_ev~0)| 2)) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse8 (or .cse19 .cse23 .cse20)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (= 0 ~c_dr_st~0)) (.cse17 (and .cse5 .cse7)) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 0))) (.cse15 (not (= |old(~q_read_ev~0)| 2))) (.cse10 (not (= ~p_dw_st~0 2))) (.cse11 (not (= 1 |old(~q_req_up~0)|))) (.cse14 (and (and .cse6 .cse7) (= ~q_write_ev~0 |old(~q_write_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13)) (or .cse2 .cse3 .cse16 .cse17 .cse9 (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (or .cse18 .cse19 (not (= ~p_dw_st~0 0)) .cse20) .cse13) (or .cse18 .cse2 .cse3 .cse21 .cse16 .cse17) (or (or .cse4 (let ((.cse22 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse22) .cse2 .cse3 .cse23 .cse21 (< .cse22 ~p_num_write~0) .cse15)) .cse10 .cse11 (= 0 |old(~q_write_ev~0)|)) .cse14))))) [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-12-09 09:33:20,017 INFO L448 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-12-09 09:33:20,018 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse24 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse30 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse33 (+ ~c_num_read~0 1)) (.cse32 (= 1 ~c_dr_pc~0)) (.cse20 (not (= |old(~q_read_ev~0)| 2)))) (let ((.cse14 (not (= |old(~q_read_ev~0)| 1))) (.cse13 (= ~q_read_ev~0 1)) (.cse26 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse21 (not (= 1 ~p_num_write~0))) (.cse28 (or .cse32 .cse20 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (.cse29 (< ~p_num_write~0 .cse33)) (.cse31 (< .cse33 ~p_num_write~0)) (.cse22 (not (= 0 ~c_num_read~0))) (.cse27 (not (= 0 ~p_num_write~0))) (.cse6 (not (= 2 ~c_dr_st~0))) (.cse23 (< 0 ~q_req_up~0)) (.cse25 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (.cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse8 (not (= ~p_dw_st~0 0))) (.cse18 (= ~p_dw_pc~0 1)) (.cse19 (not (= ~q_free~0 0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not .cse32)) (.cse16 (not (= ~p_dw_st~0 2))) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse3 (< ~q_free~0 1)) (.cse7 (= 1 ~q_req_up~0)) (.cse17 (= 0 ~c_dr_st~0)) (.cse9 (< 1 ~q_free~0)) (.cse10 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (and .cse24 .cse30))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13) .cse14) (or .cse4 .cse2 .cse5 .cse15 .cse16 .cse1 .cse0 .cse3 .cse7 .cse17 .cse18 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse4 .cse19 .cse20 .cse15 .cse21 .cse18 .cse16 .cse22 .cse23) (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse17 .cse16 .cse9 .cse10 .cse11) .cse14 (and .cse24 .cse13)) (or .cse15 .cse0 .cse2 .cse4 .cse19 .cse7 .cse17 .cse18 .cse16) (or .cse4 .cse2 (and .cse25 .cse26) .cse27 .cse23 .cse3 .cse8 .cse18 .cse22 .cse9 .cse28 .cse11) (or .cse29 .cse2 .cse4 .cse5 (and .cse30 (= 1 ~q_write_ev~0)) .cse31 .cse20 .cse16 .cse23 .cse19 (not (= 1 |old(~q_write_ev~0)|))) (or .cse29 .cse0 .cse2 .cse4 .cse5 .cse19 .cse7 .cse15 .cse31 .cse18 .cse16) (or .cse2 .cse4 .cse16 (and .cse30 .cse26) .cse19 .cse7 .cse21 .cse18 .cse22 .cse28) (or .cse29 .cse2 .cse4 .cse31 .cse20 .cse16 (and .cse30 .cse12) (= 0 |old(~q_write_ev~0)|) .cse23 .cse19 .cse6) (or .cse32 .cse2 .cse3 .cse4 .cse17 .cse15 .cse8 .cse18 .cse22 .cse9 .cse27 .cse11) (or .cse32 .cse2 .cse4 .cse19 .cse17 .cse15) (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse10 .cse11 .cse23) (and .cse25 .cse12)) (or .cse0 .cse2 .cse4 .cse19 .cse7 .cse17 .cse15 .cse20 .cse8 .cse18) (or .cse0 .cse2 .cse4 .cse15 .cse19 .cse7 .cse17 .cse20 .cse16) (or .cse4 .cse2 .cse5 .cse20 .cse16 .cse1 .cse0 .cse3 .cse7 .cse17 .cse9 .cse10 .cse11 .cse15)))) [2018-12-09 09:33:20,018 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-12-09 09:33:20,018 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 223 240) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~q_read_ev~0 2)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (< 0 ~q_req_up~0) (= 1 ~c_dr_pc~0) (< ~q_free~0 1) (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (< 1 ~q_free~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-12-09 09:33:20,018 INFO L448 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-12-09 09:33:20,018 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-12-09 09:33:20,018 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-12-09 09:33:20,018 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-09 09:33:20,018 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-12-09 09:33:20,018 INFO L444 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-12-09 09:33:20,018 INFO L444 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= 2 ~q_read_ev~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (not (= ~p_dw_pc~0 1)) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-12-09 09:33:20,018 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-12-09 09:33:20,018 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse6 (= 1 ~c_dr_pc~0))) (let ((.cse19 (= 0 ~p_num_write~0)) (.cse17 (<= ~q_free~0 1)) (.cse12 (<= 1 ~q_free~0)) (.cse5 (= |old(~p_dw_st~0)| 0)) (.cse23 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse14 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~q_free~0 0)) (.cse13 (not (= 0 ~p_dw_st~0))) (.cse16 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse24 (< ~q_write_ev~0 2)) (.cse25 (not .cse6)) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~q_read_ev~0 2))) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse7 (< |old(~q_free~0)| 1)) (.cse21 (= 0 ~c_dr_st~0)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse9 (not (= 0 ~c_num_read~0))) (.cse10 (< 1 |old(~q_free~0)|)) (.cse11 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (< 0 |old(~q_req_up~0)|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (or .cse6 .cse1 .cse0 .cse20 .cse21 (and .cse22 .cse23 .cse14 .cse15)) (or .cse21 (or .cse6 .cse1 .cse0 .cse7 .cse8 .cse10) .cse9 (and .cse14 .cse15 .cse12 .cse17 .cse19) .cse3) (or .cse24 (and .cse13 .cse16 (and .cse23 .cse14 .cse17 .cse15 .cse12)) (or .cse5 (not (= 2 ~c_dr_st~0)) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse0 .cse7 .cse25 .cse2 .cse10) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse5 (and .cse23 .cse14 .cse15 .cse22 .cse13 .cse16) .cse24 .cse1 .cse0 .cse25 .cse20 (= 1 |old(~q_req_up~0)|) .cse21 .cse2 .cse8) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11)))) [2018-12-09 09:33:20,019 INFO L444 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse16 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse14 (not (= |old(~q_free~0)| 0))) (.cse9 (and .cse16 .cse17)) (.cse10 (= 0 ~p_num_write~0)) (.cse18 (= 0 ~c_dr_st~0)) (.cse11 (= |old(~p_dw_pc~0)| 1)) (.cse12 (not (= 0 ~c_num_read~0))) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (< ~q_write_ev~0 2)) (.cse7 (not (= 0 ~p_dw_st~0))) (.cse8 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse15 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse4 (= |old(~p_dw_st~0)| 0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse6 (< |old(~q_free~0)| 1)) (.cse5 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse13 (< 1 |old(~q_free~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~q_read_ev~0 ~q_write_ev~0)) (< 0 |old(~q_req_up~0)|) .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse5 .cse1 .cse0 .cse14 (and (= ~q_free~0 0) (= 1 |old(~p_dw_pc~0)|) .cse15 .cse16 .cse17) .cse18) (or .cse4 .cse19 .cse1 .cse0 .cse14 (= 1 |old(~q_req_up~0)|) .cse18 .cse2 .cse11) (or (and .cse9 .cse10) .cse18 (or .cse5 .cse1 .cse0 .cse6 .cse11 .cse13) .cse12 .cse3) (or .cse19 (and .cse7 .cse8 (and .cse15 .cse16 .cse17)) (or .cse4 (not (= 2 ~c_dr_st~0)) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse0 .cse6 (not .cse5) .cse2 .cse13) (< ~c_num_read~0 |old(~p_num_write~0)|))))))) [2018-12-09 09:33:20,019 INFO L444 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse5 (= 1 ~c_dr_pc~0)) (.cse24 (+ |old(~p_num_write~0)| 1))) (let ((.cse22 (not (= ~p_dw_pc~0 1))) (.cse23 (<= .cse24 ~p_num_write~0)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse25 (< ~q_write_ev~0 2)) (.cse29 (not .cse5)) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse4 (= 0 ~c_dr_st~0)) (.cse7 (not (= ~p_dw_i~0 1))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse28 (= |old(~p_dw_st~0)| 0)) (.cse8 (< |old(~q_free~0)| 1)) (.cse9 (= |old(~p_dw_pc~0)| 1)) (.cse11 (not (= 0 ~c_num_read~0))) (.cse10 (< 1 |old(~q_free~0)|)) (.cse19 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (<= 1 ~q_free~0)) (.cse27 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse13 (<= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= 0 ~p_num_write~0)) (.cse0 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 0)) (.cse26 (not (= 0 ~p_dw_st~0))) (.cse3 (= 1 ~p_num_write~0))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse0 .cse1 .cse12 .cse13 .cse14) .cse15) (or .cse3 .cse7 .cse6 .cse16 .cse17 .cse15 .cse18 .cse5 .cse8 .cse4 .cse9 .cse11 .cse10 .cse19) (or .cse5 .cse6 .cse7 .cse20 .cse4 (and .cse2 .cse21 .cse0 .cse22 .cse1) (and .cse2 (= 1 |old(~p_dw_pc~0)|) .cse0 .cse1 .cse23 (<= ~p_num_write~0 .cse24))) (or .cse25 (and .cse26 .cse27 (and .cse21 .cse0 .cse22 .cse13 .cse1 .cse12)) (and .cse0 .cse1 .cse23 .cse2 .cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (or .cse28 (not (= 2 ~c_dr_st~0)) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse6 .cse7 .cse8 .cse29 .cse16 .cse10) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse28 (and .cse21 .cse0 .cse1 .cse2 .cse26 .cse27) .cse25 .cse6 .cse7 .cse29 .cse20 (= 1 |old(~q_req_up~0)|) .cse4 .cse16 .cse9) (or .cse7 .cse6 .cse16 .cse15 .cse18 (< 0 |old(~q_req_up~0)|) .cse28 .cse5 .cse8 .cse9 .cse11 .cse10 .cse19 (and .cse12 .cse26 .cse0 .cse1 .cse27 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse26 .cse3))))) [2018-12-09 09:33:20,019 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-12-09 09:33:20,019 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-12-09 09:33:20,019 INFO L444 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse23 (+ |old(~p_num_write~0)| 1))) (let ((.cse9 (= ~q_free~0 0)) (.cse21 (= 1 |old(~p_dw_pc~0)|)) (.cse0 (= 0 ~c_dr_st~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= .cse23 ~p_num_write~0)) (.cse22 (= ~p_dw_i~0 1)) (.cse1 (= 1 ~c_dr_pc~0))) (let ((.cse10 (= 1 ~p_num_write~0)) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (= |old(~p_dw_pc~0)| 1)) (.cse7 (not (= 0 ~c_num_read~0))) (.cse13 (< ~q_write_ev~0 2)) (.cse17 (= 2 ~p_dw_st~0)) (.cse12 (= |old(~p_dw_st~0)| 0)) (.cse4 (< |old(~q_free~0)| 1)) (.cse14 (not .cse1)) (.cse18 (not (= ~q_read_ev~0 2))) (.cse6 (< 1 |old(~q_free~0)|)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse22)) (.cse15 (not (= |old(~q_free~0)| 0))) (.cse16 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse20 (and .cse9 (not (= ~c_dr_pc~0 1)) .cse21 (not .cse0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse22 .cse11 .cse19 (<= ~p_num_write~0 .cse23)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 (and .cse9 .cse10 .cse11)) (or .cse12 .cse13 .cse2 .cse3 .cse14 .cse15 (= 1 |old(~q_req_up~0)|) (and .cse16 .cse11 .cse9 .cse17 (= |old(~q_req_up~0)| ~q_req_up~0)) .cse0 .cse18 .cse5) (or .cse3 .cse2 .cse18 (and .cse11 .cse9 .cse17 .cse10) .cse8 (not (= ~q_read_ev~0 ~q_write_ev~0)) (< 0 |old(~q_req_up~0)|) .cse12 .cse1 .cse4 .cse5 .cse7 .cse6 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse13 (and .cse11 .cse19 .cse9 .cse17 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (or .cse12 (not (= 2 ~c_dr_st~0)) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse2 .cse3 .cse4 .cse14 .cse18 .cse6) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse1 .cse2 .cse3 .cse15 .cse0 .cse20 (not .cse21)) (or .cse1 .cse2 .cse3 .cse15 .cse0 (and .cse9 .cse16 .cse11) .cse20))))) [2018-12-09 09:33:20,019 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-12-09 09:33:20,019 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-09 09:33:20,019 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-09 09:33:20,019 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-09 09:33:20,019 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-09 09:33:20,020 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 09:33:20,020 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2018-12-09 09:33:20,020 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:33:20,020 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-12-09 09:33:20,020 INFO L451 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-12-09 09:33:20,020 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-09 09:33:20,020 INFO L451 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-12-09 09:33:20,020 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-12-09 09:33:20,020 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-12-09 09:33:20,020 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-12-09 09:33:20,020 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse50 (+ ~c_num_read~0 1))) (let ((.cse40 (not (= ~c_dr_pc~0 1))) (.cse28 (= ~c_num_read~0 0)) (.cse44 (<= .cse50 ~p_num_write~0)) (.cse46 (<= ~p_num_write~0 .cse50)) (.cse13 (= 1 |old(~c_dr_pc~0)|)) (.cse49 (+ |old(~c_num_read~0)| 1)) (.cse32 (<= ~p_num_write~0 ~c_num_read~0)) (.cse33 (<= 1 ~q_free~0)) (.cse34 (<= ~c_num_read~0 ~p_num_write~0)) (.cse35 (<= ~q_free~0 1)) (.cse36 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse21 (not (= 0 ~c_dr_st~0))) (.cse22 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse24 (= 1 ~c_dr_pc~0)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= ~q_free~0 0)) (.cse45 (= 2 ~p_dw_st~0)) (.cse27 (= |old(~q_req_up~0)| ~q_req_up~0))) (let ((.cse9 (and .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse45 .cse27)) (.cse41 (= 0 ~p_num_write~0)) (.cse18 (not (= 0 |old(~p_num_write~0)|))) (.cse23 (= ~p_dw_st~0 0)) (.cse15 (not (= |old(~p_dw_st~0)| 0))) (.cse47 (and .cse32 .cse20 .cse21 .cse22 .cse24 .cse25 .cse33 .cse34 .cse45 .cse27 .cse35 .cse36)) (.cse30 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse14 (< |old(~q_free~0)| 1)) (.cse17 (< 1 |old(~q_free~0)|)) (.cse31 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse19 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse37 (< |old(~p_num_write~0)| .cse49)) (.cse10 (not .cse13)) (.cse39 (< .cse49 |old(~p_num_write~0)|)) (.cse38 (and .cse44 .cse20 .cse22 .cse24 .cse25 .cse26 .cse45 .cse27 .cse46)) (.cse8 (= 2 ~c_dr_st~0)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse42 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse6 (not (= ~q_read_ev~0 2))) (.cse48 (and .cse40 .cse22 .cse25 .cse28 .cse26 .cse45 .cse27 (= 1 ~p_num_write~0))) (.cse29 (not (= 1 |old(~p_num_write~0)|))) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse16 (not (= 0 |old(~c_num_read~0)|))) (.cse43 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 .cse12 .cse7) (or .cse13 .cse1 .cse14 .cse2 .cse4 .cse8 .cse15 .cse12 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse6 .cse15 .cse12) (or .cse13 .cse1 .cse2 .cse3 .cse28 .cse11 .cse29 .cse16) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse30 .cse0 .cse14 .cse8 .cse4 .cse5 .cse17 .cse31 .cse19) (or (and .cse32 .cse20 .cse22 .cse23 .cse8 .cse24 .cse25 .cse33 .cse34 .cse27 .cse35 .cse36) (or .cse2 .cse1 .cse10 .cse6 .cse30 .cse0 .cse14 .cse4 .cse5 .cse15 .cse17 .cse31 .cse19)) (or .cse37 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse38 .cse39 .cse12 .cse7) (or (and .cse33 .cse40 .cse22 (= 0 ~p_dw_st~0) .cse25 .cse28 .cse27 .cse35 .cse36 .cse41) .cse2 .cse1 .cse6 .cse18 .cse42 .cse43 .cse13 .cse14 .cse15 .cse12 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse13 .cse1 .cse14 .cse2 .cse11 (and .cse40 .cse21 .cse22 .cse23 .cse25 .cse33 .cse28 .cse35 .cse36 .cse41) .cse15 .cse12 .cse16 .cse17 .cse18 .cse19) (or .cse13 .cse1 .cse2 .cse23 .cse3 .cse11 .cse15) (or .cse37 .cse1 .cse2 .cse10 .cse39 .cse6 .cse7 (and .cse44 .cse20 .cse22 .cse8 .cse24 .cse25 .cse26 .cse45 .cse27 .cse46) (= 0 ~q_write_ev~0) .cse43 .cse3 .cse4) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse30 .cse0 .cse14 .cse5 .cse11 .cse17 .cse31 .cse19 .cse47) (or .cse37 .cse1 .cse2 .cse10 (and .cse44 .cse46) .cse39 .cse6 .cse0 .cse3 .cse5 .cse11 .cse15 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse30 .cse0 .cse14 .cse8 .cse4 .cse5 .cse12 .cse17 .cse31 .cse19) (or (or .cse0 .cse30 .cse1 .cse14 .cse2 .cse10 .cse4 .cse7 .cse17 .cse31 .cse19 .cse43) (and .cse32 .cse20 .cse22 .cse8 .cse24 .cse25 .cse33 .cse34 .cse45 .cse27 .cse35 .cse36)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse47 .cse7 .cse30 .cse0 .cse14 .cse5 .cse11 .cse12 .cse17 .cse31 .cse19) (or (or .cse37 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse39 .cse6 .cse7) .cse38) (or .cse8 .cse13 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse1 .cse6 .cse48 .cse7 .cse42 .cse13 .cse3 .cse5 .cse29 .cse12 .cse16) (or .cse13 .cse1 .cse2 .cse3 .cse11 (and .cse26 .cse40 .cse20 .cse21 .cse22 .cse25)) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse6 .cse48 .cse29 .cse12 .cse7 .cse16 .cse43))))) [2018-12-09 09:33:20,020 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-12-09 09:33:20,021 INFO L448 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-12-09 09:33:20,021 INFO L444 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse33 (= 1 |old(~c_dr_pc~0)|)) (.cse54 (= ~p_dw_st~0 0)) (.cse56 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse55 (= ~p_dw_i~0 1)) (.cse51 (= ~c_num_read~0 1)) (.cse47 (not (= ~c_dr_pc~0 1))) (.cse53 (= ~c_num_read~0 0)) (.cse20 (= ~q_free~0 0)) (.cse52 (= 1 ~p_num_write~0)) (.cse57 (+ |old(~c_num_read~0)| 1)) (.cse58 (+ ~c_num_read~0 1)) (.cse8 (= 2 ~c_dr_st~0)) (.cse34 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse40 (not (= 0 ~c_dr_st~0))) (.cse17 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse35 (<= 1 ~q_free~0)) (.cse36 (<= ~c_num_read~0 ~p_num_write~0)) (.cse21 (= 2 ~p_dw_st~0)) (.cse22 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse37 (<= ~q_free~0 1)) (.cse38 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse30 (and .cse34 .cse16 .cse40 .cse17 .cse18 .cse19 .cse35 .cse36 .cse21 .cse22 .cse37 .cse38)) (.cse31 (and .cse34 .cse16 .cse17 .cse8 .cse18 .cse19 .cse35 .cse36 .cse21 .cse37 .cse38)) (.cse15 (<= .cse58 ~p_num_write~0)) (.cse23 (<= ~p_num_write~0 .cse58)) (.cse13 (< |old(~p_num_write~0)| .cse57)) (.cse14 (< .cse57 |old(~p_num_write~0)|)) (.cse25 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse28 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse41 (and .cse47 .cse17 .cse19 .cse53 .cse20 .cse21 .cse22 .cse52)) (.cse45 (not (= 1 |old(~p_num_write~0)|))) (.cse44 (and .cse17 .cse8 .cse18 .cse19 .cse51 .cse35 .cse21 .cse37 .cse52 .cse38)) (.cse48 (and .cse20 .cse47 .cse40 .cse55 .cse19)) (.cse9 (and .cse16 .cse40 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse42 (not .cse56)) (.cse43 (and .cse47 .cse40 .cse19 (= 2 ~q_read_ev~0) .cse20 .cse56 .cse55)) (.cse24 (< 0 |old(~q_req_up~0)|)) (.cse50 (and .cse47 .cse40 .cse17 .cse54 .cse19 .cse35 .cse53 .cse37 .cse38 (= 0 ~p_num_write~0))) (.cse49 (not (= 0 |old(~p_num_write~0)|))) (.cse26 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse46 (not (= 0 |old(~c_num_read~0)|))) (.cse27 (< 1 |old(~q_free~0)|)) (.cse29 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse55)) (.cse10 (not .cse33)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse32 (not (= |old(~p_dw_st~0)| 0))) (.cse12 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 .cse12 .cse7) (or .cse13 .cse1 .cse2 .cse10 .cse14 .cse6 .cse7 (and .cse15 .cse16 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (= 0 ~q_write_ev~0) .cse24 .cse3 .cse4) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse27 .cse28 .cse29 .cse30) (or .cse13 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse14 .cse12 .cse7 .cse31) (or .cse13 .cse1 .cse2 .cse10 (and .cse15 .cse23) .cse14 .cse6 .cse0 .cse3 .cse5 .cse11 .cse32 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse12 .cse27 .cse28 .cse29) (or .cse33 .cse1 .cse2 .cse3 .cse4 .cse8) (or (or .cse0 .cse25 .cse1 .cse26 .cse2 .cse10 .cse4 .cse7 .cse27 .cse28 .cse29 .cse24) (and .cse34 .cse16 .cse17 .cse8 .cse18 .cse19 .cse35 .cse36 .cse21 .cse22 .cse37 .cse38)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse32 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse30 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse12 .cse27 .cse28 .cse29) (or (or .cse2 .cse1 .cse10 .cse6 .cse25 .cse0 .cse26 .cse4 .cse5 .cse32 .cse27 .cse28 .cse29) (or (let ((.cse39 (+ |old(~p_num_write~0)| 1))) (and .cse15 .cse8 .cse18 .cse19 (<= .cse39 ~p_num_write~0) (<= ~p_num_write~0 .cse39) .cse20 .cse21 .cse23)) (and .cse15 (= 1 |old(~p_dw_pc~0)|) .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse23))) (or .cse31 (and .cse15 .cse16 .cse40 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse13 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse14 .cse6 .cse7)) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse27 .cse28 .cse29) (or .cse2 .cse1 .cse6 .cse41 .cse7 .cse42 .cse43 .cse33 .cse3 .cse5 .cse44 .cse45 .cse12 .cse46) (or .cse1 .cse2 .cse6 .cse41 .cse7 .cse24 .cse33 .cse0 .cse3 .cse45 .cse12 .cse46 .cse44 (and .cse20 .cse47 .cse40 .cse19)) (or .cse48 .cse33 .cse1 .cse2 .cse3 .cse11) (or .cse1 .cse2 .cse49 .cse48 .cse33 .cse26 .cse11 .cse50 .cse32 .cse12 .cse46 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or (and .cse8 .cse18 .cse19 .cse51 .cse35 .cse21 .cse37 .cse52 .cse38) .cse2 .cse1 (and .cse8 .cse19 .cse53 .cse20 .cse21 .cse52) .cse6 .cse49 .cse42 .cse43 .cse24 .cse33 .cse26 .cse50 .cse32 .cse12 .cse46 .cse27 .cse29) (or .cse1 .cse2 .cse49 .cse33 .cse26 .cse4 .cse8 .cse32 .cse12 .cse46 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse16 .cse40 .cse18 .cse19 .cse20 .cse21 .cse22) .cse11 (and .cse16 .cse40 .cse17 .cse54 .cse18 .cse19 .cse20 .cse22) .cse6 .cse32 .cse12)))) [2018-12-09 09:33:20,021 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-12-09 09:33:20,022 INFO L444 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse62 (+ ~c_num_read~0 1))) (let ((.cse45 (= 1 |old(~c_dr_pc~0)|)) (.cse57 (= ~p_dw_st~0 0)) (.cse41 (= 0 ~p_num_write~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse51 (= ~c_num_read~0 1)) (.cse40 (= ~c_num_read~0 0)) (.cse43 (= 1 ~p_num_write~0)) (.cse38 (not (= ~c_dr_pc~0 1))) (.cse59 (= ~p_dw_i~0 1)) (.cse60 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse55 (not (= 0 ~c_dr_st~0))) (.cse15 (<= 1 ~q_free~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~q_free~0 1)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse61 (+ |old(~c_num_read~0)| 1)) (.cse27 (<= .cse62 ~p_num_write~0)) (.cse11 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse12 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse13 (= 1 ~c_dr_pc~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~q_free~0 0)) (.cse17 (= 2 ~p_dw_st~0)) (.cse29 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse30 (<= ~p_num_write~0 .cse62))) (let ((.cse9 (and .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse29 .cse30)) (.cse21 (< |old(~p_num_write~0)| .cse61)) (.cse23 (< .cse61 |old(~p_num_write~0)|)) (.cse37 (and .cse10 .cse11 .cse55 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20)) (.cse48 (not .cse60)) (.cse44 (and .cse38 .cse55 .cse14 (= 2 ~q_read_ev~0) .cse28 .cse60 .cse59)) (.cse52 (and .cse38 .cse12 .cse14 .cse40 .cse28 .cse17 .cse29 .cse43)) (.cse31 (< 0 |old(~q_req_up~0)|)) (.cse54 (not (= 1 |old(~p_num_write~0)|))) (.cse53 (and .cse12 .cse8 .cse13 .cse14 .cse51 .cse15 .cse17 .cse18 .cse43 .cse20)) (.cse19 (not (= 0 eval_~tmp___1~0))) (.cse32 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse56 (and .cse28 .cse38 .cse55 .cse59 .cse14)) (.cse49 (and .cse38 .cse55 .cse12 .cse57 .cse14 .cse15 .cse40 .cse18 .cse20 .cse41)) (.cse24 (and .cse11 .cse55 .cse12 .cse13 .cse14 .cse28 .cse17 .cse29)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse47 (not (= 0 |old(~p_num_write~0)|))) (.cse33 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse46 (not (= 0 |old(~c_num_read~0)|))) (.cse34 (< 1 |old(~q_free~0)|)) (.cse36 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse59)) (.cse22 (not .cse45)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse25 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse50 (not (= |old(~p_dw_st~0)| 0))) (.cse26 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse23 .cse6 .cse7)) (or .cse24 .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse25 .cse26 .cse7) (or .cse21 .cse1 .cse2 .cse22 .cse23 .cse6 .cse7 (and .cse27 .cse11 .cse12 .cse8 .cse13 .cse14 .cse28 .cse17 .cse29 .cse30) (= 0 ~q_write_ev~0) .cse31 .cse3 .cse4) (or .cse2 .cse1 .cse22 .cse6 .cse7 .cse32 .cse0 .cse33 .cse5 .cse25 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse9 .cse23 .cse26 .cse7 (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20)) (let ((.cse42 (= eval_~tmp___1~0 1)) (.cse39 (= 0 ~p_dw_st~0))) (or (and .cse15 .cse38 .cse12 .cse39 .cse14 .cse40 .cse29 .cse18 .cse20 .cse41) .cse2 (and .cse38 .cse42 .cse14 .cse40 .cse28 .cse17 .cse43) .cse44 .cse31 (and .cse42 .cse8 .cse15 .cse12 .cse39 .cse14 .cse40 .cse29 .cse18 .cse20 .cse41) .cse45 .cse33 .cse26 .cse46 .cse34 .cse36 .cse1 (and .cse8 .cse14 .cse40 .cse28 .cse17 .cse19 .cse43) .cse6 .cse47 .cse48 .cse49 .cse50 (and .cse8 .cse13 .cse14 .cse51 .cse15 .cse17 .cse18 .cse19 .cse43 .cse20))) (or .cse21 .cse1 .cse2 .cse22 (and .cse27 .cse30) .cse23 .cse6 .cse0 .cse3 .cse5 .cse25 .cse50 .cse26) (or .cse2 .cse1 .cse22 .cse7 .cse32 .cse0 .cse33 .cse8 .cse4 .cse5 .cse26 .cse34 .cse35 .cse36) (or .cse45 .cse1 .cse2 .cse3 .cse4 .cse8) (or (or .cse0 .cse32 .cse1 .cse33 .cse2 .cse22 .cse4 .cse7 .cse34 .cse35 .cse36 .cse31) (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse50 .cse26 .cse8) (or .cse2 .cse1 .cse22 .cse37 .cse7 .cse32 .cse0 .cse33 .cse5 .cse25 .cse26 .cse34 .cse35 .cse36) (or .cse2 .cse1 .cse22 .cse6 .cse7 .cse32 .cse0 .cse33 .cse8 .cse4 .cse5 .cse34 .cse35 .cse36) (or .cse2 .cse1 .cse6 .cse52 .cse7 .cse48 .cse44 .cse45 .cse3 .cse5 .cse53 .cse54 .cse26 .cse46) (or .cse1 .cse2 .cse6 .cse52 .cse7 .cse31 .cse45 .cse0 .cse3 .cse54 .cse26 .cse46 .cse53 (and .cse28 .cse38 .cse55 .cse14)) (or .cse56 .cse45 .cse1 .cse2 .cse3 .cse25) (or (and .cse10 .cse11 .cse12 .cse57 .cse8 .cse13 .cse14 .cse15 .cse16 .cse29 .cse18 .cse20) (or (and .cse27 (= 1 |old(~p_dw_pc~0)|) .cse12 .cse8 .cse13 .cse14 .cse28 .cse17 .cse19 .cse30) (let ((.cse58 (+ |old(~p_num_write~0)| 1))) (and .cse27 .cse8 .cse13 .cse14 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse28 .cse17 .cse19 .cse30))) (or .cse2 .cse1 .cse22 .cse6 .cse32 .cse0 .cse33 .cse4 .cse5 .cse50 .cse34 .cse35 .cse36)) (or .cse1 .cse2 .cse47 .cse56 .cse45 .cse33 .cse25 .cse49 .cse50 .cse26 .cse46 .cse34 .cse36) (or .cse0 .cse1 .cse2 .cse22 .cse24 .cse3 .cse5 .cse25 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse26 .cse7) (or .cse1 .cse2 .cse47 .cse45 .cse33 .cse4 .cse8 .cse50 .cse26 .cse46 .cse34 .cse36) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 (and .cse11 .cse55 .cse13 .cse14 .cse28 .cse17 .cse29) .cse25 (and .cse11 .cse55 .cse12 .cse57 .cse13 .cse14 .cse28 .cse29) .cse6 .cse50 .cse26))))) [2018-12-09 09:33:20,022 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-12-09 09:33:20,022 INFO L444 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse46 (+ |old(~c_num_read~0)| 1)) (.cse48 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse16 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse47 (= 2 ~q_read_ev~0)) (.cse18 (<= 1 ~q_free~0)) (.cse19 (= ~c_num_read~0 0)) (.cse20 (<= ~q_free~0 1)) (.cse44 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= 0 ~p_num_write~0)) (.cse34 (= ~q_free~0 0)) (.cse14 (not (= ~c_dr_pc~0 1))) (.cse15 (not (= 0 ~c_dr_st~0))) (.cse45 (= ~p_dw_i~0 1)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse12 (and .cse34 .cse14 .cse15 .cse45 .cse17)) (.cse32 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse37 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse38 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse5 (= 2 ~c_dr_st~0)) (.cse33 (= 1 ~c_dr_pc~0)) (.cse42 (= eval_~tmp___1~0 1)) (.cse35 (not (= 0 ~p_dw_st~0))) (.cse36 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse43 (and .cse14 .cse15 .cse16 .cse17 .cse47 .cse18 .cse19 .cse20 .cse44 .cse45 .cse21)) (.cse2 (not (= 0 |old(~p_num_write~0)|))) (.cse39 (not .cse48)) (.cse40 (and .cse14 .cse15 .cse17 .cse47 .cse34 .cse48 .cse45)) (.cse4 (< |old(~q_free~0)| 1)) (.cse13 (= 0 |old(~c_dr_st~0)|)) (.cse7 (not (= |old(~p_dw_st~0)| 0))) (.cse10 (< 1 |old(~q_free~0)|)) (.cse11 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse22 (< |old(~p_num_write~0)| .cse46)) (.cse24 (not .cse3)) (.cse26 (= 1 |old(~q_req_up~0)|)) (.cse27 (< .cse46 |old(~p_num_write~0)|)) (.cse23 (< ~q_write_ev~0 2)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse45)) (.cse25 (not (= |old(~q_free~0)| 0))) (.cse30 (not (= ~q_read_ev~0 2))) (.cse41 (not (= 1 |old(~p_num_write~0)|))) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse28 (not (= |old(~p_dw_st~0)| 2))) (.cse9 (not (= 0 |old(~c_num_read~0)|))) (.cse31 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse13 .cse7 .cse8 .cse9 .cse10 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11) (or .cse22 .cse23 .cse0 .cse1 .cse24 .cse25 .cse26 .cse27 .cse8 .cse28) (or (let ((.cse29 (+ ~c_num_read~0 1))) (and (<= .cse29 ~p_num_write~0) (<= ~p_num_write~0 .cse29))) .cse22 .cse0 .cse1 .cse24 .cse27 .cse30 .cse23 .cse25 .cse26 .cse13 .cse7 .cse8) (or .cse3 .cse0 .cse1 .cse25 .cse6 .cse5) (or .cse22 .cse0 .cse1 .cse24 .cse25 .cse6 .cse27 .cse30 .cse28 (= 0 ~q_write_ev~0) .cse31) (or .cse23 .cse0 .cse1 .cse24 .cse25 .cse26 .cse13 .cse30 .cse28) (or .cse23 .cse0 .cse1 .cse24 .cse25 .cse26 .cse13 .cse8 .cse28) (or .cse23 .cse0 .cse1 .cse25 .cse6 .cse26 .cse30 .cse5 .cse7 .cse8) (or (and .cse32 .cse15 .cse16 .cse33 .cse17 .cse34 .cse35 .cse36) .cse23 .cse0 .cse1 .cse24 .cse25 .cse26 .cse13 .cse30 .cse7 .cse8) (or .cse23 .cse37 .cse0 .cse4 .cse1 .cse24 .cse6 .cse28 .cse10 .cse38 .cse11 .cse31) (or .cse1 .cse0 .cse24 .cse28 .cse37 .cse23 .cse4 .cse26 .cse13 .cse8 .cse10 .cse38 .cse11) (or .cse1 .cse0 .cse30 .cse28 .cse39 .cse40 .cse25 .cse26 .cse41 .cse8 .cse9) (or .cse12 .cse3 .cse0 .cse1 .cse25 .cse13) (or .cse1 .cse0 .cse24 .cse30 .cse28 .cse37 .cse23 .cse4 .cse26 .cse13 .cse10 .cse38 .cse11) (or (and .cse42 (and .cse35 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse32 .cse16 .cse20 .cse33 .cse17 .cse18) .cse5)) (or .cse1 .cse0 .cse24 .cse30 .cse37 .cse23 .cse4 .cse6 .cse26 .cse7 .cse10 .cse38 .cse11)) (or .cse1 .cse0 .cse43 .cse30 .cse2 .cse39 .cse40 .cse31 (and .cse42 .cse5 .cse18 .cse35 .cse16 .cse33 .cse17 .cse19 .cse36 .cse20 .cse21) .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse42 .cse18 .cse35 .cse14 .cse16 .cse17 .cse19 .cse36 .cse20 .cse44 .cse21)) (or .cse1 .cse0 .cse30 .cse43 .cse2 .cse39 .cse40 .cse3 .cse4 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse22 .cse23 .cse0 .cse1 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (or .cse23 .cse0 .cse1 .cse25 .cse30 .cse41 .cse8 .cse28 .cse9 (and .cse34 .cse14 .cse15 .cse17) .cse31)))) [2018-12-09 09:33:20,022 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-12-09 09:33:20,022 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-12-09 09:33:20,022 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-09 09:33:20,023 INFO L444 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse62 (+ ~c_num_read~0 1))) (let ((.cse45 (= 1 |old(~c_dr_pc~0)|)) (.cse57 (= ~p_dw_st~0 0)) (.cse41 (= 0 ~p_num_write~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse51 (= ~c_num_read~0 1)) (.cse40 (= ~c_num_read~0 0)) (.cse43 (= 1 ~p_num_write~0)) (.cse38 (not (= ~c_dr_pc~0 1))) (.cse59 (= ~p_dw_i~0 1)) (.cse60 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse55 (not (= 0 ~c_dr_st~0))) (.cse15 (<= 1 ~q_free~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~q_free~0 1)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse61 (+ |old(~c_num_read~0)| 1)) (.cse27 (<= .cse62 ~p_num_write~0)) (.cse11 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse12 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse13 (= 1 ~c_dr_pc~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~q_free~0 0)) (.cse17 (= 2 ~p_dw_st~0)) (.cse29 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse30 (<= ~p_num_write~0 .cse62))) (let ((.cse9 (and .cse27 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse29 .cse30)) (.cse21 (< |old(~p_num_write~0)| .cse61)) (.cse23 (< .cse61 |old(~p_num_write~0)|)) (.cse37 (and .cse10 .cse11 .cse55 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20)) (.cse48 (not .cse60)) (.cse44 (and .cse38 .cse55 .cse14 (= 2 ~q_read_ev~0) .cse28 .cse60 .cse59)) (.cse52 (and .cse38 .cse12 .cse14 .cse40 .cse28 .cse17 .cse29 .cse43)) (.cse31 (< 0 |old(~q_req_up~0)|)) (.cse54 (not (= 1 |old(~p_num_write~0)|))) (.cse53 (and .cse12 .cse8 .cse13 .cse14 .cse51 .cse15 .cse17 .cse18 .cse43 .cse20)) (.cse19 (not (= 0 eval_~tmp___1~0))) (.cse32 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse56 (and .cse28 .cse38 .cse55 .cse59 .cse14)) (.cse49 (and .cse38 .cse55 .cse12 .cse57 .cse14 .cse15 .cse40 .cse18 .cse20 .cse41)) (.cse24 (and .cse11 .cse55 .cse12 .cse13 .cse14 .cse28 .cse17 .cse29)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse47 (not (= 0 |old(~p_num_write~0)|))) (.cse33 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse46 (not (= 0 |old(~c_num_read~0)|))) (.cse34 (< 1 |old(~q_free~0)|)) (.cse36 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse59)) (.cse22 (not .cse45)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse25 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse50 (not (= |old(~p_dw_st~0)| 0))) (.cse26 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse23 .cse6 .cse7)) (or .cse24 .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse25 .cse26 .cse7) (or .cse21 .cse1 .cse2 .cse22 .cse23 .cse6 .cse7 (and .cse27 .cse11 .cse12 .cse8 .cse13 .cse14 .cse28 .cse17 .cse29 .cse30) (= 0 ~q_write_ev~0) .cse31 .cse3 .cse4) (or .cse2 .cse1 .cse22 .cse6 .cse7 .cse32 .cse0 .cse33 .cse5 .cse25 .cse34 .cse35 .cse36 .cse37) (or .cse21 .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse9 .cse23 .cse26 .cse7 (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20)) (let ((.cse42 (= eval_~tmp___1~0 1)) (.cse39 (= 0 ~p_dw_st~0))) (or (and .cse15 .cse38 .cse12 .cse39 .cse14 .cse40 .cse29 .cse18 .cse20 .cse41) .cse2 (and .cse38 .cse42 .cse14 .cse40 .cse28 .cse17 .cse43) .cse44 .cse31 (and .cse42 .cse8 .cse15 .cse12 .cse39 .cse14 .cse40 .cse29 .cse18 .cse20 .cse41) .cse45 .cse33 .cse26 .cse46 .cse34 .cse36 .cse1 (and .cse8 .cse14 .cse40 .cse28 .cse17 .cse19 .cse43) .cse6 .cse47 .cse48 .cse49 .cse50 (and .cse8 .cse13 .cse14 .cse51 .cse15 .cse17 .cse18 .cse19 .cse43 .cse20))) (or .cse21 .cse1 .cse2 .cse22 (and .cse27 .cse30) .cse23 .cse6 .cse0 .cse3 .cse5 .cse25 .cse50 .cse26) (or .cse2 .cse1 .cse22 .cse7 .cse32 .cse0 .cse33 .cse8 .cse4 .cse5 .cse26 .cse34 .cse35 .cse36) (or .cse45 .cse1 .cse2 .cse3 .cse4 .cse8) (or (or .cse0 .cse32 .cse1 .cse33 .cse2 .cse22 .cse4 .cse7 .cse34 .cse35 .cse36 .cse31) (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse50 .cse26 .cse8) (or .cse2 .cse1 .cse22 .cse37 .cse7 .cse32 .cse0 .cse33 .cse5 .cse25 .cse26 .cse34 .cse35 .cse36) (or .cse2 .cse1 .cse22 .cse6 .cse7 .cse32 .cse0 .cse33 .cse8 .cse4 .cse5 .cse34 .cse35 .cse36) (or .cse2 .cse1 .cse6 .cse52 .cse7 .cse48 .cse44 .cse45 .cse3 .cse5 .cse53 .cse54 .cse26 .cse46) (or .cse1 .cse2 .cse6 .cse52 .cse7 .cse31 .cse45 .cse0 .cse3 .cse54 .cse26 .cse46 .cse53 (and .cse28 .cse38 .cse55 .cse14)) (or .cse56 .cse45 .cse1 .cse2 .cse3 .cse25) (or (and .cse10 .cse11 .cse12 .cse57 .cse8 .cse13 .cse14 .cse15 .cse16 .cse29 .cse18 .cse20) (or (and .cse27 (= 1 |old(~p_dw_pc~0)|) .cse12 .cse8 .cse13 .cse14 .cse28 .cse17 .cse19 .cse30) (let ((.cse58 (+ |old(~p_num_write~0)| 1))) (and .cse27 .cse8 .cse13 .cse14 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse28 .cse17 .cse19 .cse30))) (or .cse2 .cse1 .cse22 .cse6 .cse32 .cse0 .cse33 .cse4 .cse5 .cse50 .cse34 .cse35 .cse36)) (or .cse1 .cse2 .cse47 .cse56 .cse45 .cse33 .cse25 .cse49 .cse50 .cse26 .cse46 .cse34 .cse36) (or .cse0 .cse1 .cse2 .cse22 .cse24 .cse3 .cse5 .cse25 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse26 .cse7) (or .cse1 .cse2 .cse47 .cse45 .cse33 .cse4 .cse8 .cse50 .cse26 .cse46 .cse34 .cse36) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 (and .cse11 .cse55 .cse13 .cse14 .cse28 .cse17 .cse29) .cse25 (and .cse11 .cse55 .cse12 .cse57 .cse13 .cse14 .cse28 .cse29) .cse6 .cse50 .cse26))))) [2018-12-09 09:33:20,023 INFO L444 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse37 (+ |old(~c_num_read~0)| 1)) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse9 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (not (= 0 ~c_dr_st~0))) (.cse13 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~q_free~0 0)) (.cse11 (= 2 ~p_dw_st~0)) (.cse14 (= |old(~q_req_up~0)| ~q_req_up~0))) (let ((.cse6 (= eval_~tmp___1~0 1)) (.cse34 (let ((.cse38 (+ ~c_num_read~0 1))) (and (<= .cse38 ~p_num_write~0) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse7 .cse13 (= 1 ~c_dr_pc~0) .cse8 .cse10 .cse11 .cse14 (<= ~p_num_write~0 .cse38)))) (.cse20 (not (= |old(~p_dw_st~0)| 0))) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse25 (not .cse0)) (.cse26 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse19 (< |old(~q_free~0)| 1)) (.cse23 (< 1 |old(~q_free~0)|)) (.cse30 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse27 (< ~q_write_ev~0 2)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse35 (and .cse5 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12)) (.cse17 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse29 (= 1 |old(~q_req_up~0)|)) (.cse36 (not (= 1 |old(~p_num_write~0)|))) (.cse21 (= |old(~p_dw_pc~0)| 1)) (.cse22 (not (= 0 |old(~c_num_read~0)|))) (.cse32 (< |old(~p_num_write~0)| .cse37)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse28 (not (= 2 |old(~c_dr_st~0)|))) (.cse33 (< .cse37 |old(~p_num_write~0)|)) (.cse15 (not (= ~q_read_ev~0 2))) (.cse31 (not (= |old(~p_dw_st~0)| 2))) (.cse18 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse1 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse6 .cse7 (<= 1 ~q_free~0) .cse5 .cse13 (= 0 ~p_dw_st~0) .cse8 .cse9 .cse14 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) .cse15 .cse16 .cse17 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse2 .cse1 .cse25 .cse15 .cse26 .cse27 .cse19 .cse28 .cse29 .cse20 .cse23 .cse30 .cse24) (or .cse27 .cse1 .cse2 .cse3 .cse29 .cse4 .cse15 .cse20 .cse21) (or .cse27 .cse26 .cse1 .cse19 .cse2 .cse25 .cse28 .cse31 .cse23 .cse30 .cse24 .cse18) (or .cse2 .cse1 .cse25 .cse31 .cse26 .cse27 .cse19 .cse29 .cse4 .cse21 .cse23 .cse30 .cse24) (or (or .cse32 .cse27 .cse1 .cse2 .cse25 .cse3 .cse29 .cse33 .cse15 .cse31) (and .cse6 .cse34)) (or .cse27 .cse1 .cse2 .cse3 .cse29 .cse4 .cse15 .cse31) (or .cse32 .cse27 .cse1 .cse2 .cse25 .cse3 .cse29 .cse33 .cse34 .cse21 .cse31) (or .cse0 .cse1 .cse19 .cse2 .cse4 .cse20 .cse21 .cse22 .cse23 .cse16 .cse24) (or .cse0 .cse27 .cse1 .cse2 .cse3 .cse15 .cse35 .cse36 .cse21 .cse31 .cse22 .cse18) (or .cse2 .cse1 .cse25 .cse15 .cse31 .cse26 .cse27 .cse19 .cse29 .cse4 .cse23 .cse30 .cse24) (or .cse27 .cse1 .cse2 .cse3 .cse29 .cse4 .cse21 .cse31) (or .cse2 .cse1 .cse35 .cse15 .cse31 .cse17 .cse0 .cse3 .cse29 .cse36 .cse21 .cse22) (or .cse32 .cse1 .cse2 .cse3 .cse28 .cse33 .cse15 .cse31 (= 0 ~q_write_ev~0) .cse18)))) [2018-12-09 09:33:20,025 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-12-09 09:33:20,025 INFO L444 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse17 (= 1 ~c_dr_pc~0))) (let ((.cse24 (not .cse17)) (.cse21 (not (= ~q_read_ev~0 2))) (.cse28 (+ ~c_num_read~0 1))) (let ((.cse16 (not (= 0 ~p_num_write~0))) (.cse5 (< 0 ~q_req_up~0)) (.cse7 (not (= 2 ~c_dr_st~0))) (.cse12 (not (= ~p_dw_st~0 0))) (.cse0 (< ~p_num_write~0 .cse28)) (.cse3 (< .cse28 ~p_num_write~0)) (.cse8 (or .cse24 .cse21)) (.cse19 (< ~q_write_ev~0 2)) (.cse23 (< ~p_num_write~0 ~c_num_read~0)) (.cse10 (< ~q_free~0 1)) (.cse11 (= 0 ~c_dr_st~0)) (.cse15 (< 1 ~q_free~0)) (.cse25 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (not (= ~q_read_ev~0 1))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse9 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (not (= ~q_free~0 0))) (.cse20 (= 1 ~q_req_up~0)) (.cse26 (not (= 1 ~p_num_write~0))) (.cse13 (= ~p_dw_pc~0 1)) (.cse14 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~q_write_ev~0) .cse5 (= 1 ~q_write_ev~0) .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse1 .cse11 .cse12 .cse13 .cse14 .cse9 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse2 .cse1 .cse6 .cse20 .cse11 .cse8 .cse12 .cse13 .cse9) (or .cse9 .cse1 .cse2 .cse21 .cse16 .cse22 .cse5 .cse17 .cse10 .cse12 .cse13 .cse14 .cse15 .cse18) (or .cse1 .cse2 .cse9 .cse4 .cse23 .cse19 .cse10 .cse20 .cse11 .cse24 .cse13 .cse15 .cse25 .cse18) (or .cse19 .cse2 .cse1 .cse6 .cse9 .cse26 .cse13 .cse4 .cse14 .cse21 .cse5) (or (or .cse19 (or (or .cse23 .cse2 .cse10 .cse1 .cse7 .cse24 .cse15 .cse25 .cse18) .cse4) .cse5) .cse9) (or .cse27 .cse9 (or .cse1 .cse2 (not (= 1 ~p_dw_pc~0)) .cse5 .cse23 .cse19 .cse10 .cse7 .cse12 .cse24 .cse15 .cse25 .cse18)) (or .cse19 .cse2 .cse1 .cse6 .cse20 .cse11 .cse13 .cse4 .cse9) (or .cse0 .cse19 .cse2 .cse1 .cse6 .cse20 .cse3 .cse9 .cse24 .cse13 .cse4) (or .cse1 .cse2 .cse4 .cse23 .cse19 .cse10 .cse20 .cse9 .cse8 .cse11 .cse15 .cse25 .cse18) (or .cse9 .cse2 .cse1 .cse6 .cse11 .cse17) (or .cse19 .cse2 .cse1 .cse6 .cse20 .cse11 .cse8 .cse9 .cse4) (or .cse9 (or .cse19 .cse20 (or (or .cse23 .cse2 .cse10 .cse1 .cse11 .cse24 .cse15 .cse25 .cse18) .cse4)) .cse27) (or .cse1 .cse2 .cse9 .cse21 .cse4 .cse22 .cse6 .cse20 .cse26 .cse13 .cse14))))) [2018-12-09 09:33:20,028 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-12-09 09:33:20,028 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-09 09:33:20,028 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-12-09 09:33:20,028 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-12-09 09:33:20,028 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-12-09 09:33:20,028 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse19 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse0 (= ~q_free~0 0)) (.cse16 (<= .cse21 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse21)) (.cse5 (not (= ~q_req_up~0 1))) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse17 (= 2 ~c_dr_st~0)) (.cse11 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0))) (or (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse7 .cse8 .cse0 .cse1 .cse4 .cse9 .cse5 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse0 .cse2 .cse6 .cse7) .cse1 .cse3 .cse5) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15 .cse5) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse3 .cse17 .cse6 .cse7 .cse0 .cse1 .cse18) (not (= |old(~q_read_ev~0)| 2)) (and .cse19 .cse2 (= ~p_dw_st~0 0) .cse6 .cse12 .cse8 .cse4 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse20 .cse16 .cse17 (not (= 0 ~q_write_ev~0)) .cse6 .cse7 .cse0 .cse1 .cse18) (and .cse10 .cse3 .cse17 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse2 .cse3 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse0 .cse4 .cse5) (and .cse0 .cse19 .cse2 .cse6) (< |old(~q_free~0)| 1) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15 .cse5) (and (and .cse8 .cse0 .cse4 .cse9 .cse6 .cse7) .cse20 .cse1 .cse3) (and .cse10 .cse20 .cse3 .cse17 .cse11 .cse6 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse3 .cse4 .cse18 .cse5 .cse11 .cse6) (not (= 0 |old(~p_num_write~0)|)) (and .cse10 .cse3 .cse17 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-09 09:33:20,032 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-12-09 09:33:20,032 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse24 (+ ~c_num_read~0 1))) (let ((.cse21 (not (= ~c_dr_pc~0 1))) (.cse19 (= 0 ~p_dw_st~0)) (.cse13 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse22 (= 0 ~p_num_write~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse11 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (<= ~q_req_up~0 0)) (.cse20 (= 2 ~c_dr_st~0)) (.cse15 (<= 1 ~q_free~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse17 (<= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~q_free~0 0)) (.cse4 (<= .cse24 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (<= ~p_num_write~0 .cse24)) (.cse2 (not (= ~q_req_up~0 1))) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse3 .cse0 .cse9 .cse1 .cse10 .cse2 .cse7) (and .cse7 .cse8 .cse11 .cse3 .cse0 .cse10 .cse12 .cse2 .cse13) (and (and .cse3 .cse9 .cse7 .cse8) .cse0 .cse1 .cse2) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse15 .cse16 .cse0 .cse10 .cse17 .cse18 .cse2) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse14 .cse1 .cse19 .cse20 .cse6 .cse7 .cse8 .cse15 .cse16 .cse17 .cse18 .cse2) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse21 .cse9 (= ~p_dw_st~0 0) .cse7 .cse15 .cse11 .cse10 .cse17 .cse18 .cse22) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse23 .cse4 .cse20 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse3 .cse0 .cse5) (and .cse9 .cse1 .cse19 .cse7 .cse8 .cse3 .cse10 .cse2) (and .cse3 .cse21 .cse9 .cse7) (and .cse15 .cse21 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse19 .cse7 .cse11 (= |old(~q_req_up~0)| ~q_req_up~0) .cse17 .cse18 .cse13 .cse22) (< |old(~q_free~0)| 1) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse8 .cse15 .cse16 .cse0 .cse17 .cse18 .cse2) (and (and .cse11 .cse3 .cse10 .cse12 .cse7 .cse8) .cse23 .cse0 .cse1) (and .cse14 .cse23 .cse1 .cse20 .cse6 .cse7 .cse15 .cse16 .cse0 .cse17 .cse18) (and .cse3 .cse4 .cse0 .cse1 .cse10 .cse5 .cse2 .cse6 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-09 09:33:20,034 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-09 09:33:20,034 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-12-09 09:33:20,034 INFO L444 ceAbstractionStarter]: At program point L409-1(lines 406 431) the Hoare annotation is: (let ((.cse24 (+ ~c_num_read~0 1))) (let ((.cse21 (not (= ~c_dr_pc~0 1))) (.cse19 (= 0 ~p_dw_st~0)) (.cse13 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse22 (= 0 ~p_num_write~0)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse11 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (<= ~q_req_up~0 0)) (.cse20 (= 2 ~c_dr_st~0)) (.cse15 (<= 1 ~q_free~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse17 (<= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~q_free~0 0)) (.cse4 (<= .cse24 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (<= ~p_num_write~0 .cse24)) (.cse2 (not (= ~q_req_up~0 1))) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse3 .cse0 .cse9 .cse1 .cse10 .cse2 .cse7) (and .cse7 .cse8 .cse11 .cse3 .cse0 .cse10 .cse12 .cse2 .cse13) (and (and .cse3 .cse9 .cse7 .cse8) .cse0 .cse1 .cse2) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse15 .cse16 .cse0 .cse10 .cse17 .cse18 .cse2) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse14 .cse1 .cse19 .cse20 .cse6 .cse7 .cse8 .cse15 .cse16 .cse17 .cse18 .cse2) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse21 .cse9 (= ~p_dw_st~0 0) .cse7 .cse15 .cse11 .cse10 .cse17 .cse18 .cse22) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse23 .cse4 .cse20 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse3 .cse0 .cse5) (and .cse9 .cse1 .cse19 .cse7 .cse8 .cse3 .cse10 .cse2) (and .cse3 .cse21 .cse9 .cse7) (and .cse15 .cse21 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse19 .cse7 .cse11 (= |old(~q_req_up~0)| ~q_req_up~0) .cse17 .cse18 .cse13 .cse22) (< |old(~q_free~0)| 1) (and .cse14 .cse9 .cse1 .cse6 .cse7 .cse8 .cse15 .cse16 .cse0 .cse17 .cse18 .cse2) (and (and .cse11 .cse3 .cse10 .cse12 .cse7 .cse8) .cse23 .cse0 .cse1) (and .cse14 .cse23 .cse1 .cse20 .cse6 .cse7 .cse15 .cse16 .cse0 .cse17 .cse18) (and .cse3 .cse4 .cse0 .cse1 .cse10 .cse5 .cse2 .cse6 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-09 09:33:20,036 INFO L444 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= 0 ~p_dw_st~0) .cse3 .cse4 (= |old(~q_req_up~0)| ~q_req_up~0) .cse5 .cse6 (= ~q_read_ev~0 ~q_write_ev~0) .cse7) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse1 .cse2 (= ~p_dw_st~0 0) (= 2 ~c_dr_st~0) .cse3 .cse0 .cse4 .cse5 .cse6 .cse7) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-12-09 09:33:20,036 INFO L444 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~p_dw_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 1 ~q_free~0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (<= ~q_free~0 1)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse0 .cse1 .cse2 (= 2 ~c_dr_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~q_req_up~0)| ~q_req_up~0) .cse6 .cse7 (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse8) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-12-09 09:33:20,041 INFO L451 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-12-09 09:33:20,041 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-12-09 09:33:20,041 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-09 09:33:20,041 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse8 (= ~p_dw_st~0 0)) (.cse17 (not (= ~c_dr_pc~0 1))) (.cse15 (= ~q_read_ev~0 1)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (not (= 0 ~c_dr_st~0))) (.cse6 (not (= ~q_req_up~0 1))) (.cse18 (= ~c_num_read~0 0)) (.cse0 (= ~q_free~0 0)) (.cse16 (not (= ~p_dw_pc~0 1))) (.cse22 (= 1 ~p_num_write~0)) (.cse3 (= 2 ~q_read_ev~0)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse9 (= 2 ~c_dr_st~0)) (.cse10 (= 1 ~c_dr_pc~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 1 ~q_free~0)) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= 2 ~p_dw_st~0)) (.cse13 (<= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (= 1 |old(~c_dr_pc~0)|) (and (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6) (and (and .cse7 .cse5 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13 .cse14 .cse6) .cse15) (and .cse7 .cse1 .cse5 .cse10 .cse2 .cse11 .cse12 .cse4 .cse16 .cse13 .cse14 .cse6) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse17 .cse1 .cse8 .cse2 .cse11 .cse18 .cse16 .cse13 .cse14 (= 0 ~p_num_write~0)) (and .cse19 .cse20 .cse9 (not (= 0 ~q_write_ev~0)) .cse2 .cse3 .cse0 .cse4 .cse21) (and .cse0 .cse17 .cse1 .cse2) (< |old(~q_free~0)| 1) (and .cse7 .cse1 .cse5 .cse10 .cse2 .cse3 .cse11 .cse12 .cse4 .cse13 .cse14 .cse6) (and .cse15 (and .cse7 .cse1 .cse5 .cse10 .cse2 .cse11 .cse12 .cse4 .cse13 .cse14 .cse6)) (and .cse0 .cse20 .cse4 .cse5 .cse16 .cse21 .cse6 .cse10 .cse2) (not (= |old(~p_dw_st~0)| 0)) (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (and .cse0 .cse4 .cse1 .cse5 .cse16 .cse6 .cse2) (and .cse2 .cse3 .cse18 .cse0 .cse4 .cse16 .cse22 .cse6 (= ~q_read_ev~0 ~q_write_ev~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (and .cse19 .cse20 .cse10 .cse2 .cse3 .cse0 .cse4 .cse21 (= 1 ~q_write_ev~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse1 .cse5 (= 0 ~p_dw_st~0) .cse2 .cse3 .cse0 .cse16 .cse6) (and (and .cse18 .cse0 .cse16 .cse22 .cse2 .cse3) .cse19 .cse4 .cse5) (and .cse7 .cse19 .cse5 .cse9 .cse10 .cse2 .cse11 .cse12 .cse4 .cse13 .cse14) (not (= 0 |old(~p_num_write~0)|))))) [2018-12-09 09:33:20,041 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 395 437) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-09 09:33:20,042 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-09 09:33:20,042 INFO L444 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= 0 ~p_dw_st~0) .cse3 .cse4 (= |old(~q_req_up~0)| ~q_req_up~0) .cse5 .cse6 (= ~q_read_ev~0 ~q_write_ev~0) .cse7) (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse1 .cse2 (= ~p_dw_st~0 0) (= 2 ~c_dr_st~0) .cse3 .cse0 .cse4 .cse5 .cse6 .cse7) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-12-09 09:33:20,042 INFO L444 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-09 09:33:20,042 INFO L444 ceAbstractionStarter]: At program point L402-1(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-12-09 09:33:20,042 INFO L444 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse22 (+ ~c_num_read~0 1))) (let ((.cse18 (= 0 ~p_dw_st~0)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse11 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse21 (<= ~q_req_up~0 0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse14 (<= 1 ~q_free~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~q_free~0 0)) (.cse4 (<= .cse22 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (<= ~p_num_write~0 .cse22)) (.cse2 (not (= ~q_req_up~0 1))) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse3 .cse0 .cse9 .cse1 .cse10 .cse2 .cse7) (and .cse7 .cse8 .cse11 .cse3 .cse0 .cse10 .cse12 .cse2 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse3 .cse9 .cse7 .cse8) .cse0 .cse1 .cse2) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse13 .cse9 .cse1 .cse6 .cse7 .cse14 .cse15 .cse0 .cse10 .cse16 .cse17 .cse2) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse13 .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse14 .cse15 .cse16 .cse17 .cse2) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse20 .cse9 (= ~p_dw_st~0 0) .cse7 .cse14 .cse11 .cse10 .cse16 .cse17 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse21 .cse4 .cse19 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse3 .cse0 .cse5) (and .cse9 .cse1 .cse18 .cse7 .cse8 .cse3 .cse10 .cse2) (and .cse3 .cse20 .cse9 .cse7) (< |old(~q_free~0)| 1) (and .cse13 .cse9 .cse1 .cse6 .cse7 .cse8 .cse14 .cse15 .cse0 .cse16 .cse17 .cse2) (and (and .cse11 .cse3 .cse10 .cse12 .cse7 .cse8) .cse21 .cse0 .cse1) (and .cse13 .cse21 .cse1 .cse19 .cse6 .cse7 .cse14 .cse15 .cse0 .cse16 .cse17) (and .cse3 .cse4 .cse0 .cse1 .cse10 .cse5 .cse2 .cse6 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-09 09:33:20,044 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse16 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~q_free~0 0)) (.cse18 (<= .cse21 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse20 (<= ~p_num_write~0 .cse21)) (.cse5 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse7 .cse8 .cse0 .cse1 .cse4 .cse9 .cse5 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse0 .cse2 .cse6 .cse7) .cse1 .cse3 .cse5) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15 .cse5) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse16 .cse2 (= ~p_dw_st~0 0) .cse6 .cse12 .cse8 .cse4 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse2 .cse3 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse0 .cse4 .cse5) (and .cse0 .cse16 .cse2 .cse6) (< |old(~q_free~0)| 1) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15 .cse5) (and (and .cse8 .cse0 .cse4 .cse9 .cse6 .cse7) .cse17 .cse1 .cse3) (and .cse17 .cse18 .cse19 .cse6 .cse7 .cse0 .cse1 .cse20) (and .cse10 .cse17 .cse3 .cse19 .cse11 .cse6 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse0 .cse18 .cse1 .cse3 .cse4 .cse20 .cse5 .cse11 .cse6) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-09 09:33:20,045 INFO L444 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse16 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse7 (= 2 ~q_read_ev~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~q_free~0 0)) (.cse18 (<= .cse21 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse20 (<= ~p_num_write~0 .cse21)) (.cse5 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse7 .cse8 .cse0 .cse1 .cse4 .cse9 .cse5 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse0 .cse2 .cse6 .cse7) .cse1 .cse3 .cse5) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse13 .cse1 .cse4 .cse14 .cse15 .cse5) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse16 .cse2 (= ~p_dw_st~0 0) .cse6 .cse12 .cse8 .cse4 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse17 .cse18 .cse19 (not (= 0 ~q_write_ev~0)) .cse6 .cse7 .cse0 .cse1 .cse20) (and .cse2 .cse3 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse0 .cse4 .cse5) (and .cse0 .cse16 .cse2 .cse6) (< |old(~q_free~0)| 1) (and .cse10 .cse2 .cse3 .cse11 .cse6 .cse7 .cse12 .cse13 .cse1 .cse14 .cse15 .cse5) (and (and .cse8 .cse0 .cse4 .cse9 .cse6 .cse7) .cse17 .cse1 .cse3) (and .cse10 .cse17 .cse3 .cse19 .cse11 .cse6 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse0 .cse18 .cse1 .cse3 .cse4 .cse20 .cse5 .cse11 .cse6) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-12-09 09:33:20,046 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse24 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse19 (< ~p_num_write~0 .cse29)) (.cse20 (< .cse29 ~p_num_write~0)) (.cse26 (not (= 2 ~c_dr_st~0))) (.cse23 (not (= 0 ~p_num_write~0))) (.cse18 (< 0 ~q_req_up~0)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse22 (not (= ~p_dw_st~0 0))) (.cse2 (not .cse21)) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse7 (< ~q_free~0 1)) (.cse9 (= 0 ~c_dr_st~0)) (.cse11 (< 1 ~q_free~0)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse24)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse15 (not (= |old(~q_read_ev~0)| 2))) (.cse4 (not (= ~p_dw_st~0 2))) (.cse27 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse28 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse14 (not (= ~q_free~0 0))) (.cse8 (= 1 ~q_req_up~0)) (.cse16 (not (= 1 ~p_num_write~0))) (.cse10 (= ~p_dw_pc~0 1)) (.cse17 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse0 .cse14 .cse15 .cse3 .cse16 .cse10 .cse4 .cse17 .cse18) (or .cse3 .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse10 .cse4) (or .cse19 .cse6 .cse1 .cse0 .cse2 .cse14 .cse8 .cse3 .cse20 .cse10 .cse4) (or .cse21 .cse1 .cse7 .cse0 .cse9 .cse3 .cse22 .cse10 .cse17 .cse11 .cse23 .cse13) (or .cse21 .cse1 .cse0 .cse14 .cse9 .cse3) (or .cse19 .cse1 .cse0 (and .cse24 .cse25) .cse14 .cse26 .cse20 .cse15 .cse4 .cse18) (or (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse26 .cse4 .cse11 .cse12 .cse13 .cse18) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse25)) (or .cse0 .cse1 .cse15 .cse23 .cse27 .cse18 .cse21 .cse7 .cse22 .cse10 .cse17 .cse11 (and .cse28 .cse25) .cse13) (or .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse3 .cse15 .cse22 .cse10) (or .cse6 .cse1 .cse0 .cse3 .cse14 .cse8 .cse9 .cse15 .cse4) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse3) (or .cse0 .cse1 .cse15 .cse4 .cse27 (and .cse24 .cse28) .cse14 .cse8 .cse16 .cse10 .cse17)))) [2018-12-09 09:33:20,048 INFO L448 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-12-09 09:33:20,048 INFO L448 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-12-09 09:33:20,048 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-12-09 09:33:20,048 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse26 (= 1 ~c_dr_pc~0)) (.cse32 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse18 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse33 (+ ~c_num_read~0 1))) (let ((.cse0 (< ~p_num_write~0 .cse33)) (.cse21 (and .cse18 .cse19 .cse20)) (.cse8 (< .cse33 ~p_num_write~0)) (.cse24 (not (= 0 ~p_num_write~0))) (.cse30 (and .cse32 .cse19)) (.cse27 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse25 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse31 (not (= 1 ~p_num_write~0))) (.cse29 (not (= 0 ~c_num_read~0))) (.cse5 (not (= ~q_free~0 0))) (.cse28 (not (= ~p_dw_st~0 0))) (.cse22 (< 0 |old(~q_req_up~0)|)) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse6 (= 1 |old(~q_req_up~0)|)) (.cse23 (= 0 ~c_dr_st~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse26)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse7 (and .cse32 .cse18 .cse19)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse11 (< ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~q_free~0 1)) (.cse13 (not (= 2 ~c_dr_st~0))) (.cse9 (= ~p_dw_pc~0 1)) (.cse15 (< 1 ~q_free~0)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (or .cse1 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse14 .cse10 .cse15 .cse16 .cse17) (and (and .cse18 .cse19) .cse20)) (or .cse0 .cse2 .cse3 .cse4 .cse8 .cse14 .cse10 .cse21 (= 0 |old(~q_write_ev~0)|) .cse22 .cse5 .cse13) (or .cse7 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse9 .cse10) (or .cse3 .cse2 .cse14 .cse24 .cse25 .cse22 .cse26 .cse12 (and .cse18 .cse27 .cse20) .cse28 .cse9 .cse29 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse21 .cse8 .cse14 .cse10) (or .cse26 .cse2 .cse12 .cse3 .cse23 .cse30 .cse28 .cse9 .cse29 .cse15 .cse24 .cse17) (or .cse26 .cse2 .cse3 .cse5 .cse23 .cse30) (or .cse1 .cse2 .cse3 .cse5 .cse14 .cse7 .cse31 .cse9 .cse10 .cse29 .cse22) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6 .cse23 .cse14 .cse10) (or .cse3 .cse2 .cse14 (and .cse18 .cse19 .cse27) .cse10 .cse25 .cse5 .cse6 .cse31 .cse9 .cse29) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse14 .cse28 .cse9) (or (or .cse1 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse10 .cse15 .cse16 .cse17 .cse22) (and .cse18 (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse20)) (or .cse3 .cse2 .cse4 .cse7 .cse10 .cse11 .cse1 .cse12 .cse6 .cse23 .cse9 .cse15 .cse16 .cse17) (or .cse3 .cse2 .cse4 .cse14 .cse10 .cse11 .cse1 .cse12 .cse6 .cse23 .cse15 .cse16 .cse17 .cse7) (or .cse2 .cse3 .cse4 .cse10 .cse7 .cse1 .cse11 .cse12 .cse13 .cse9 .cse15 .cse16 .cse17)))) [2018-12-09 09:33:20,049 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-12-09 09:33:20,049 INFO L444 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse16 (= 1 ~c_dr_pc~0)) (.cse30 (+ ~c_num_read~0 1)) (.cse28 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse27 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse14 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (not (= 0 ~p_num_write~0))) (.cse26 (and .cse27 .cse29)) (.cse25 (not (= 1 ~p_num_write~0))) (.cse19 (not (= 0 ~c_num_read~0))) (.cse17 (not (= ~p_dw_st~0 0))) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse3 (< ~q_free~0 1)) (.cse22 (= 1 |old(~q_req_up~0)|)) (.cse24 (= 0 ~c_dr_st~0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse9 (< 1 ~q_free~0)) (.cse10 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse12 (and (and .cse28 .cse29) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse20 (< ~p_num_write~0 .cse30)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse5 (not .cse16)) (.cse21 (not (= ~q_free~0 0))) (.cse6 (not (= 2 ~c_dr_st~0))) (.cse23 (< .cse30 ~p_num_write~0)) (.cse7 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (= ~p_dw_st~0 2))) (.cse15 (< 0 |old(~q_req_up~0)|))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse4 .cse2 .cse7 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse18 .cse19 .cse9 .cse11) (or .cse20 .cse0 .cse2 .cse4 .cse5 .cse21 .cse22 .cse23 .cse18 .cse8) (or .cse4 .cse2 .cse5 .cse7 .cse8 .cse1 .cse0 .cse3 .cse22 .cse24 .cse9 .cse10 .cse11) (or .cse4 .cse2 .cse7 .cse8 .cse14 .cse21 .cse22 .cse25 .cse18 .cse19) (or .cse16 .cse2 .cse3 .cse4 .cse24 .cse26 .cse17 .cse18 .cse19 .cse9 .cse13 .cse11) (or .cse16 .cse2 .cse4 .cse21 .cse24 .cse26) (or .cse2 .cse4 .cse5 .cse8 .cse0 .cse1 .cse3 .cse6 (and .cse27 .cse28 .cse29) .cse18 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse4 .cse5 .cse21 .cse22 .cse24 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse15) (or .cse0 .cse2 .cse4 .cse21 .cse7 .cse25 .cse18 .cse8 .cse19 .cse15) (or .cse0 .cse2 .cse4 .cse5 .cse21 .cse22 .cse24 .cse18 .cse8) (or .cse0 .cse2 .cse4 .cse5 .cse21 .cse22 .cse24 .cse7 .cse17 .cse18) (or .cse4 .cse2 .cse5 .cse8 .cse1 .cse0 .cse3 .cse22 .cse24 .cse18 .cse9 .cse10 .cse11) (or .cse20 .cse2 .cse4 .cse5 .cse23 .cse7 .cse8 .cse0 .cse12 .cse21 .cse6) (or .cse20 .cse2 .cse4 .cse5 .cse21 .cse6 .cse23 .cse7 .cse8 (= 0 |old(~q_write_ev~0)|) .cse15)))) [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 09:33:20,050 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_free~0 0) (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2018-12-09 09:33:20,050 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-12-09 09:33:20,050 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-12-09 09:33:20,052 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-12-09 09:33:20,052 INFO L444 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse13 (= 1 ~c_dr_pc~0)) (.cse28 (+ ~c_num_read~0 1)) (.cse27 (= 1 ~p_num_write~0))) (let ((.cse5 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (not .cse27)) (.cse10 (not (= 0 ~c_num_read~0))) (.cse11 (not (= 0 ~p_num_write~0))) (.cse2 (not (= ~q_read_ev~0 2))) (.cse15 (not (= ~p_dw_st~0 0))) (.cse19 (= 0 ~c_dr_st~0)) (.cse23 (< ~p_num_write~0 .cse28)) (.cse6 (not (= ~q_free~0 0))) (.cse7 (= 1 ~q_req_up~0)) (.cse24 (< .cse28 ~p_num_write~0)) (.cse18 (< ~q_write_ev~0 2)) (.cse21 (< ~p_num_write~0 ~c_num_read~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse14 (< ~q_free~0 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse20 (not .cse13)) (.cse25 (not (= 2 ~c_dr_st~0))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse16 (< 1 ~q_free~0)) (.cse22 (< ~c_num_read~0 ~p_num_write~0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (< 0 ~q_req_up~0)) (.cse4 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse26 (= 1 ~p_dw_pc~0)) (.cse9 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse11 .cse5 .cse12 .cse13 .cse14 .cse4 .cse15 .cse9 .cse10 .cse16 .cse17) (or .cse18 .cse1 .cse0 .cse6 .cse7 .cse19 .cse4 .cse2 .cse3) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse21 .cse18 .cse14 .cse7 .cse19 .cse9 .cse16 .cse22 .cse17) (or .cse23 .cse1 .cse0 .cse24 .cse2 .cse3 (= 0 ~q_write_ev~0) .cse12 .cse6 .cse4 .cse25) (or .cse18 .cse1 .cse0 .cse4 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 .cse12) (or .cse13 .cse1 .cse0 .cse6 .cse19 .cse4 (and .cse26 (not (= 0 ~q_read_ev~0)))) (or .cse13 .cse1 .cse14 .cse0 .cse4 .cse19 .cse15 .cse9 .cse10 .cse16 .cse11 .cse17) (or .cse13 .cse1 .cse0 .cse6 .cse19 .cse2 .cse4) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse21 .cse18 .cse14 .cse7 .cse19 .cse4 .cse16 .cse22 .cse17) (or .cse4 .cse18 .cse1 .cse0 .cse6 .cse7 .cse19 .cse2 .cse15 .cse9) (or .cse18 .cse1 .cse0 .cse6 .cse7 .cse4 .cse19 .cse9 .cse3) (or .cse23 .cse18 .cse1 .cse0 .cse4 .cse20 .cse6 .cse7 .cse24 .cse9 .cse3) (or (or .cse18 .cse21 .cse1 .cse14 .cse0 .cse20 .cse25 .cse3 .cse16 .cse22 .cse17 .cse12) (and .cse4 .cse26) (and .cse26 (= ~q_read_ev~0 1)) (and (not .cse9) .cse27))))) [2018-12-09 09:33:20,052 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-12-09 09:33:20,052 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-12-09 09:33:20,052 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-12-09 09:33:20,052 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-12-09 09:33:20,052 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-12-09 09:33:20,052 INFO L444 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse13 (= 1 |old(~c_dr_pc~0)|)) (.cse16 (+ |old(~c_num_read~0)| 1))) (let ((.cse1 (< ~p_num_write~0 .cse16)) (.cse4 (not .cse13)) (.cse7 (< .cse16 ~p_num_write~0)) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse15 (not (= 1 ~p_num_write~0))) (.cse10 (= ~p_dw_pc~0 1)) (.cse9 (not (= ~p_dw_st~0 2))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 (or .cse1 (or .cse2 .cse3 (or .cse4 .cse5)) .cse6 .cse7 .cse8 .cse9)) (or .cse0 (or .cse1 (or .cse2 .cse3 .cse4 .cse10) .cse6 (= 1 |old(~q_req_up~0)|) .cse7 .cse8 .cse9)) (or .cse3 .cse2 .cse5 (not (= 0 ~p_num_write~0)) .cse11 .cse12 .cse13 (< |old(~q_free~0)| 1) .cse8 (not (= ~p_dw_st~0 0)) .cse10 .cse14 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or (or .cse2 .cse3 .cse6 .cse8 .cse5 .cse15 .cse9 .cse14) .cse11) (or .cse0 .cse2 .cse3 .cse6 .cse8 .cse5 .cse15 .cse10 .cse9 .cse14 .cse12)))) [2018-12-09 09:33:20,054 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-12-09 09:33:20,054 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse22 (+ |old(~c_num_read~0)| 1)) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse18 (not (= 0 ~c_dr_st~0))) (.cse20 (= ~c_num_read~0 0)) (.cse24 (= ~q_free~0 0)) (.cse21 (= |old(~q_req_up~0)| ~q_req_up~0))) (let ((.cse10 (and .cse19 .cse18 .cse20 .cse24 .cse21)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse12 (< ~q_write_ev~0 2)) (.cse17 (let ((.cse23 (+ ~c_num_read~0 1))) (and (<= .cse23 ~p_num_write~0) .cse18 (= 1 ~c_dr_pc~0) .cse24 .cse21 (<= ~p_num_write~0 .cse23)))) (.cse14 (< ~p_num_write~0 .cse22)) (.cse15 (not .cse0)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse16 (< .cse22 ~p_num_write~0)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< 0 |old(~q_req_up~0)|)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse13 (= ~p_dw_pc~0 1)) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or .cse1 .cse2 .cse5 .cse7 .cse11 .cse0 .cse12 .cse3 .cse4 .cse10 .cse6 .cse13 .cse8) (or .cse12 (or .cse14 (or .cse1 .cse2 .cse15 .cse13) .cse3 (= 1 |old(~q_req_up~0)|) .cse16 .cse4 .cse7) .cse17) (or .cse12 .cse17 (or .cse14 (or .cse1 .cse2 (or .cse15 .cse5)) .cse3 .cse16 .cse4 .cse7)) (or .cse2 .cse1 .cse5 (not (= 0 ~p_num_write~0)) .cse9 (and .cse18 (<= 1 ~q_free~0) .cse19 .cse20 .cse21 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0)) .cse11 .cse0 (< |old(~q_free~0)| 1) .cse4 (not (= ~p_dw_st~0 0)) .cse13 .cse8 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-09 09:33:20,054 INFO L448 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-12-09 09:33:20,054 INFO L444 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse12 (= 2 ~c_dr_st~0)) (.cse14 (= 1 ~c_dr_pc~0)) (.cse13 (<= 1 ~q_free~0)) (.cse15 (<= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= 1 |old(~c_dr_pc~0)|)) (.cse23 (+ |old(~c_num_read~0)| 1))) (let ((.cse2 (< ~p_num_write~0 .cse23)) (.cse5 (not .cse19)) (.cse8 (< .cse23 ~p_num_write~0)) (.cse1 (and (<= ~p_num_write~0 ~c_num_read~0) .cse12 .cse14 .cse13 (<= ~c_num_read~0 ~p_num_write~0) .cse15 .cse16)) (.cse18 (< 0 |old(~q_req_up~0)|)) (.cse0 (< ~q_write_ev~0 2)) (.cse11 (= ~p_dw_pc~0 1)) (.cse22 (and .cse12 .cse14 (= ~c_num_read~0 1) .cse13 .cse15 .cse16)) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse7 (not (= |old(~q_free~0)| 0))) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse21 (not (= 1 ~p_num_write~0))) (.cse10 (not (= ~p_dw_st~0 2))) (.cse20 (not (= 0 |old(~c_num_read~0)|))) (.cse17 (not (= ~q_read_ev~0 ~q_write_ev~0)))) (and (or .cse0 .cse1 (or .cse2 (or .cse3 .cse4 (or .cse5 .cse6)) .cse7 .cse8 .cse9 .cse10)) (or .cse0 (or .cse2 (or .cse3 .cse4 .cse5 .cse11) .cse7 (= 1 |old(~q_req_up~0)|) .cse8 .cse9 .cse10) .cse1) (or .cse4 .cse3 (and .cse12 .cse13 .cse14 (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) .cse15 .cse16) .cse6 (not (= 0 ~p_num_write~0)) .cse17 .cse18 .cse19 (< |old(~q_free~0)| 1) .cse9 (not (= ~p_dw_st~0 0)) .cse11 .cse20 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse3 .cse4 .cse6 .cse10 .cse18 .cse0 .cse7 .cse9 .cse21 .cse11 .cse20 .cse22) (or .cse22 (or .cse3 .cse4 .cse7 .cse9 .cse6 .cse21 .cse10 .cse20) .cse17)))) [2018-12-09 09:33:20,055 INFO L444 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse13 (= 1 |old(~c_dr_pc~0)|)) (.cse16 (+ |old(~c_num_read~0)| 1))) (let ((.cse1 (< ~p_num_write~0 .cse16)) (.cse4 (not .cse13)) (.cse7 (< .cse16 ~p_num_write~0)) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse15 (not (= 1 ~p_num_write~0))) (.cse10 (= ~p_dw_pc~0 1)) (.cse9 (not (= ~p_dw_st~0 2))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 (or .cse1 (or .cse2 .cse3 (or .cse4 .cse5)) .cse6 .cse7 .cse8 .cse9)) (or .cse0 (or .cse1 (or .cse2 .cse3 .cse4 .cse10) .cse6 (= 1 |old(~q_req_up~0)|) .cse7 .cse8 .cse9)) (or .cse3 .cse2 .cse5 (not (= 0 ~p_num_write~0)) .cse11 .cse12 .cse13 (< |old(~q_free~0)| 1) .cse8 (not (= ~p_dw_st~0 0)) .cse10 .cse14 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or (or .cse2 .cse3 .cse6 .cse8 .cse5 .cse15 .cse9 .cse14) .cse11) (or .cse0 .cse2 .cse3 .cse6 .cse8 .cse5 .cse15 .cse10 .cse9 .cse14 .cse12)))) [2018-12-09 09:33:20,056 INFO L444 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse19 (= ~c_num_read~0 0)) (.cse20 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse17 (not (= 0 ~c_dr_st~0))) (.cse18 (<= 1 ~q_free~0)) (.cse21 (<= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= 1 |old(~c_dr_pc~0)|)) (.cse25 (+ |old(~c_num_read~0)| 1))) (let ((.cse5 (< 0 |old(~q_req_up~0)|)) (.cse7 (< ~q_write_ev~0 2)) (.cse14 (< ~p_num_write~0 .cse25)) (.cse15 (not .cse24)) (.cse11 (= ~p_dw_pc~0 1)) (.cse16 (< .cse25 ~p_num_write~0)) (.cse13 (and (<= ~p_num_write~0 ~c_num_read~0) .cse17 .cse18 (<= ~c_num_read~0 ~p_num_write~0) .cse21 .cse22)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse10 (not (= 1 ~p_num_write~0))) (.cse4 (not (= ~p_dw_st~0 2))) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (and .cse17 (= ~c_num_read~0 1) .cse18 .cse21 .cse22)) (.cse6 (and .cse17 .cse19 (= ~q_free~0 0) .cse20)) (.cse23 (not (= ~q_read_ev~0 ~q_write_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse7 .cse13 (or .cse14 (or .cse0 .cse1 (or .cse15 .cse3)) .cse8 .cse16 .cse9 .cse4)) (or .cse1 .cse0 .cse3 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (not (= 0 ~p_num_write~0)) .cse23 .cse5 .cse24 (< |old(~q_free~0)| 1) .cse9 (not (= ~p_dw_st~0 0)) .cse11 .cse12 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse7 (or .cse14 (or .cse0 .cse1 .cse15 .cse11) .cse8 (= 1 |old(~q_req_up~0)|) .cse16 .cse9 .cse4) .cse13) (or (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse4 .cse12) .cse2 .cse6 .cse23)))) [2018-12-09 09:33:20,057 INFO L444 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse17 (+ |old(~c_num_read~0)| 1))) (let ((.cse15 (let ((.cse18 (+ ~c_num_read~0 1))) (and (<= .cse18 ~p_num_write~0) (not (= 0 ~c_dr_st~0)) (= 1 ~c_dr_pc~0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~p_num_write~0 .cse18)))) (.cse10 (< ~p_num_write~0 .cse17)) (.cse11 (not .cse5)) (.cse13 (< .cse17 ~p_num_write~0)) (.cse9 (< ~q_write_ev~0 2)) (.cse7 (= ~p_dw_pc~0 1)) (.cse4 (< 0 |old(~q_req_up~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse12 (not (= |old(~q_free~0)| 0))) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse16 (not (= 1 ~p_num_write~0))) (.cse14 (not (= ~p_dw_st~0 2))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0)))) (and (or .cse0 .cse1 .cse2 (not (= 0 ~p_num_write~0)) .cse3 .cse4 .cse5 (< |old(~q_free~0)| 1) .cse6 (not (= ~p_dw_st~0 0)) .cse7 .cse8 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse9 (or .cse10 (or .cse1 .cse0 .cse11 .cse7) .cse12 (= 1 |old(~q_req_up~0)|) .cse13 .cse6 .cse14) .cse15) (or .cse9 .cse15 (or .cse10 (or .cse1 .cse0 (or .cse11 .cse2)) .cse12 .cse13 .cse6 .cse14)) (or .cse5 .cse9 .cse1 .cse0 .cse12 .cse6 .cse2 .cse16 .cse7 .cse14 .cse8 .cse4) (or (or .cse5 .cse1 .cse0 .cse12 .cse6 .cse2 .cse16 .cse14 .cse8) .cse3)))) [2018-12-09 09:33:20,057 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-12-09 09:33:20,057 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-12-09 09:33:20,057 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (< 0 ~q_req_up~0)) [2018-12-09 09:33:20,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:33:20 BoogieIcfgContainer [2018-12-09 09:33:20,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:33:20,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:33:20,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:33:20,098 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:33:20,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:42" (3/4) ... [2018-12-09 09:33:20,101 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-12-09 09:33:20,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-09 09:33:20,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-09 09:33:20,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-09 09:33:20,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-12-09 09:33:20,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-12-09 09:33:20,107 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-09 09:33:20,111 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-09 09:33:20,111 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 09:33:20,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(p_dw_i == 1) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && 2 == p_dw_st) && !(0 == c_dr_st)) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && !(q_req_up == 1)) && p_last_write == q_buf_0)) || ((((((((p_last_write == q_buf_0 && 2 == q_read_ev) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(p_dw_pc == 1)) && 1 == p_num_write) && !(q_req_up == 1)) && q_read_ev == q_write_ev)) || ((((((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 == p_dw_st) && 2 <= q_write_ev) && !(q_req_up == 1))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && 0 == p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (((((((!(0 == c_dr_st) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && !(p_dw_pc == 1)) && !(q_req_up == 1))) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write)) || \old(q_free) < 1) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && q_free == 0) && !(p_dw_pc == 1)) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev)) || ((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= q_write_ev) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 == p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && p_num_write <= c_num_read + 1) && !(q_req_up == 1)) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0) [2018-12-09 09:33:20,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((((((((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write) || !(p_dw_i == 1)) || ((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((((((tmp___1 == 1 && 2 == c_dr_st) && 1 <= q_free) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || (((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) || (((((((((c_num_read + 1 <= p_num_write && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) || (((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1)) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) [2018-12-09 09:33:20,129 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((c_num_read + 1 <= p_num_write && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1))) && ((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && ((((((((((((((((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) [2018-12-09 09:33:20,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && 1 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == \old(p_num_write))) && (((((((((((((1 == p_num_write || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || c_last_read == p_last_write) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && p_last_write == q_buf_0)) || (((((q_free == 0 && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((q_write_ev < 2 || ((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && ((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && q_free <= 1) && p_last_write == q_buf_0) && 1 <= q_free)) || (((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((((((\old(p_dw_st) == 0 || (((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && ((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || (((((((1 <= q_free && !(0 == p_dw_st)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write)) [2018-12-09 09:33:20,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) || ((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0)) && ((((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((p_num_write == \old(p_num_write) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((p_last_write == q_buf_0 && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((q_write_ev < 2 || ((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || !(1 == \old(p_dw_pc)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0)) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) [2018-12-09 09:33:20,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || (((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((q_free == 0 && 1 == \old(p_dw_pc)) && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write)))) && ((q_write_ev < 2 || ((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && (p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write)) [2018-12-09 09:33:20,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && ((q_write_ev < 2 || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || (((((!(0 == c_dr_st) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == q_write_ev)) [2018-12-09 09:33:20,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((q_write_ev < 2 || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || ((((((2 == c_dr_st && 1 <= q_free) && 1 == c_dr_pc) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || ((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(q_read_ev == q_write_ev)) [2018-12-09 09:33:20,130 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && ((q_write_ev < 2 || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((((1 == \old(c_dr_pc) || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || 0 < \old(q_req_up))) && (((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(q_read_ev == q_write_ev)) [2018-12-09 09:33:20,151 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_78cc124c-95f7-461d-a345-3a94f1de2360/bin-2019/uautomizer/witness.graphml [2018-12-09 09:33:20,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:33:20,152 INFO L168 Benchmark]: Toolchain (without parser) took 97662.86 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 954.4 MB in the beginning and 1.9 GB in the end (delta: -971.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 09:33:20,152 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:33:20,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 939.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:33:20,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 939.9 MB in the beginning and 1.2 GB in the end (delta: -230.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:33:20,153 INFO L168 Benchmark]: Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:33:20,153 INFO L168 Benchmark]: RCFGBuilder took 257.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:33:20,153 INFO L168 Benchmark]: TraceAbstraction took 97117.92 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -791.3 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-09 09:33:20,153 INFO L168 Benchmark]: Witness Printer took 53.27 ms. Allocated memory is still 3.7 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:33:20,154 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 939.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 939.9 MB in the beginning and 1.2 GB in the end (delta: -230.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97117.92 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -791.3 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 53.27 ms. Allocated memory is still 3.7 GB. Free memory is still 1.9 GB. There was no memory consumed. 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && ((q_write_ev < 2 || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((((1 == \old(c_dr_pc) || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || 0 < \old(q_req_up))) && (((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(q_read_ev == q_write_ev)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) || ((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0)) && ((((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((p_num_write == \old(p_num_write) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((p_last_write == q_buf_0 && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((q_write_ev < 2 || ((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || !(1 == \old(p_dw_pc)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0)) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((((((((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write) || !(p_dw_i == 1)) || ((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((((((tmp___1 == 1 && 2 == c_dr_st) && 1 <= q_free) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || (((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) || (((((((((c_num_read + 1 <= p_num_write && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) || (((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1)) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 == __retres1) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || 0 == __retres1) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(p_dw_st == 2)) || 0 == __retres1) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && ((((((((((p_num_write < c_num_read + 1 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || c_num_read + 1 < p_num_write) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 == q_write_ev) || 0 < q_req_up) || !(q_free == 0)) || 0 == __retres1) || !(2 == c_dr_st))) && ((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(q_free == 0)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || 0 < q_req_up)) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || 0 == __retres1) || (1 == p_dw_pc && !(0 == q_read_ev)))) && (((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || !(q_read_ev == 2)) || 0 == __retres1)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || 0 == __retres1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((((((0 == __retres1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || p_dw_pc == 1)) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2))) && ((((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || p_dw_pc == 1) || !(p_dw_st == 2))) && ((((((((((((((q_write_ev < 2 || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(p_dw_st == 2)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || 0 < q_req_up) || (0 == __retres1 && 1 == p_dw_pc)) || (1 == p_dw_pc && q_read_ev == 1)) || (!(p_dw_pc == 1) && 1 == p_num_write)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((q_write_ev < 2 || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || ((((((2 == c_dr_st && 1 <= q_free) && 1 == c_dr_pc) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || ((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(q_read_ev == q_write_ev)) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(p_dw_i == 1) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && 2 == p_dw_st) && !(0 == c_dr_st)) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && !(q_req_up == 1)) && p_last_write == q_buf_0)) || ((((((((p_last_write == q_buf_0 && 2 == q_read_ev) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(p_dw_pc == 1)) && 1 == p_num_write) && !(q_req_up == 1)) && q_read_ev == q_write_ev)) || ((((((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 == p_dw_st) && 2 <= q_write_ev) && !(q_req_up == 1))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && 0 == p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (((((((!(0 == c_dr_st) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && !(p_dw_pc == 1)) && !(q_req_up == 1))) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write)) || \old(q_free) < 1) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && q_free == 0) && !(p_dw_pc == 1)) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev)) || ((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= q_write_ev) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 == p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && p_num_write <= c_num_read + 1) && !(q_req_up == 1)) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || (((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((q_free == 0 && 1 == \old(p_dw_pc)) && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write)))) && ((q_write_ev < 2 || ((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && (p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((c_num_read + 1 <= p_num_write && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1))) && ((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && ((((((((((((((((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && 1 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == \old(p_num_write))) && (((((((((((((1 == p_num_write || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || c_last_read == p_last_write) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && p_last_write == q_buf_0)) || (((((q_free == 0 && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((q_write_ev < 2 || ((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && ((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && q_free <= 1) && p_last_write == q_buf_0) && 1 <= q_free)) || (((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((((((\old(p_dw_st) == 0 || (((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && ((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || (((((((1 <= q_free && !(0 == p_dw_st)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(0 == c_dr_st)) || __retres1 == 1) || 1 == c_dr_pc) || !(q_free == 0)) || !(1 == p_num_write)) || !(0 == c_num_read)) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0))) && (((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 1 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || 1 == __retres1) || p_dw_pc == 1)) && (1 == __retres1 || (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || 1 == q_req_up) || !(p_dw_st == 0)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || !(p_dw_st == 0)) || 1 == __retres1) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && ((!(0 == c_dr_st) || ((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || __retres1 == 1) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && ((q_write_ev < 2 || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || (((((!(0 == c_dr_st) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == q_write_ev)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_num_write < c_num_read + 1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || c_num_read + 1 < p_num_write) || !(p_dw_st == 2)) || 0 == q_write_ev) || 0 < q_req_up) || 1 == q_write_ev) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) && (((((((((((!(q_buf_0 == p_last_write) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 0 == __retres1) || 1 < q_free) || !(0 == p_num_write)) || 1 == c_dr_pc) || !(c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || p_dw_pc == 1) || 0 == __retres1)) && (((((((((((((0 == __retres1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(p_dw_st == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || !(1 == c_dr_pc)) || p_dw_pc == 1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && ((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || !(q_read_ev == 2)) || 0 < q_req_up)) && (((q_write_ev < 2 || ((((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || !(2 == c_dr_st)) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || !(p_dw_st == 2)) || 0 < q_req_up) || 0 == __retres1)) && ((!(q_read_ev == 1) || 0 == __retres1) || (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == p_dw_pc)) || 0 < q_req_up) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2)) || 0 == __retres1)) && ((((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || 0 == __retres1) || !(1 == c_dr_pc)) || p_dw_pc == 1) || !(p_dw_st == 2))) && ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(p_dw_st == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == __retres1) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == c_dr_st) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((0 == __retres1 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || 1 == c_dr_pc)) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) || !(p_dw_st == 2))) && ((0 == __retres1 || (q_write_ev < 2 || 1 == q_req_up) || ((((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || !(p_dw_st == 2)) || !(q_read_ev == 1))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 130 locations, 1 error locations. SAFE Result, 97.0s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 75.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4006 SDtfs, 8059 SDslu, 5499 SDs, 0 SdLazy, 8832 SolverSat, 2881 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1709 GetRequests, 1525 SyntacticMatches, 14 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25958occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 11047 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 48532 PreInvPairs, 56042 NumberOfFragments, 24590 HoareAnnotationTreeSize, 48532 FomulaSimplifications, 372171 FormulaSimplificationTreeSizeReduction, 7.7s HoareSimplificationTime, 56 FomulaSimplificationsInter, 418465 FormulaSimplificationTreeSizeReductionInter, 67.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 3924 NumberOfCodeBlocks, 3924 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3897 ConstructedInterpolants, 0 QuantifiedInterpolants, 1042189 SizeOfPredicates, 13 NumberOfNonLiveVariables, 6930 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 2345/2425 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...