./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-1dbac8b [2018-11-10 12:15:51,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:15:51,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:15:51,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:15:51,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:15:51,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:15:51,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:15:51,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:15:51,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:15:51,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:15:51,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:15:51,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:15:51,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:15:51,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:15:51,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:15:51,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:15:51,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:15:51,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:15:51,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:15:51,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:15:51,097 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:15:51,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:15:51,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:15:51,099 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:15:51,099 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:15:51,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:15:51,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:15:51,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:15:51,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:15:51,102 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:15:51,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:15:51,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:15:51,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:15:51,103 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:15:51,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:15:51,104 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:15:51,104 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:15:51,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:15:51,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:15:51,111 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:15:51,112 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:15:51,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:15:51,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:15:51,112 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:15:51,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:15:51,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:15:51,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:15:51,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:15:51,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:15:51,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:15:51,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:15:51,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:15:51,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:15:51,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:15:51,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:15:51,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:15:51,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:15:51,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:15:51,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:15:51,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:15:51,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:15:51,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:15:51,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:15:51,115 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:15:51,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:15:51,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:15:51,115 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_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:15:51,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:15:51,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:15:51,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:15:51,152 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:15:51,152 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:15:51,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-10 12:15:51,197 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/data/8c1a24bdd/f8c686f8de4b4c86b85f09549bd5e125/FLAG2346db8b0 [2018-11-10 12:15:51,539 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:15:51,540 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-10 12:15:51,547 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/data/8c1a24bdd/f8c686f8de4b4c86b85f09549bd5e125/FLAG2346db8b0 [2018-11-10 12:15:51,557 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/data/8c1a24bdd/f8c686f8de4b4c86b85f09549bd5e125 [2018-11-10 12:15:51,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:15:51,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:15:51,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:15:51,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:15:51,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:15:51,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51, skipping insertion in model container [2018-11-10 12:15:51,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:15:51,594 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:15:51,714 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:15:51,717 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:15:51,740 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:15:51,749 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:15:51,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51 WrapperNode [2018-11-10 12:15:51,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:15:51,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:15:51,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:15:51,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:15:51,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... [2018-11-10 12:15:51,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:15:51,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:15:51,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:15:51,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:15:51,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:15:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:15:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:15:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 12:15:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 12:15:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 12:15:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-10 12:15:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 12:15:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 12:15:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:15:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:15:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:15:52,165 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:15:52,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:15:52 BoogieIcfgContainer [2018-11-10 12:15:52,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:15:52,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:15:52,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:15:52,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:15:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:15:51" (1/3) ... [2018-11-10 12:15:52,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68811183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:15:52, skipping insertion in model container [2018-11-10 12:15:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:15:51" (2/3) ... [2018-11-10 12:15:52,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68811183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:15:52, skipping insertion in model container [2018-11-10 12:15:52,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:15:52" (3/3) ... [2018-11-10 12:15:52,173 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-10 12:15:52,180 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:15:52,187 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:15:52,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:15:52,221 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:15:52,222 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:15:52,222 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:15:52,222 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:15:52,222 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:15:52,223 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:15:52,223 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:15:52,223 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:15:52,223 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:15:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-10 12:15:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 12:15:52,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:52,243 INFO L375 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] [2018-11-10 12:15:52,244 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:52,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash 414554663, now seen corresponding path program 1 times [2018-11-10 12:15:52,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:52,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:52,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:52,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:52,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:15:52,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:15:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:15:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:15:52,461 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 5 states. [2018-11-10 12:15:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:52,936 INFO L93 Difference]: Finished difference Result 392 states and 558 transitions. [2018-11-10 12:15:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:15:52,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 12:15:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:52,948 INFO L225 Difference]: With dead ends: 392 [2018-11-10 12:15:52,948 INFO L226 Difference]: Without dead ends: 261 [2018-11-10 12:15:52,951 INFO L605 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-11-10 12:15:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-10 12:15:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 241. [2018-11-10 12:15:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 12:15:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 313 transitions. [2018-11-10 12:15:53,003 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 313 transitions. Word has length 80 [2018-11-10 12:15:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:53,004 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 313 transitions. [2018-11-10 12:15:53,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:15:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 313 transitions. [2018-11-10 12:15:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 12:15:53,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:53,007 INFO L375 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] [2018-11-10 12:15:53,007 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:53,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:53,007 INFO L82 PathProgramCache]: Analyzing trace with hash -180453434, now seen corresponding path program 1 times [2018-11-10 12:15:53,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:53,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:53,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:53,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:53,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:15:53,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:15:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:15:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:15:53,103 INFO L87 Difference]: Start difference. First operand 241 states and 313 transitions. Second operand 6 states. [2018-11-10 12:15:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:53,608 INFO L93 Difference]: Finished difference Result 650 states and 865 transitions. [2018-11-10 12:15:53,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:15:53,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-10 12:15:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:53,613 INFO L225 Difference]: With dead ends: 650 [2018-11-10 12:15:53,613 INFO L226 Difference]: Without dead ends: 436 [2018-11-10 12:15:53,615 INFO L605 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-11-10 12:15:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-10 12:15:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 371. [2018-11-10 12:15:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-10 12:15:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 487 transitions. [2018-11-10 12:15:53,654 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 487 transitions. Word has length 80 [2018-11-10 12:15:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:53,654 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 487 transitions. [2018-11-10 12:15:53,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:15:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 487 transitions. [2018-11-10 12:15:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 12:15:53,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:53,657 INFO L375 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] [2018-11-10 12:15:53,657 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:53,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1080463816, now seen corresponding path program 1 times [2018-11-10 12:15:53,658 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:53,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:53,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:53,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:53,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:53,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:15:53,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:15:53,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:15:53,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:15:53,718 INFO L87 Difference]: Start difference. First operand 371 states and 487 transitions. Second operand 6 states. [2018-11-10 12:15:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:53,756 INFO L93 Difference]: Finished difference Result 709 states and 932 transitions. [2018-11-10 12:15:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:15:53,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-10 12:15:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:53,759 INFO L225 Difference]: With dead ends: 709 [2018-11-10 12:15:53,759 INFO L226 Difference]: Without dead ends: 381 [2018-11-10 12:15:53,760 INFO L605 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-11-10 12:15:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-10 12:15:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 376. [2018-11-10 12:15:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-10 12:15:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 490 transitions. [2018-11-10 12:15:53,786 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 490 transitions. Word has length 80 [2018-11-10 12:15:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:53,786 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 490 transitions. [2018-11-10 12:15:53,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:15:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 490 transitions. [2018-11-10 12:15:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 12:15:53,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:53,788 INFO L375 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] [2018-11-10 12:15:53,789 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:53,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash -968924026, now seen corresponding path program 1 times [2018-11-10 12:15:53,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:53,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:53,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:53,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:53,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:53,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:53,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:15:53,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:15:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:15:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:15:53,847 INFO L87 Difference]: Start difference. First operand 376 states and 490 transitions. Second operand 4 states. [2018-11-10 12:15:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:53,974 INFO L93 Difference]: Finished difference Result 1027 states and 1355 transitions. [2018-11-10 12:15:53,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:15:53,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-10 12:15:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:53,977 INFO L225 Difference]: With dead ends: 1027 [2018-11-10 12:15:53,977 INFO L226 Difference]: Without dead ends: 694 [2018-11-10 12:15:53,978 INFO L605 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-11-10 12:15:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-11-10 12:15:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2018-11-10 12:15:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-11-10 12:15:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 855 transitions. [2018-11-10 12:15:54,012 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 855 transitions. Word has length 80 [2018-11-10 12:15:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:54,012 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 855 transitions. [2018-11-10 12:15:54,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:15:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 855 transitions. [2018-11-10 12:15:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 12:15:54,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:54,014 INFO L375 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] [2018-11-10 12:15:54,014 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:54,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash -462014161, now seen corresponding path program 1 times [2018-11-10 12:15:54,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:54,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:54,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:15:54,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:15:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:15:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:15:54,074 INFO L87 Difference]: Start difference. First operand 672 states and 855 transitions. Second operand 6 states. [2018-11-10 12:15:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:54,114 INFO L93 Difference]: Finished difference Result 1322 states and 1681 transitions. [2018-11-10 12:15:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:15:54,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-10 12:15:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:54,117 INFO L225 Difference]: With dead ends: 1322 [2018-11-10 12:15:54,117 INFO L226 Difference]: Without dead ends: 693 [2018-11-10 12:15:54,118 INFO L605 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-11-10 12:15:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-11-10 12:15:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2018-11-10 12:15:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-10 12:15:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 867 transitions. [2018-11-10 12:15:54,140 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 867 transitions. Word has length 81 [2018-11-10 12:15:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:54,140 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 867 transitions. [2018-11-10 12:15:54,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:15:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 867 transitions. [2018-11-10 12:15:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 12:15:54,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:54,142 INFO L375 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] [2018-11-10 12:15:54,142 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:54,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:54,142 INFO L82 PathProgramCache]: Analyzing trace with hash -856380947, now seen corresponding path program 1 times [2018-11-10 12:15:54,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:54,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:54,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:54,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:15:54,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:15:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:15:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:15:54,202 INFO L87 Difference]: Start difference. First operand 687 states and 867 transitions. Second operand 6 states. [2018-11-10 12:15:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:54,640 INFO L93 Difference]: Finished difference Result 1400 states and 1755 transitions. [2018-11-10 12:15:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:15:54,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-10 12:15:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:54,644 INFO L225 Difference]: With dead ends: 1400 [2018-11-10 12:15:54,644 INFO L226 Difference]: Without dead ends: 854 [2018-11-10 12:15:54,645 INFO L605 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-11-10 12:15:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-10 12:15:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 703. [2018-11-10 12:15:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-10 12:15:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 876 transitions. [2018-11-10 12:15:54,672 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 876 transitions. Word has length 81 [2018-11-10 12:15:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:54,673 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 876 transitions. [2018-11-10 12:15:54,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:15:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 876 transitions. [2018-11-10 12:15:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 12:15:54,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:54,674 INFO L375 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] [2018-11-10 12:15:54,675 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:54,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash -154781073, now seen corresponding path program 1 times [2018-11-10 12:15:54,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:54,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:54,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:54,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:54,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:54,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:15:54,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:15:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:15:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:15:54,714 INFO L87 Difference]: Start difference. First operand 703 states and 876 transitions. Second operand 3 states. [2018-11-10 12:15:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:54,764 INFO L93 Difference]: Finished difference Result 1944 states and 2474 transitions. [2018-11-10 12:15:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:15:54,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-10 12:15:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:54,768 INFO L225 Difference]: With dead ends: 1944 [2018-11-10 12:15:54,768 INFO L226 Difference]: Without dead ends: 1312 [2018-11-10 12:15:54,769 INFO L605 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-11-10 12:15:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-11-10 12:15:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1308. [2018-11-10 12:15:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2018-11-10 12:15:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1642 transitions. [2018-11-10 12:15:54,810 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1642 transitions. Word has length 81 [2018-11-10 12:15:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:54,810 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1642 transitions. [2018-11-10 12:15:54,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:15:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1642 transitions. [2018-11-10 12:15:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 12:15:54,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:54,812 INFO L375 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] [2018-11-10 12:15:54,812 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:54,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash -360471793, now seen corresponding path program 1 times [2018-11-10 12:15:54,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:54,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:54,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:54,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:54,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:15:54,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:15:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:15:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:15:54,890 INFO L87 Difference]: Start difference. First operand 1308 states and 1642 transitions. Second operand 5 states. [2018-11-10 12:15:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:54,997 INFO L93 Difference]: Finished difference Result 3672 states and 4841 transitions. [2018-11-10 12:15:54,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:15:54,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-10 12:15:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:55,006 INFO L225 Difference]: With dead ends: 3672 [2018-11-10 12:15:55,006 INFO L226 Difference]: Without dead ends: 2381 [2018-11-10 12:15:55,009 INFO L605 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-11-10 12:15:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2018-11-10 12:15:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2288. [2018-11-10 12:15:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2288 states. [2018-11-10 12:15:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 2911 transitions. [2018-11-10 12:15:55,114 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 2911 transitions. Word has length 82 [2018-11-10 12:15:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:55,115 INFO L481 AbstractCegarLoop]: Abstraction has 2288 states and 2911 transitions. [2018-11-10 12:15:55,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:15:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2911 transitions. [2018-11-10 12:15:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 12:15:55,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:55,117 INFO L375 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, 1, 1, 1, 1] [2018-11-10 12:15:55,117 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:55,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1844117390, now seen corresponding path program 1 times [2018-11-10 12:15:55,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:55,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:55,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:55,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:55,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:55,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:55,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:15:55,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:15:55,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:15:55,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:15:55,161 INFO L87 Difference]: Start difference. First operand 2288 states and 2911 transitions. Second operand 5 states. [2018-11-10 12:15:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:55,612 INFO L93 Difference]: Finished difference Result 7220 states and 10005 transitions. [2018-11-10 12:15:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:15:55,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-10 12:15:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:55,627 INFO L225 Difference]: With dead ends: 7220 [2018-11-10 12:15:55,627 INFO L226 Difference]: Without dead ends: 5022 [2018-11-10 12:15:55,634 INFO L605 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-11-10 12:15:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2018-11-10 12:15:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4867. [2018-11-10 12:15:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2018-11-10 12:15:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6457 transitions. [2018-11-10 12:15:55,836 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 6457 transitions. Word has length 91 [2018-11-10 12:15:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:55,837 INFO L481 AbstractCegarLoop]: Abstraction has 4867 states and 6457 transitions. [2018-11-10 12:15:55,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:15:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 6457 transitions. [2018-11-10 12:15:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 12:15:55,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:55,839 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:15:55,839 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:55,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:55,839 INFO L82 PathProgramCache]: Analyzing trace with hash 49970305, now seen corresponding path program 1 times [2018-11-10 12:15:55,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:55,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:55,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:55,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:55,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:55,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:55,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:15:55,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:15:55,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:15:55,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:15:55,880 INFO L87 Difference]: Start difference. First operand 4867 states and 6457 transitions. Second operand 4 states. [2018-11-10 12:15:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:56,148 INFO L93 Difference]: Finished difference Result 6552 states and 8716 transitions. [2018-11-10 12:15:56,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:15:56,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 12:15:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:56,166 INFO L225 Difference]: With dead ends: 6552 [2018-11-10 12:15:56,166 INFO L226 Difference]: Without dead ends: 6549 [2018-11-10 12:15:56,169 INFO L605 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-11-10 12:15:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2018-11-10 12:15:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 6375. [2018-11-10 12:15:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6375 states. [2018-11-10 12:15:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 8467 transitions. [2018-11-10 12:15:56,421 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 8467 transitions. Word has length 93 [2018-11-10 12:15:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:56,422 INFO L481 AbstractCegarLoop]: Abstraction has 6375 states and 8467 transitions. [2018-11-10 12:15:56,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:15:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 8467 transitions. [2018-11-10 12:15:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:15:56,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:56,424 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:15:56,424 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:56,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:56,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1548759428, now seen corresponding path program 1 times [2018-11-10 12:15:56,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:56,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:56,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:56,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:56,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:56,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:15:56,556 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:15:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:56,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:15:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:56,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:15:56,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-10 12:15:56,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:15:56,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:15:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:15:56,747 INFO L87 Difference]: Start difference. First operand 6375 states and 8467 transitions. Second operand 11 states. [2018-11-10 12:15:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:15:58,678 INFO L93 Difference]: Finished difference Result 17002 states and 25314 transitions. [2018-11-10 12:15:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 12:15:58,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-10 12:15:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:15:58,748 INFO L225 Difference]: With dead ends: 17002 [2018-11-10 12:15:58,748 INFO L226 Difference]: Without dead ends: 16999 [2018-11-10 12:15:58,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 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-11-10 12:15:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16999 states. [2018-11-10 12:15:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16999 to 16401. [2018-11-10 12:15:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16401 states. [2018-11-10 12:15:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16401 states to 16401 states and 24146 transitions. [2018-11-10 12:15:59,538 INFO L78 Accepts]: Start accepts. Automaton has 16401 states and 24146 transitions. Word has length 94 [2018-11-10 12:15:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:15:59,539 INFO L481 AbstractCegarLoop]: Abstraction has 16401 states and 24146 transitions. [2018-11-10 12:15:59,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:15:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16401 states and 24146 transitions. [2018-11-10 12:15:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 12:15:59,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:15:59,541 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2018-11-10 12:15:59,541 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:15:59,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:15:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1694713556, now seen corresponding path program 2 times [2018-11-10 12:15:59,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:15:59,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:15:59,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:59,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:15:59,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:15:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:15:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:15:59,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:15:59,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:15:59,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:15:59,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:15:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:15:59,574 INFO L87 Difference]: Start difference. First operand 16401 states and 24146 transitions. Second operand 3 states. [2018-11-10 12:16:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:00,349 INFO L93 Difference]: Finished difference Result 26488 states and 40719 transitions. [2018-11-10 12:16:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:16:00,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-11-10 12:16:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:00,389 INFO L225 Difference]: With dead ends: 26488 [2018-11-10 12:16:00,390 INFO L226 Difference]: Without dead ends: 11381 [2018-11-10 12:16:00,462 INFO L605 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-11-10 12:16:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2018-11-10 12:16:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 11113. [2018-11-10 12:16:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11113 states. [2018-11-10 12:16:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 15571 transitions. [2018-11-10 12:16:01,105 INFO L78 Accepts]: Start accepts. Automaton has 11113 states and 15571 transitions. Word has length 98 [2018-11-10 12:16:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:01,105 INFO L481 AbstractCegarLoop]: Abstraction has 11113 states and 15571 transitions. [2018-11-10 12:16:01,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:16:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11113 states and 15571 transitions. [2018-11-10 12:16:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 12:16:01,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:01,108 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:16:01,108 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:01,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 153623661, now seen corresponding path program 1 times [2018-11-10 12:16:01,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:01,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:01,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:16:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 12:16:01,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:16:01,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:16:01,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:16:01,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:16:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:16:01,182 INFO L87 Difference]: Start difference. First operand 11113 states and 15571 transitions. Second operand 7 states. [2018-11-10 12:16:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:03,886 INFO L93 Difference]: Finished difference Result 39125 states and 62430 transitions. [2018-11-10 12:16:03,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 12:16:03,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-10 12:16:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:03,969 INFO L225 Difference]: With dead ends: 39125 [2018-11-10 12:16:03,969 INFO L226 Difference]: Without dead ends: 21578 [2018-11-10 12:16:04,042 INFO L605 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-11-10 12:16:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21578 states. [2018-11-10 12:16:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21578 to 20074. [2018-11-10 12:16:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20074 states. [2018-11-10 12:16:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20074 states to 20074 states and 27076 transitions. [2018-11-10 12:16:05,158 INFO L78 Accepts]: Start accepts. Automaton has 20074 states and 27076 transitions. Word has length 104 [2018-11-10 12:16:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:05,159 INFO L481 AbstractCegarLoop]: Abstraction has 20074 states and 27076 transitions. [2018-11-10 12:16:05,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:16:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 20074 states and 27076 transitions. [2018-11-10 12:16:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 12:16:05,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:05,163 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-10 12:16:05,164 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:05,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:05,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1607467797, now seen corresponding path program 1 times [2018-11-10 12:16:05,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:05,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:05,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:05,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:05,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 12:16:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:16:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:16:05,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:16:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:16:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:16:05,216 INFO L87 Difference]: Start difference. First operand 20074 states and 27076 transitions. Second operand 4 states. [2018-11-10 12:16:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:06,001 INFO L93 Difference]: Finished difference Result 39219 states and 52933 transitions. [2018-11-10 12:16:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:16:06,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-11-10 12:16:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:06,071 INFO L225 Difference]: With dead ends: 39219 [2018-11-10 12:16:06,071 INFO L226 Difference]: Without dead ends: 19202 [2018-11-10 12:16:06,111 INFO L605 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-11-10 12:16:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19202 states. [2018-11-10 12:16:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19202 to 19202. [2018-11-10 12:16:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19202 states. [2018-11-10 12:16:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19202 states to 19202 states and 25921 transitions. [2018-11-10 12:16:06,927 INFO L78 Accepts]: Start accepts. Automaton has 19202 states and 25921 transitions. Word has length 117 [2018-11-10 12:16:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:06,927 INFO L481 AbstractCegarLoop]: Abstraction has 19202 states and 25921 transitions. [2018-11-10 12:16:06,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:16:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19202 states and 25921 transitions. [2018-11-10 12:16:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 12:16:06,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:06,931 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-10 12:16:06,931 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:06,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -290028969, now seen corresponding path program 1 times [2018-11-10 12:16:06,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:06,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:06,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 12:16:07,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:16:07,020 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:16:07,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:07,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:16:07,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:16:07,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-10 12:16:07,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:16:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:16:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:16:07,146 INFO L87 Difference]: Start difference. First operand 19202 states and 25921 transitions. Second operand 9 states. [2018-11-10 12:16:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:08,603 INFO L93 Difference]: Finished difference Result 33794 states and 46412 transitions. [2018-11-10 12:16:08,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 12:16:08,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2018-11-10 12:16:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:08,651 INFO L225 Difference]: With dead ends: 33794 [2018-11-10 12:16:08,651 INFO L226 Difference]: Without dead ends: 15604 [2018-11-10 12:16:08,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 132 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-11-10 12:16:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15604 states. [2018-11-10 12:16:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15604 to 14832. [2018-11-10 12:16:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14832 states. [2018-11-10 12:16:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 17612 transitions. [2018-11-10 12:16:09,381 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 17612 transitions. Word has length 117 [2018-11-10 12:16:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:09,382 INFO L481 AbstractCegarLoop]: Abstraction has 14832 states and 17612 transitions. [2018-11-10 12:16:09,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:16:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 17612 transitions. [2018-11-10 12:16:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 12:16:09,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:09,385 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-11-10 12:16:09,385 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:09,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:09,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1020421402, now seen corresponding path program 1 times [2018-11-10 12:16:09,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:09,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:09,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:09,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:09,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 12:16:09,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:16:09,452 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:16:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:09,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 12:16:09,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:16:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-10 12:16:09,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:16:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:16:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:16:09,617 INFO L87 Difference]: Start difference. First operand 14832 states and 17612 transitions. Second operand 8 states. [2018-11-10 12:16:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:10,478 INFO L93 Difference]: Finished difference Result 32836 states and 39584 transitions. [2018-11-10 12:16:10,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:16:10,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2018-11-10 12:16:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:10,528 INFO L225 Difference]: With dead ends: 32836 [2018-11-10 12:16:10,528 INFO L226 Difference]: Without dead ends: 18422 [2018-11-10 12:16:10,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 182 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-11-10 12:16:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18422 states. [2018-11-10 12:16:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18422 to 18203. [2018-11-10 12:16:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18203 states. [2018-11-10 12:16:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18203 states to 18203 states and 21726 transitions. [2018-11-10 12:16:11,249 INFO L78 Accepts]: Start accepts. Automaton has 18203 states and 21726 transitions. Word has length 180 [2018-11-10 12:16:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:11,250 INFO L481 AbstractCegarLoop]: Abstraction has 18203 states and 21726 transitions. [2018-11-10 12:16:11,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:16:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18203 states and 21726 transitions. [2018-11-10 12:16:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 12:16:11,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:11,252 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 12:16:11,252 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:11,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1395755092, now seen corresponding path program 1 times [2018-11-10 12:16:11,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:11,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 12:16:11,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:16:11,370 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:16:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:11,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 12:16:11,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:16:11,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-10 12:16:11,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:16:11,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:16:11,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:16:11,566 INFO L87 Difference]: Start difference. First operand 18203 states and 21726 transitions. Second operand 11 states. [2018-11-10 12:16:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:13,334 INFO L93 Difference]: Finished difference Result 54693 states and 66960 transitions. [2018-11-10 12:16:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 12:16:13,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-11-10 12:16:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:13,403 INFO L225 Difference]: With dead ends: 54693 [2018-11-10 12:16:13,403 INFO L226 Difference]: Without dead ends: 31482 [2018-11-10 12:16:13,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 212 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-11-10 12:16:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31482 states. [2018-11-10 12:16:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31482 to 26785. [2018-11-10 12:16:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26785 states. [2018-11-10 12:16:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26785 states to 26785 states and 31218 transitions. [2018-11-10 12:16:14,496 INFO L78 Accepts]: Start accepts. Automaton has 26785 states and 31218 transitions. Word has length 198 [2018-11-10 12:16:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:14,496 INFO L481 AbstractCegarLoop]: Abstraction has 26785 states and 31218 transitions. [2018-11-10 12:16:14,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:16:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 26785 states and 31218 transitions. [2018-11-10 12:16:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 12:16:14,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:14,501 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 12:16:14,501 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:14,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2014329844, now seen corresponding path program 1 times [2018-11-10 12:16:14,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:14,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-10 12:16:14,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:16:14,585 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:16:14,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:14,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-10 12:16:14,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:16:14,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-10 12:16:14,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:16:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:16:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:16:14,777 INFO L87 Difference]: Start difference. First operand 26785 states and 31218 transitions. Second operand 9 states. [2018-11-10 12:16:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:15,331 INFO L93 Difference]: Finished difference Result 36899 states and 43686 transitions. [2018-11-10 12:16:15,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:16:15,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 285 [2018-11-10 12:16:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:15,351 INFO L225 Difference]: With dead ends: 36899 [2018-11-10 12:16:15,351 INFO L226 Difference]: Without dead ends: 10163 [2018-11-10 12:16:15,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:16:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10163 states. [2018-11-10 12:16:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10163 to 7348. [2018-11-10 12:16:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7348 states. [2018-11-10 12:16:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7348 states to 7348 states and 8322 transitions. [2018-11-10 12:16:15,765 INFO L78 Accepts]: Start accepts. Automaton has 7348 states and 8322 transitions. Word has length 285 [2018-11-10 12:16:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:15,765 INFO L481 AbstractCegarLoop]: Abstraction has 7348 states and 8322 transitions. [2018-11-10 12:16:15,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:16:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7348 states and 8322 transitions. [2018-11-10 12:16:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-10 12:16:15,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:15,769 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 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, 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, 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-11-10 12:16:15,769 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:15,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 431077837, now seen corresponding path program 1 times [2018-11-10 12:16:15,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:15,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:15,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 58 proven. 7 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-10 12:16:15,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:16:15,851 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:16:15,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:15,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 12:16:16,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:16:16,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 12:16:16,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:16:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:16:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:16:16,025 INFO L87 Difference]: Start difference. First operand 7348 states and 8322 transitions. Second operand 8 states. [2018-11-10 12:16:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:16,639 INFO L93 Difference]: Finished difference Result 11291 states and 12902 transitions. [2018-11-10 12:16:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:16:16,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 307 [2018-11-10 12:16:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:16,647 INFO L225 Difference]: With dead ends: 11291 [2018-11-10 12:16:16,647 INFO L226 Difference]: Without dead ends: 4324 [2018-11-10 12:16:16,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 310 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-11-10 12:16:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4324 states. [2018-11-10 12:16:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4324 to 4153. [2018-11-10 12:16:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2018-11-10 12:16:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 4705 transitions. [2018-11-10 12:16:16,829 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 4705 transitions. Word has length 307 [2018-11-10 12:16:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:16,829 INFO L481 AbstractCegarLoop]: Abstraction has 4153 states and 4705 transitions. [2018-11-10 12:16:16,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:16:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 4705 transitions. [2018-11-10 12:16:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-10 12:16:16,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:16:16,831 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 12:16:16,831 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:16:16,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:16:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1634190171, now seen corresponding path program 1 times [2018-11-10 12:16:16,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:16:16,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:16:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:16,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:16:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-10 12:16:16,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:16:16,919 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/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-11-10 12:16:16,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:16:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:16:17,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:16:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 12:16:17,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:16:17,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-10 12:16:17,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:16:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:16:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:16:17,081 INFO L87 Difference]: Start difference. First operand 4153 states and 4705 transitions. Second operand 6 states. [2018-11-10 12:16:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:16:17,415 INFO L93 Difference]: Finished difference Result 4809 states and 5427 transitions. [2018-11-10 12:16:17,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:16:17,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 307 [2018-11-10 12:16:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:16:17,416 INFO L225 Difference]: With dead ends: 4809 [2018-11-10 12:16:17,416 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:16:17,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 308 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-11-10 12:16:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:16:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:16:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:16:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:16:17,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-11-10 12:16:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:16:17,422 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:16:17,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:16:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:16:17,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:16:17,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:16:17,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:17,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,230 WARN L179 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 273 [2018-11-10 12:16:18,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:18,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:19,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:20,587 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 279 [2018-11-10 12:16:21,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,662 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 249 [2018-11-10 12:16:21,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:21,957 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 245 [2018-11-10 12:16:22,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,786 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 256 [2018-11-10 12:16:22,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:22,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:23,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:23,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:23,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:23,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:24,612 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 418 DAG size of output: 278 [2018-11-10 12:16:25,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,924 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 418 DAG size of output: 278 [2018-11-10 12:16:25,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:25,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:16:26,589 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 85 [2018-11-10 12:16:27,774 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 282 DAG size of output: 106 [2018-11-10 12:16:28,631 WARN L179 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 94 [2018-11-10 12:16:31,735 WARN L179 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 441 DAG size of output: 163 [2018-11-10 12:16:34,391 WARN L179 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 401 DAG size of output: 112 [2018-11-10 12:16:34,692 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 1 [2018-11-10 12:16:36,105 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 296 DAG size of output: 124 [2018-11-10 12:16:37,929 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 491 DAG size of output: 95 [2018-11-10 12:16:38,959 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 248 DAG size of output: 103 [2018-11-10 12:16:39,151 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-11-10 12:16:40,329 WARN L179 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 288 DAG size of output: 110 [2018-11-10 12:16:40,538 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 1 [2018-11-10 12:16:40,711 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 1 [2018-11-10 12:16:42,241 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 393 DAG size of output: 100 [2018-11-10 12:16:43,423 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 392 DAG size of output: 91 [2018-11-10 12:16:43,571 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 388 DAG size of output: 1 [2018-11-10 12:16:44,128 WARN L179 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 80 [2018-11-10 12:16:44,858 WARN L179 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 91 [2018-11-10 12:16:45,820 WARN L179 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 101 [2018-11-10 12:16:46,718 WARN L179 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 99 [2018-11-10 12:16:48,347 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 393 DAG size of output: 100 [2018-11-10 12:16:51,015 WARN L179 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 398 DAG size of output: 153 [2018-11-10 12:16:52,085 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 267 DAG size of output: 105 [2018-11-10 12:16:53,609 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 507 DAG size of output: 80 [2018-11-10 12:16:55,069 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 446 DAG size of output: 108 [2018-11-10 12:16:58,160 WARN L179 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 441 DAG size of output: 163 [2018-11-10 12:16:58,365 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 504 DAG size of output: 1 [2018-11-10 12:16:59,507 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 285 DAG size of output: 110 [2018-11-10 12:17:00,043 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 501 DAG size of output: 1 [2018-11-10 12:17:01,478 WARN L179 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 321 DAG size of output: 94 [2018-11-10 12:17:03,812 WARN L179 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 434 DAG size of output: 148 [2018-11-10 12:17:06,187 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 401 DAG size of output: 87 [2018-11-10 12:17:06,656 WARN L179 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 91 [2018-11-10 12:17:08,851 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 310 DAG size of output: 138 [2018-11-10 12:17:10,001 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 285 DAG size of output: 110 [2018-11-10 12:17:10,743 WARN L179 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 88 [2018-11-10 12:17:11,137 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 94 [2018-11-10 12:17:12,598 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 417 DAG size of output: 101 [2018-11-10 12:17:12,789 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-11-10 12:17:13,311 WARN L179 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 91 [2018-11-10 12:17:13,404 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-11-10 12:17:13,404 INFO L425 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-11-10 12:17:13,404 INFO L425 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-11-10 12:17:13,404 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-11-10 12:17:13,405 INFO L421 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse31 (+ ~c_num_read~0 1)) (.cse27 (not (= 0 ~c_dr_st~0))) (.cse28 (= 2 ~c_dr_st~0)) (.cse21 (= 2 ~p_dw_st~0))) (let ((.cse9 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (and .cse28 .cse21)) (.cse25 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse19 (< 0 ~q_req_up~0)) (.cse13 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (< ~q_free~0 1)) (.cse8 (< 1 ~q_free~0)) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse26 (and .cse27 .cse21)) (.cse29 (< ~p_num_write~0 .cse31)) (.cse15 (not .cse0)) (.cse30 (< .cse31 ~p_num_write~0)) (.cse17 (not (= |old(~p_dw_st~0)| 2))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse7 (= ~p_dw_st~0 0)) (.cse12 (< ~q_write_ev~0 2)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse24 (= 1 ~q_req_up~0)) (.cse20 (not (= ~q_read_ev~0 2))) (.cse4 (not (= |old(~p_dw_st~0)| 0))) (.cse5 (= ~p_dw_pc~0 1)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse23 (not (= ~q_free~0 0))) (.cse16 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 (or .cse12 .cse13 .cse1 .cse2 .cse14 .cse15 .cse16 .cse17 .cse8 .cse18 .cse10 .cse19)) (or .cse14 .cse1 .cse20 .cse21 .cse17 .cse22 .cse23 .cse24 .cse25 .cse5 .cse6) (or .cse12 .cse1 .cse14 .cse15 .cse26 .cse23 .cse24 .cse3 .cse20 .cse17) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse28 .cse0 .cse1 .cse2 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10) (or (= 0 ~p_dw_st~0) .cse14 .cse1 .cse20 .cse9 .cse22 .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10) (or .cse12 .cse1 .cse14 .cse23 .cse24 .cse3 (and .cse27 .cse7) .cse20 .cse4 .cse5) (or .cse29 .cse14 .cse1 .cse15 .cse11 .cse30 .cse20 (not .cse5) .cse17 (= 0 ~q_write_ev~0) .cse19 .cse23 .cse16) (or .cse12 .cse1 .cse14 .cse23 .cse16 .cse24 .cse28 .cse5 .cse17) (or .cse14 .cse1 .cse15 .cse20 .cse17 .cse13 .cse12 .cse2 .cse28 .cse16 .cse24 .cse8 .cse18 .cse10) (or .cse12 .cse1 .cse14 .cse23 .cse20 .cse21 .cse25 .cse5 .cse17 .cse6 .cse19) (or .cse0 .cse1 .cse23 .cse27 .cse3) (or .cse14 .cse1 .cse15 .cse17 .cse13 .cse12 .cse2 .cse28 .cse16 .cse24 .cse5 .cse8 .cse18 .cse10) (or .cse14 .cse1 .cse15 .cse26 .cse17 .cse13 .cse12 .cse2 .cse24 .cse3 .cse5 .cse8 .cse18 .cse10) (or .cse14 .cse1 .cse15 .cse20 .cse17 .cse13 .cse12 .cse2 .cse24 .cse3 .cse8 .cse18 .cse10 .cse26) (or .cse26 .cse12 .cse1 .cse14 .cse15 .cse23 .cse24 .cse3 .cse5 .cse17) (or .cse12 .cse1 .cse14 .cse23 .cse16 .cse24 .cse20 .cse17 .cse28) (or .cse29 .cse12 .cse1 .cse14 .cse15 .cse23 .cse24 .cse21 .cse30 .cse5 .cse17) (or .cse0 .cse1 .cse23 .cse3 .cse4 .cse7) (or .cse12 .cse1 .cse14 .cse23 .cse16 .cse24 .cse20 .cse4 .cse5 .cse28) (or .cse0 .cse1 .cse23 .cse16 .cse28)))) [2018-11-10 12:17:13,405 INFO L421 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse33 (+ ~c_num_read~0 1)) (.cse9 (= activate_threads_~tmp~1 0)) (.cse29 (not (= 0 ~c_dr_st~0))) (.cse18 (= 2 ~p_dw_st~0))) (let ((.cse25 (and .cse29 .cse18)) (.cse21 (< 0 ~q_req_up~0)) (.cse8 (not (= 0 ~p_num_write~0))) (.cse24 (= 2 ~c_dr_st~0)) (.cse23 (not (= 2 |old(~c_dr_st~0)|))) (.cse26 (and .cse29 .cse9 .cse18)) (.cse27 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (< ~q_free~0 1)) (.cse7 (< 1 ~q_free~0)) (.cse28 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse32 (= ~p_dw_st~0 0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse22 (not (= |old(~p_dw_st~0)| 0))) (.cse20 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse30 (and .cse9 .cse18)) (.cse31 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse11 (< ~p_num_write~0 .cse33)) (.cse12 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not .cse0)) (.cse15 (not (= ~q_free~0 0))) (.cse16 (= 1 ~q_req_up~0)) (.cse17 (< .cse33 ~p_num_write~0)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse5 (= ~p_dw_pc~0 1)) (.cse19 (not (= |old(~p_dw_st~0)| 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse1 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse5 .cse19) (or .cse13 .cse1 .cse4 .cse8 .cse20 .cse21 .cse0 .cse2 .cse22 (and (= 0 ~p_dw_st~0) .cse9) .cse5 .cse6 .cse7 .cse10) (or .cse12 .cse1 .cse13 .cse15 .cse23 .cse16 .cse4 .cse24 .cse19) (or .cse12 .cse1 .cse13 .cse15 .cse23 .cse16 .cse24 .cse5 .cse19) (or .cse12 .cse1 .cse13 .cse25 .cse14 .cse15 .cse16 .cse3 .cse5 .cse19) (or .cse11 .cse13 .cse1 .cse14 .cse17 .cse4 (not .cse5) .cse19 (= 0 ~q_write_ev~0) .cse21 .cse15 .cse23 (and .cse24 .cse9 .cse18)) (or .cse12 .cse1 .cse13 .cse15 .cse23 .cse16 .cse4 .cse22 .cse24 .cse5) (or .cse12 .cse1 .cse13 .cse14 .cse15 .cse16 .cse3 .cse4 .cse19 .cse26) (or .cse25 .cse13 .cse1 .cse14 .cse19 .cse27 .cse12 .cse2 .cse16 .cse3 .cse5 .cse7 .cse28 .cse10) (or .cse0 .cse1 .cse24 .cse15 .cse23) (or .cse0 .cse1 .cse15 .cse3 .cse29) (or .cse12 .cse1 .cse13 .cse15 .cse30 .cse4 .cse31 .cse5 .cse19 .cse6 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse32 .cse7 .cse8 .cse10) (or (and .cse24 .cse18) (and (and .cse32 .cse24) (= ~q_read_ev~0 1)) (or .cse12 .cse27 .cse1 .cse2 .cse13 .cse14 .cse23 .cse19 .cse7 .cse28 .cse10 .cse21)) (or .cse0 .cse1 .cse15 .cse3 .cse4 .cse9) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10) (or (and .cse29 .cse32 .cse9) .cse12 .cse1 .cse13 .cse15 .cse16 .cse3 .cse4 .cse22 .cse5) (or .cse0 .cse24 .cse1 .cse2 .cse23 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse13 .cse1 .cse14 .cse4 .cse19 .cse27 .cse12 .cse2 .cse24 .cse23 .cse16 .cse7 .cse28 .cse10) (or .cse13 .cse1 .cse14 .cse24 .cse19 .cse27 .cse12 .cse2 .cse23 .cse16 .cse5 .cse7 .cse28 .cse10) (or .cse13 .cse1 .cse14 .cse26 .cse4 .cse19 .cse27 .cse12 .cse2 .cse16 .cse3 .cse7 .cse28 .cse10) (or .cse0 .cse1 .cse32 .cse15 .cse3 .cse22) (or .cse13 .cse1 .cse4 .cse19 .cse20 .cse15 .cse16 .cse30 .cse31 .cse5 .cse6) (or .cse11 .cse12 .cse1 .cse13 .cse14 .cse15 .cse16 .cse17 .cse4 .cse5 .cse19 .cse9)))) [2018-11-10 12:17:13,406 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse31 (+ ~c_num_read~0 1)) (.cse27 (not (= 0 ~c_dr_st~0))) (.cse28 (= 2 ~c_dr_st~0)) (.cse21 (= 2 ~p_dw_st~0))) (let ((.cse9 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (and .cse28 .cse21)) (.cse25 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse19 (< 0 ~q_req_up~0)) (.cse13 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (< ~q_free~0 1)) (.cse8 (< 1 ~q_free~0)) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse26 (and .cse27 .cse21)) (.cse29 (< ~p_num_write~0 .cse31)) (.cse15 (not .cse0)) (.cse30 (< .cse31 ~p_num_write~0)) (.cse17 (not (= |old(~p_dw_st~0)| 2))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse7 (= ~p_dw_st~0 0)) (.cse12 (< ~q_write_ev~0 2)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse24 (= 1 ~q_req_up~0)) (.cse20 (not (= ~q_read_ev~0 2))) (.cse4 (not (= |old(~p_dw_st~0)| 0))) (.cse5 (= ~p_dw_pc~0 1)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse23 (not (= ~q_free~0 0))) (.cse16 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 (or .cse12 .cse13 .cse1 .cse2 .cse14 .cse15 .cse16 .cse17 .cse8 .cse18 .cse10 .cse19)) (or .cse14 .cse1 .cse20 .cse21 .cse17 .cse22 .cse23 .cse24 .cse25 .cse5 .cse6) (or .cse12 .cse1 .cse14 .cse15 .cse26 .cse23 .cse24 .cse3 .cse20 .cse17) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse28 .cse0 .cse1 .cse2 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10) (or (= 0 ~p_dw_st~0) .cse14 .cse1 .cse20 .cse9 .cse22 .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10) (or .cse12 .cse1 .cse14 .cse23 .cse24 .cse3 (and .cse27 .cse7) .cse20 .cse4 .cse5) (or .cse29 .cse14 .cse1 .cse15 .cse11 .cse30 .cse20 (not .cse5) .cse17 (= 0 ~q_write_ev~0) .cse19 .cse23 .cse16) (or .cse12 .cse1 .cse14 .cse23 .cse16 .cse24 .cse28 .cse5 .cse17) (or .cse14 .cse1 .cse15 .cse20 .cse17 .cse13 .cse12 .cse2 .cse28 .cse16 .cse24 .cse8 .cse18 .cse10) (or .cse12 .cse1 .cse14 .cse23 .cse20 .cse21 .cse25 .cse5 .cse17 .cse6 .cse19) (or .cse0 .cse1 .cse23 .cse27 .cse3) (or .cse14 .cse1 .cse15 .cse17 .cse13 .cse12 .cse2 .cse28 .cse16 .cse24 .cse5 .cse8 .cse18 .cse10) (or .cse14 .cse1 .cse15 .cse26 .cse17 .cse13 .cse12 .cse2 .cse24 .cse3 .cse5 .cse8 .cse18 .cse10) (or .cse14 .cse1 .cse15 .cse20 .cse17 .cse13 .cse12 .cse2 .cse24 .cse3 .cse8 .cse18 .cse10 .cse26) (or .cse26 .cse12 .cse1 .cse14 .cse15 .cse23 .cse24 .cse3 .cse5 .cse17) (or .cse12 .cse1 .cse14 .cse23 .cse16 .cse24 .cse20 .cse17 .cse28) (or .cse29 .cse12 .cse1 .cse14 .cse15 .cse23 .cse24 .cse21 .cse30 .cse5 .cse17) (or .cse0 .cse1 .cse23 .cse3 .cse4 .cse7) (or .cse12 .cse1 .cse14 .cse23 .cse16 .cse24 .cse20 .cse4 .cse5 .cse28) (or .cse0 .cse1 .cse23 .cse16 .cse28)))) [2018-11-10 12:17:13,406 INFO L425 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-11-10 12:17:13,406 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-11-10 12:17:13,406 INFO L421 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1)) (.cse13 (= 1 ~c_dr_pc~0)) (.cse5 (= 0 ~c_dr_st~0))) (let ((.cse12 (< 0 ~q_req_up~0)) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse19 (not (= 2 ~c_dr_st~0))) (.cse20 (not .cse5)) (.cse23 (= exists_runnable_thread_~__retres1~2 1)) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse18 (not .cse13)) (.cse4 (= 1 ~q_req_up~0)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse21 (not .cse9)) (.cse22 (not (= ~p_dw_st~0 2))) (.cse3 (not (= ~q_free~0 0))) (.cse8 (= 1 exists_runnable_thread_~__retres1~2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse14 (< ~q_free~0 1)) (.cse7 (not (= ~p_dw_st~0 0))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse16 (< 1 ~q_free~0)) (.cse10 (not (= 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) (or .cse2 .cse1 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 .cse8 .cse9 .cse15 .cse16 .cse17) (or .cse2 .cse1 .cse18 .cse8 .cse6 .cse10 .cse11 .cse12 .cse14 .cse19 .cse7 .cse15 .cse16 .cse17) (or .cse20 .cse2 .cse1 .cse6 .cse21 .cse22 .cse11 .cse13 .cse3 .cse23 (not (= 1 ~p_num_write~0)) .cse15) (or .cse23 (or .cse21 (or .cse2 .cse1 .cse18 .cse6 (< ~p_num_write~0 ~c_num_read~0) .cse0 .cse14 .cse19 .cse4 .cse7 .cse16 (< ~c_num_read~0 ~p_num_write~0) .cse17))) (or .cse20 .cse23 (let ((.cse24 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse24) .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 (< .cse24 ~p_num_write~0) .cse6 .cse21 .cse22))) (or .cse13 .cse1 .cse3 .cse5 .cse7 .cse8) (or .cse8 .cse13 .cse1 .cse14 .cse5 .cse7 .cse9 .cse15 .cse16 .cse10 .cse17)))) [2018-11-10 12:17:13,406 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-11-10 12:17:13,406 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-11-10 12:17:13,406 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-11-10 12:17:13,406 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L421 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse14 (= 1 ~c_dr_pc~0))) (let ((.cse15 (< ~q_free~0 1)) (.cse18 (not .cse14)) (.cse16 (< 1 ~q_free~0)) (.cse23 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse21 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse7 (= ~p_dw_pc~0 1)) (.cse5 (and .cse23 .cse21 .cse22)) (.cse19 (not (= ~q_free~0 0))) (.cse13 (and .cse23 .cse22)) (.cse12 (= 0 ~c_dr_st~0)) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse6 (or .cse15 .cse18 .cse16)) (.cse20 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (= ~p_dw_st~0 2))) (.cse9 (not (= 1 |old(~q_req_up~0)|))) (.cse10 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse12 .cse13 .cse7 (not (= 0 ~c_num_read~0)) (or .cse14 .cse15 .cse16) (not (= 0 ~p_num_write~0)) .cse11) (or (not .cse7) .cse5 (or .cse3 .cse4 (let ((.cse17 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse17) .cse2 .cse18 .cse19 (< .cse17 ~p_num_write~0))) .cse20 .cse8 .cse9 (= 0 |old(~q_write_ev~0)|))) (or .cse14 .cse2 .cse19 .cse13 .cse12) (or (and (and .cse21 .cse22) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse8 .cse9 .cse10 .cse11)))))) [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-11-10 12:17:13,407 INFO L425 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-11-10 12:17:13,408 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse27 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse15 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse34 (+ ~c_num_read~0 1)) (.cse25 (= 1 ~c_dr_pc~0)) (.cse18 (not (= |old(~q_read_ev~0)| 2)))) (let ((.cse30 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (not (= 1 ~p_num_write~0))) (.cse33 (or .cse25 .cse18 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (.cse26 (not (= |old(~q_read_ev~0)| 1))) (.cse28 (= ~q_read_ev~0 1)) (.cse14 (< ~p_num_write~0 .cse34)) (.cse17 (< .cse34 ~p_num_write~0)) (.cse19 (not .cse10)) (.cse32 (not (= ~p_dw_st~0 0))) (.cse21 (not (= ~q_free~0 0))) (.cse24 (not (= 0 ~c_num_read~0))) (.cse31 (not (= 0 ~p_num_write~0))) (.cse29 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse22 (not (= 2 ~c_dr_st~0))) (.cse20 (< 0 ~q_req_up~0)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not .cse25)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse7 (< ~q_free~0 1)) (.cse8 (= 1 ~q_req_up~0)) (.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 .cse27 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse0 .cse1 (and .cse15 .cse16) .cse17 .cse18 .cse19 .cse4 (= 0 |old(~q_write_ev~0)|) .cse20 .cse21 .cse22) (or .cse6 .cse1 .cse0 .cse21 .cse18 .cse3 .cse23 .cse10 .cse4 .cse24 .cse20) (or .cse25 .cse1 .cse21 .cse3 .cse9) (or .cse3 .cse6 .cse1 .cse0 .cse21 .cse8 .cse9 .cse10 .cse4) (or (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse8 .cse9 .cse4 .cse11 .cse12 .cse13) .cse26 (and .cse27 .cse28)) (or .cse0 .cse1 (and .cse29 .cse30) .cse31 .cse20 .cse7 .cse32 .cse10 .cse24 .cse11 .cse33 .cse13) (or .cse14 .cse6 .cse1 .cse0 .cse2 .cse21 .cse8 .cse3 .cse17 .cse10 .cse4) (or .cse1 .cse0 .cse4 (and .cse15 .cse30) .cse21 .cse8 .cse23 .cse10 .cse24 .cse33) (or (or (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse22 .cse8 .cse32 .cse11 .cse12 .cse13) .cse19) .cse26 (and .cse16 .cse28)) (or .cse14 .cse0 .cse1 .cse2 .cse17 .cse18 .cse19 .cse4 .cse20 .cse21 (not (= 1 |old(~q_write_ev~0)|)) (and .cse15 (= 1 ~q_write_ev~0))) (or .cse6 .cse1 .cse0 .cse21 .cse8 .cse9 .cse3 .cse18 .cse32 .cse10) (or .cse6 .cse1 .cse0 .cse3 .cse21 .cse8 .cse9 .cse18 .cse4) (or .cse3 .cse25 .cse1 .cse7 .cse9 .cse10 .cse24 .cse11 .cse31 .cse13) (or (and .cse29 .cse16) (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse22 .cse4 .cse11 .cse12 .cse13 .cse20)) (or .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse3)))) [2018-11-10 12:17:13,408 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-11-10 12:17:13,408 INFO L421 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-11-10 12:17:13,408 INFO L425 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-11-10 12:17:13,408 INFO L425 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-11-10 12:17:13,408 INFO L421 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-11-10 12:17:13,408 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-10 12:17:13,408 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-11-10 12:17:13,408 INFO L421 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-11-10 12:17:13,409 INFO L421 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-11-10 12:17:13,409 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-11-10 12:17:13,409 INFO L421 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse7 (= 1 ~c_dr_pc~0))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse8 (< |old(~q_free~0)| 1)) (.cse28 (not .cse7)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse11 (< 1 |old(~q_free~0)|))) (let ((.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse24 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse23 (= ~q_free~0 0)) (.cse27 (< ~q_write_ev~0 2)) (.cse21 (not (= |old(~q_free~0)| 0))) (.cse22 (= 0 ~c_dr_st~0)) (.cse9 (= |old(~p_dw_pc~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse26 (or .cse1 .cse8 .cse28 .cse2 .cse11)) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (< 0 |old(~q_req_up~0)|)) (.cse13 (<= 1 ~q_free~0)) (.cse14 (not (= 0 ~p_dw_st~0))) (.cse15 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse18 (<= ~q_free~0 1)) (.cse20 (= 0 ~p_num_write~0)) (.cse6 (= |old(~p_dw_st~0)| 0)) (.cse25 (not (= 2 ~c_dr_st~0))) (.cse10 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse7 .cse1 .cse21 .cse22 (and .cse23 .cse24 .cse15 .cse16)) (or (or .cse6 .cse0 .cse25 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse26)) .cse27 (not .cse9) (and .cse14 .cse17 (and .cse24 .cse15 .cse18 .cse16 .cse13))) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse19 .cse12) (or .cse22 (and .cse15 .cse16 .cse13 .cse18 .cse20) .cse10 (or .cse7 .cse1 .cse8 .cse9 .cse11) .cse3) (or .cse6 (and .cse24 .cse15 .cse16 .cse23 .cse14 .cse17) .cse27 .cse1 .cse0 .cse28 .cse21 (= 1 |old(~q_req_up~0)|) .cse22 .cse2 .cse9) (or .cse0 .cse3 .cse26 .cse4 .cse5 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) .cse6 .cse25 .cse10))))) [2018-11-10 12:17:13,409 INFO L421 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse13 (< |old(~q_free~0)| 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse20 (< 1 |old(~q_free~0)|)) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse10 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< 0 |old(~q_req_up~0)|)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse14 (and .cse5 .cse6)) (.cse17 (= 0 ~p_num_write~0)) (.cse3 (= 0 ~c_dr_st~0)) (.cse19 (not (= 0 ~c_num_read~0))) (.cse9 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (= |old(~p_dw_st~0)| 0)) (.cse7 (not (= ~p_dw_i~0 1))) (.cse22 (not (= 2 ~c_dr_st~0))) (.cse21 (or .cse1 .cse13 (not .cse0) .cse8 .cse20)) (.cse23 (< ~q_write_ev~0 2)) (.cse15 (not (= 0 ~p_dw_st~0))) (.cse16 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse18 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= ~q_free~0 0) (= 1 |old(~p_dw_pc~0)|) .cse4 .cse5 .cse6)) (or .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 (and .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or (and .cse5 .cse6 .cse15 .cse16 .cse17) .cse7 .cse9 .cse21 .cse10 .cse11 .cse12 .cse22 .cse19) (or .cse12 .cse23 .cse1 .cse7 .cse2 (= 1 |old(~q_req_up~0)|) .cse3 .cse8 .cse18) (or (and .cse14 .cse17) .cse3 .cse19 (or .cse0 .cse1 .cse13 .cse18 .cse20) .cse9) (or (or .cse12 .cse7 .cse22 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse21)) .cse23 (and .cse15 .cse16 (and .cse4 .cse5 .cse6)) (not .cse18))))) [2018-11-10 12:17:13,409 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 147) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L421 ceAbstractionStarter]: At program point L129-2(lines 117 152) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0))) (let ((.cse9 (+ |old(~p_num_write~0)| 1)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (< |old(~q_free~0)| 1)) (.cse30 (not .cse0)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse19 (< 1 |old(~q_free~0)|)) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0)) (.cse23 (not (= 0 ~p_dw_st~0))) (.cse28 (= 1 ~p_num_write~0))) (let ((.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse7 (= 0 ~c_dr_st~0)) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (< 0 |old(~q_req_up~0)|)) (.cse22 (<= 1 ~q_free~0)) (.cse24 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse25 (<= ~q_free~0 1)) (.cse27 (= 0 ~p_num_write~0)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse21 (and .cse5 .cse6 .cse3 .cse23 .cse28)) (.cse15 (= |old(~p_dw_st~0)| 0)) (.cse10 (not (= ~p_dw_i~0 1))) (.cse32 (not (= 2 ~c_dr_st~0))) (.cse31 (or .cse1 .cse16 .cse30 .cse11 .cse19)) (.cse29 (< ~q_write_ev~0 2)) (.cse8 (<= .cse9 ~p_num_write~0)) (.cse17 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 (not (= ~p_dw_pc~0 1)) .cse6) .cse7 (and .cse3 (= 1 |old(~p_dw_pc~0)|) .cse5 .cse6 .cse8 (<= ~p_num_write~0 .cse9))) (or .cse10 .cse1 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse5 .cse6 .cse24 .cse25 .cse26 .cse27)) (or .cse1 .cse11 .cse12 .cse13 .cse0 .cse28 .cse16 .cse7 .cse17 .cse18 .cse19 .cse26 .cse20) (or .cse7 (and .cse5 .cse6 .cse22 .cse25 .cse27) .cse18 (or .cse0 .cse1 .cse16 .cse17 .cse19) (and .cse3 .cse5 .cse28 .cse6) .cse12) (or .cse15 (and .cse4 .cse5 .cse6 .cse3 .cse23 .cse24) .cse29 .cse1 .cse10 .cse30 .cse2 (= 1 |old(~q_req_up~0)|) .cse7 .cse11 .cse17) (or .cse10 .cse12 .cse31 .cse13 .cse14 (and .cse22 .cse23 .cse5 .cse6 .cse24 .cse25 .cse27) .cse15 .cse32 .cse18 .cse21) (or (or .cse15 .cse10 .cse32 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse31)) .cse29 (and .cse6 .cse8 (= 1 ~p_dw_pc~0) .cse3 .cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not .cse17)))))) [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L421 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse5 (= 1 ~c_dr_pc~0))) (let ((.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= 1 ~p_dw_pc~0)) (.cse0 (= ~q_free~0 0)) (.cse23 (= 2 ~p_dw_st~0)) (.cse1 (= 1 ~p_num_write~0)) (.cse24 (+ |old(~p_num_write~0)| 1)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (< |old(~q_free~0)| 1)) (.cse25 (not .cse5)) (.cse26 (not (= ~q_read_ev~0 2))) (.cse9 (< 1 |old(~q_free~0)|))) (let ((.cse19 (not (= 2 ~c_dr_st~0))) (.cse15 (or .cse6 .cse7 .cse25 .cse26 .cse9)) (.cse21 (<= .cse24 ~p_num_write~0)) (.cse20 (< ~q_write_ev~0 2)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse3 (= 0 ~c_dr_st~0)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse17 (< 0 |old(~q_req_up~0)|)) (.cse18 (= |old(~p_dw_st~0)| 0)) (.cse8 (= |old(~p_dw_pc~0)| 1)) (.cse4 (not (= 0 ~c_num_read~0))) (.cse13 (and .cse2 .cse22 .cse0 .cse23 .cse1))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse5 .cse6 .cse11 .cse3 .cse8 (and .cse0 .cse12 .cse2)) (or .cse13 .cse14 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19 .cse4) (or (or .cse18 .cse14 .cse19 (or (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|) .cse15)) .cse20 (not .cse8) (and .cse2 .cse21 .cse22 .cse0 .cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or .cse5 .cse6 .cse11 .cse3 (and .cse0 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse2 .cse21 (<= ~p_num_write~0 .cse24)) (not (= 1 |old(~p_dw_pc~0)|))) (or .cse18 .cse20 .cse6 .cse14 .cse25 .cse11 (= 1 |old(~q_req_up~0)|) (and .cse12 .cse2 .cse0 .cse23 (= |old(~q_req_up~0)| ~q_req_up~0)) .cse3 .cse26 .cse8) (or .cse14 .cse6 .cse26 .cse10 .cse16 .cse17 .cse18 .cse5 .cse7 .cse8 .cse4 .cse9 .cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|))))))) [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 101) no Hoare annotation was computed. [2018-11-10 12:17:13,410 INFO L425 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 97 101) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point L95-1(line 95) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point immediate_notify_threadsENTRY(lines 89 113) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 89 113) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 109) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point L105-2(lines 89 113) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:17:13,411 INFO L421 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-11-10 12:17:13,411 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:17:13,412 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse43 (not (= ~c_dr_pc~0 1))) (.cse44 (= ~c_num_read~0 0)) (.cse31 (= 1 |old(~c_dr_pc~0)|)) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse50 (+ ~c_num_read~0 1)) (.cse51 (+ |old(~c_num_read~0)| 1)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= 1 ~q_free~0)) (.cse18 (<= ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse34 (not (= 0 ~c_dr_st~0))) (.cse35 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse15 (= 1 ~c_dr_pc~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse37 (= ~q_free~0 0)) (.cse19 (= 2 ~p_dw_st~0)) (.cse20 (= |old(~q_req_up~0)| ~q_req_up~0))) (let ((.cse9 (and .cse14 .cse34 .cse35 .cse15 .cse16 .cse37 .cse19 .cse20)) (.cse45 (= 0 ~p_num_write~0)) (.cse47 (and .cse13 .cse14 .cse34 .cse35 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) (.cse39 (< |old(~p_num_write~0)| .cse51)) (.cse42 (< .cse51 |old(~p_num_write~0)|)) (.cse40 (<= .cse50 ~p_num_write~0)) (.cse41 (<= ~p_num_write~0 .cse50)) (.cse46 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse24 (not .cse12)) (.cse10 (not .cse31)) (.cse25 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse28 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse8 (= 2 ~c_dr_st~0)) (.cse23 (= 1 ~p_dw_pc~0)) (.cse26 (< |old(~q_free~0)| 1)) (.cse38 (not (= |old(~p_dw_st~0)| 0))) (.cse36 (= ~p_dw_st~0 0)) (.cse27 (< 1 |old(~q_free~0)|)) (.cse33 (not (= 0 |old(~p_num_write~0)|))) (.cse29 (not (= |old(~c_last_read~0)| |old(~p_last_write~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))) (.cse49 (and .cse43 .cse35 .cse16 .cse44 .cse37 .cse19 .cse20 (= 1 ~p_num_write~0))) (.cse48 (not (= 1 |old(~p_num_write~0)|))) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse32 (not (= 0 |old(~c_num_read~0)|))) (.cse30 (< 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 (and (and .cse13 .cse14 .cse8 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23) .cse24 (or .cse0 .cse25 .cse1 .cse26 .cse2 .cse10 .cse4 .cse7 .cse27 .cse28 .cse29 .cse30)) (or .cse8 .cse31 .cse1 .cse26 .cse4 .cse12 .cse32 .cse27 .cse33 .cse29) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 (and .cse14 .cse34 .cse35 .cse36 .cse15 .cse16 .cse37 .cse20) .cse6 .cse38 .cse12) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse27 .cse28 .cse29) (or .cse39 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse40 .cse14 .cse35 .cse15 .cse16 .cse37 .cse19 .cse20 .cse41) .cse42 .cse12 .cse7) (or .cse39 .cse2 .cse1 .cse10 (and .cse40 .cse14 .cse8 .cse15 .cse16 .cse23 .cse37 .cse19 .cse20 .cse41) .cse42 .cse6 .cse24 .cse7 (= 0 ~q_write_ev~0) .cse30 .cse3 .cse4) (or (and .cse17 .cse43 .cse35 (= 0 ~p_dw_st~0) .cse16 .cse44 .cse20 .cse21 .cse22 .cse45) .cse2 .cse1 .cse6 .cse33 .cse46 .cse30 .cse31 .cse26 .cse38 .cse12 .cse32 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse31 .cse1 .cse3 .cse4 .cse8) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse27 .cse28 .cse29 .cse47) (or (and .cse43 .cse34 .cse35 .cse16 .cse17 .cse44 .cse21 .cse22 .cse45) .cse31 .cse1 .cse26 .cse11 .cse12 .cse32 .cse27 .cse33 .cse29) (or .cse39 .cse1 .cse2 .cse10 (and .cse40 .cse41) .cse42 .cse6 .cse0 .cse3 .cse5 .cse11 .cse38 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse12 .cse27 .cse28 .cse29) (or .cse31 .cse1 .cse3 .cse11 .cse38 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse38 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse47 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse12 .cse27 .cse28 .cse29) (or .cse31 .cse1 .cse3 .cse11 .cse48 .cse32 .cse44) (or (or .cse39 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse42 .cse6 .cse24 .cse7) (and .cse40 .cse14 .cse15 .cse16 .cse23 .cse37 .cse19 .cse20 .cse41)) (or .cse2 .cse1 .cse6 .cse49 .cse7 .cse46 .cse31 .cse3 .cse5 .cse48 .cse12 .cse32) (or (or .cse24 (or .cse2 .cse1 .cse10 .cse6 .cse25 .cse0 .cse26 .cse4 .cse5 .cse38 .cse27 .cse28 .cse29)) (and (and .cse13 .cse14 .cse36 .cse8 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) .cse23)) (or .cse31 .cse1 .cse26 .cse11 .cse38 .cse12 .cse32 .cse36 .cse27 .cse33 .cse29) (or .cse31 .cse1 .cse3 (and .cse37 .cse43 .cse14 .cse34 .cse35 .cse16) .cse11) (or .cse31 .cse0 .cse1 .cse2 .cse3 .cse6 .cse49 .cse48 .cse12 .cse7 .cse32 .cse30)))) [2018-11-10 12:17:13,412 INFO L425 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-11-10 12:17:13,412 INFO L425 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-11-10 12:17:13,412 INFO L421 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse4 (= 2 ~c_dr_st~0)) (.cse46 (= ~c_num_read~0 1)) (.cse43 (= ~c_num_read~0 0)) (.cse44 (= 1 ~p_num_write~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse13 (= |old(~p_dw_pc~0)| 1)) (.cse55 (+ ~c_num_read~0 1)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse27 (= ~q_free~0 0)) (.cse47 (not (= ~c_dr_pc~0 1))) (.cse57 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse25 (not (= 0 ~c_dr_st~0))) (.cse26 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= 1 ~c_dr_pc~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= 1 ~q_free~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse21 (= 2 ~p_dw_st~0)) (.cse28 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse22 (<= ~q_free~0 1)) (.cse23 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse49 (= 0 ~p_num_write~0)) (.cse38 (and .cse14 .cse15 .cse25 .cse26 .cse16 .cse17 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23)) (.cse42 (not (= 0 |old(~p_num_write~0)|))) (.cse45 (not .cse57)) (.cse50 (and .cse27 .cse47 .cse25 .cse57 .cse17 (= 2 ~q_read_ev~0))) (.cse30 (< |old(~p_num_write~0)| .cse56)) (.cse31 (< .cse56 |old(~p_num_write~0)|)) (.cse24 (<= .cse55 ~p_num_write~0)) (.cse18 (= 1 ~p_dw_pc~0)) (.cse29 (<= ~p_num_write~0 .cse55)) (.cse32 (not .cse13)) (.cse33 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse34 (< |old(~q_free~0)| 1)) (.cse35 (< 1 |old(~q_free~0)|)) (.cse36 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse37 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse10 (and .cse15 .cse25 .cse26 .cse16 .cse17 .cse27 .cse21 .cse28)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (not .cse0)) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse48 (= ~p_dw_st~0 0)) (.cse40 (not (= |old(~p_dw_st~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (not (= ~q_read_ev~0 2))) (.cse52 (and .cse47 .cse26 .cse17 .cse43 .cse27 .cse21 .cse28 .cse44)) (.cse9 (not (= |old(~p_dw_st~0)| 2))) (.cse39 (< 0 |old(~q_req_up~0)|)) (.cse51 (and .cse27 .cse47 .cse25 .cse17)) (.cse5 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse54 (not (= 1 |old(~p_num_write~0)|))) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse53 (and .cse26 .cse4 .cse16 .cse17 .cse46 .cse19 .cse21 .cse22 .cse44 .cse23))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse9 .cse4) (or .cse10 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 .cse12 .cse13 .cse9) (or (and .cse14 .cse15 .cse4 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse15 .cse25 .cse26 .cse16 .cse17 .cse27 .cse21 .cse28 .cse29) (or .cse30 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 .cse31 .cse8 .cse32 .cse9)) (or .cse6 .cse1 .cse11 .cse8 .cse9 .cse33 .cse5 .cse34 .cse7 .cse12 .cse35 .cse36 .cse37 .cse38) (or .cse30 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 (and .cse24 .cse15 .cse26 .cse16 .cse17 .cse27 .cse21 .cse28 .cse29) .cse31 .cse13 .cse9 (and .cse14 .cse15 .cse26 .cse4 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23)) (or (and (and .cse14 .cse15 .cse4 .cse16 .cse17 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23) .cse18) .cse32 (or .cse5 .cse33 .cse1 .cse34 .cse6 .cse11 .cse3 .cse9 .cse35 .cse36 .cse37 .cse39)) (or .cse30 .cse1 .cse6 .cse11 (and .cse24 .cse29) .cse31 .cse8 .cse5 .cse2 .cse7 .cse12 .cse40 .cse13) (or .cse4 .cse0 .cse1 .cse34 .cse3 .cse13 .cse41 .cse35 .cse42 .cse37) (or (and .cse4 .cse17 .cse18 .cse43 .cse27 .cse21 .cse44) .cse6 .cse1 .cse8 .cse42 .cse45 .cse39 (and .cse4 .cse46 .cse19 .cse16 .cse17 .cse18 .cse21 .cse22 .cse44 .cse23) .cse0 .cse34 (and .cse47 .cse25 .cse26 .cse48 .cse17 .cse19 .cse43 .cse22 .cse23 .cse49) .cse50 .cse40 .cse13 .cse41 .cse35 .cse37) (or .cse6 .cse1 .cse11 .cse9 .cse33 .cse5 .cse34 .cse4 .cse3 .cse7 .cse13 .cse35 .cse36 .cse37) (or .cse51 (and .cse47 .cse25 .cse26 .cse17 .cse19 .cse43 .cse22 .cse23 .cse49) .cse0 .cse1 .cse34 .cse12 .cse13 .cse41 .cse35 .cse42 .cse37) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse40 .cse13 .cse4) (or .cse6 .cse1 .cse11 .cse38 .cse9 .cse33 .cse5 .cse34 .cse7 .cse12 .cse13 .cse35 .cse36 .cse37) (or .cse6 .cse1 .cse11 .cse8 .cse9 .cse33 .cse5 .cse34 .cse4 .cse3 .cse7 .cse35 .cse36 .cse37) (or .cse51 .cse0 .cse1 .cse34 .cse12 .cse40 .cse13 .cse41 .cse48 .cse35 .cse42 .cse37) (or .cse6 .cse1 .cse8 .cse52 .cse9 .cse45 .cse0 .cse2 .cse7 .cse53 .cse50 .cse54 .cse13 .cse41) (or .cse30 .cse6 .cse1 .cse11 (and .cse24 .cse15 .cse4 .cse16 .cse17 .cse18 .cse27 .cse21 .cse28 .cse29) .cse31 .cse8 .cse32 .cse9 (= 0 ~q_write_ev~0) .cse39 .cse2 .cse3) (or (and .cse24 .cse4 .cse16 .cse17 .cse18 .cse27 .cse21 .cse29) (or .cse32 (or .cse6 .cse1 .cse11 .cse8 .cse33 .cse5 .cse34 .cse3 .cse7 .cse40 .cse35 .cse36 .cse37))) (or .cse51 .cse0 .cse1 .cse2 .cse12) (or .cse5 .cse1 .cse6 .cse11 .cse10 .cse2 .cse7 .cse12 .cse8 .cse9) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse4 .cse13 .cse9) (or .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 (and .cse15 .cse25 .cse16 .cse17 .cse27 .cse21 .cse28) .cse12 (and .cse15 .cse25 .cse26 .cse48 .cse16 .cse17 .cse27 .cse28) .cse8 .cse40 .cse13) (or .cse1 .cse6 .cse8 .cse52 .cse9 .cse39 .cse51 .cse0 .cse5 .cse2 .cse54 .cse13 .cse41 .cse53)))) [2018-11-10 12:17:13,413 INFO L425 ceAbstractionStarter]: For program point L329-1(lines 329 369) no Hoare annotation was computed. [2018-11-10 12:17:13,413 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-11-10 12:17:13,413 INFO L421 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse4 (= 2 ~c_dr_st~0)) (.cse57 (= ~c_num_read~0 1)) (.cse52 (= ~c_num_read~0 0)) (.cse55 (= 1 ~p_num_write~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse58 (+ ~c_num_read~0 1)) (.cse13 (= |old(~p_dw_pc~0)| 1)) (.cse26 (= ~q_free~0 0)) (.cse50 (not (= ~c_dr_pc~0 1))) (.cse59 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse60 (+ |old(~c_num_read~0)| 1)) (.cse31 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse56 (not (= 0 ~c_dr_st~0))) (.cse23 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse24 (= 1 ~c_dr_pc~0)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (<= 1 ~q_free~0)) (.cse33 (<= ~c_num_read~0 ~p_num_write~0)) (.cse27 (= 2 ~p_dw_st~0)) (.cse28 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse34 (<= ~q_free~0 1)) (.cse35 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse19 (and .cse31 .cse22 .cse56 .cse23 .cse24 .cse25 .cse32 .cse33 .cse27 .cse28 .cse34 .cse35)) (.cse20 (< |old(~p_num_write~0)| .cse60)) (.cse30 (< .cse60 |old(~p_num_write~0)|)) (.cse45 (not .cse59)) (.cse47 (and .cse26 .cse50 .cse56 .cse59 .cse25 (= 2 ~q_read_ev~0))) (.cse53 (= 0 ~p_num_write~0)) (.cse41 (not (= 0 |old(~p_num_write~0)|))) (.cse37 (not .cse13)) (.cse14 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse15 (< |old(~q_free~0)| 1)) (.cse16 (< 1 |old(~q_free~0)|)) (.cse17 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse18 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse21 (<= .cse58 ~p_num_write~0)) (.cse36 (= 1 ~p_dw_pc~0)) (.cse49 (not (= 0 eval_~tmp___1~0))) (.cse29 (<= ~p_num_write~0 .cse58)) (.cse10 (and .cse22 .cse56 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (not .cse0)) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse43 (= ~p_dw_st~0 0)) (.cse39 (not (= |old(~p_dw_st~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (not (= ~q_read_ev~0 2))) (.cse44 (and .cse50 .cse23 .cse25 .cse52 .cse26 .cse27 .cse28 .cse55)) (.cse9 (not (= |old(~p_dw_st~0)| 2))) (.cse38 (< 0 |old(~q_req_up~0)|)) (.cse42 (and .cse26 .cse50 .cse56 .cse25)) (.cse5 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse48 (not (= 1 |old(~p_num_write~0)|))) (.cse40 (not (= 0 |old(~c_num_read~0)|))) (.cse46 (and .cse23 .cse4 .cse24 .cse25 .cse57 .cse32 .cse27 .cse34 .cse55 .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse9 .cse4) (or .cse10 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 .cse12 .cse13 .cse9) (or .cse6 .cse1 .cse11 .cse8 .cse9 .cse14 .cse5 .cse15 .cse7 .cse12 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse30 .cse13 .cse9 (and .cse31 .cse22 .cse23 .cse4 .cse24 .cse25 .cse32 .cse33 .cse27 .cse34 .cse35)) (or (and (and .cse31 .cse22 .cse4 .cse24 .cse25 .cse32 .cse33 .cse27 .cse28 .cse34 .cse35) .cse36) .cse37 (or .cse5 .cse14 .cse1 .cse15 .cse6 .cse11 .cse3 .cse9 .cse16 .cse17 .cse18 .cse38)) (or .cse20 .cse1 .cse6 .cse11 (and .cse21 .cse29) .cse30 .cse8 .cse5 .cse2 .cse7 .cse12 .cse39 .cse13) (or .cse4 .cse0 .cse1 .cse15 .cse3 .cse13 .cse40 .cse16 .cse41 .cse18) (or .cse20 .cse6 .cse1 .cse11 .cse30 .cse8 .cse37 .cse9 (= 0 ~q_write_ev~0) .cse38 (and .cse21 .cse22 .cse4 .cse24 .cse25 .cse36 .cse26 .cse27 .cse28 .cse29) .cse2 .cse3) (or .cse6 .cse1 .cse11 .cse9 .cse14 .cse5 .cse15 .cse4 .cse3 .cse7 .cse13 .cse16 .cse17 .cse18) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse39 .cse13 .cse4) (or .cse6 .cse1 .cse11 .cse19 .cse9 .cse14 .cse5 .cse15 .cse7 .cse12 .cse13 .cse16 .cse17 .cse18) (or .cse6 .cse1 .cse11 .cse8 .cse9 .cse14 .cse5 .cse15 .cse4 .cse3 .cse7 .cse16 .cse17 .cse18) (or .cse42 .cse0 .cse1 .cse15 .cse12 .cse39 .cse13 .cse40 .cse43 .cse16 .cse41 .cse18) (or .cse6 .cse1 .cse8 .cse44 .cse9 .cse45 .cse0 .cse2 .cse7 .cse46 .cse47 .cse48 .cse13 .cse40) (or (and .cse31 .cse22 .cse4 .cse24 .cse25 .cse36 .cse32 .cse33 .cse27 .cse34 .cse49 .cse35) (and .cse21 .cse22 .cse24 .cse25 .cse36 .cse26 .cse27 .cse28 .cse29) (or .cse20 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 .cse30 .cse8 .cse37 .cse9)) (let ((.cse51 (= 0 ~p_dw_st~0)) (.cse54 (= eval_~tmp___1~0 1))) (or (and .cse32 .cse50 .cse23 .cse51 .cse25 .cse52 .cse28 .cse34 .cse35 .cse53) .cse6 .cse38 (and .cse54 .cse4 .cse32 .cse23 .cse51 .cse25 .cse52 .cse28 .cse34 .cse35 .cse53) .cse0 .cse15 (and .cse4 .cse25 .cse36 .cse52 .cse26 .cse27 .cse49 .cse55) (and .cse50 .cse56 .cse23 .cse43 .cse25 .cse32 .cse52 .cse34 .cse35 .cse53) .cse13 .cse40 .cse16 (and .cse50 .cse54 .cse25 .cse36 .cse52 .cse26 .cse27 .cse55) .cse18 .cse1 .cse8 .cse41 .cse45 (and .cse4 .cse24 .cse25 .cse57 .cse36 .cse32 .cse27 .cse34 .cse49 .cse55 .cse35) .cse47 .cse39)) (or (and .cse50 .cse56 .cse23 .cse25 .cse32 .cse52 .cse34 .cse35 .cse53) .cse42 .cse0 .cse1 .cse15 .cse12 .cse13 .cse40 .cse16 .cse41 .cse18) (or (and (and .cse31 .cse22 .cse43 .cse4 .cse24 .cse25 .cse32 .cse33 .cse28 .cse34 .cse35) .cse36) (or .cse37 (or .cse6 .cse1 .cse11 .cse8 .cse14 .cse5 .cse15 .cse3 .cse7 .cse39 .cse16 .cse17 .cse18)) (and .cse21 .cse4 .cse24 .cse25 .cse36 .cse26 .cse27 .cse49 .cse29)) (or .cse42 .cse0 .cse1 .cse2 .cse12) (or .cse5 .cse1 .cse6 .cse11 .cse10 .cse2 .cse7 .cse12 .cse8 .cse9) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse4 .cse13 .cse9) (or .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 (and .cse22 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28) .cse12 (and .cse22 .cse56 .cse23 .cse43 .cse24 .cse25 .cse26 .cse28) .cse8 .cse39 .cse13) (or .cse1 .cse6 .cse8 .cse44 .cse9 .cse38 .cse42 .cse0 .cse5 .cse2 .cse48 .cse13 .cse40 .cse46)))) [2018-11-10 12:17:13,413 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-11-10 12:17:13,414 INFO L421 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse46 (+ |old(~c_num_read~0)| 1)) (.cse28 (= |old(~p_dw_pc~0)| 1)) (.cse40 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse18 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (<= 1 ~q_free~0)) (.cse21 (= ~c_num_read~0 0)) (.cse23 (<= ~q_free~0 1)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse42 (= ~q_free~0 0)) (.cse33 (not (= ~c_dr_pc~0 1))) (.cse41 (not (= 0 ~c_dr_st~0))) (.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse47 (= 2 ~q_read_ev~0)) (.cse48 (= ~q_read_ev~0 ~q_write_ev~0))) (let ((.cse22 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (not .cse48)) (.cse26 (and .cse42 .cse33 .cse41 .cse48 .cse20 .cse47)) (.cse31 (and .cse33 .cse40 .cse41 .cse18 .cse20 .cse47 .cse16 .cse21 (not (= ~p_dw_pc~0 1)) .cse23 .cse34 .cse48 .cse24)) (.cse10 (not .cse28)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse27 (not (= |old(~p_dw_st~0)| 0))) (.cse15 (= eval_~tmp___1~0 1)) (.cse17 (not (= 0 ~p_dw_st~0))) (.cse4 (= 2 ~c_dr_st~0)) (.cse19 (= 1 ~c_dr_pc~0)) (.cse43 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse25 (< |old(~q_free~0)| 1)) (.cse30 (< 1 |old(~q_free~0)|)) (.cse44 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse32 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse39 (not (= 1 |old(~p_num_write~0)|))) (.cse29 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (< 0 |old(~q_req_up~0)|)) (.cse45 (and .cse42 .cse33 .cse41 .cse20)) (.cse38 (= 0 |old(~c_dr_st~0)|)) (.cse5 (< |old(~p_num_write~0)| .cse46)) (.cse35 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse7 (not .cse0)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse36 (= 1 |old(~q_req_up~0)|)) (.cse8 (< .cse46 |old(~p_num_write~0)|)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse11 (not (= |old(~p_dw_st~0)| 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~q_write_ev~0) .cse12 .cse2 .cse3) (or .cse6 .cse1 .cse9 .cse13 .cse14 .cse12 (and .cse15 .cse4 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse0 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (and .cse15 .cse16 .cse17 .cse33 .cse18 .cse20 .cse21 .cse22 .cse23 .cse34 .cse24)) (or .cse5 .cse35 .cse1 .cse6 .cse7 .cse2 .cse36 .cse8 .cse28 .cse11) (or (let ((.cse37 (+ ~c_num_read~0 1))) (and (<= .cse37 ~p_num_write~0) (<= ~p_num_write~0 .cse37))) .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse35 .cse2 .cse36 .cse38 .cse27 .cse28) (or .cse35 .cse1 .cse6 .cse7 .cse2 .cse36 .cse38 .cse9 .cse11) (or .cse6 .cse1 .cse9 .cse11 .cse14 .cse2 .cse36 .cse26 .cse39 .cse28 .cse29) (or .cse35 .cse1 .cse6 .cse7 .cse2 .cse36 .cse38 .cse28 .cse11) (or .cse35 .cse1 .cse6 .cse2 .cse3 .cse36 .cse9 .cse4 .cse27 .cse28) (or (and .cse40 .cse41 .cse18 .cse19 .cse20 .cse42 .cse17 .cse22) .cse35 .cse1 .cse6 .cse7 .cse2 .cse36 .cse38 .cse9 .cse27 .cse28) (or .cse0 .cse1 .cse25 .cse3 .cse4 .cse28 .cse29 .cse30 .cse13 .cse32) (or .cse35 .cse43 .cse1 .cse25 .cse6 .cse7 .cse3 .cse11 .cse30 .cse44 .cse32 .cse12) (or .cse6 .cse1 .cse7 .cse11 .cse43 .cse35 .cse25 .cse36 .cse38 .cse28 .cse30 .cse44 .cse32) (or .cse45 .cse0 .cse1 .cse25 .cse38 .cse28 .cse29 (and .cse33 .cse41 .cse18 .cse20 .cse16 .cse21 .cse23 .cse24) .cse30 .cse13 .cse32) (or .cse1 .cse9 .cse13 .cse14 .cse0 .cse25 .cse38 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32) (or (or .cse10 (or .cse6 .cse1 .cse7 .cse9 .cse43 .cse35 .cse25 .cse3 .cse36 .cse27 .cse30 .cse44 .cse32)) (and .cse15 (and .cse17 .cse4 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse40 .cse18 .cse23 .cse19 .cse20 .cse16)))) (or .cse6 .cse1 .cse7 .cse9 .cse11 .cse43 .cse35 .cse25 .cse36 .cse38 .cse30 .cse44 .cse32) (or .cse45 .cse35 .cse1 .cse6 .cse2 .cse9 .cse39 .cse28 .cse11 .cse29 .cse12) (or .cse45 .cse0 .cse1 .cse2 .cse38) (or .cse5 .cse35 .cse1 .cse6 .cse7 .cse2 .cse36 .cse8 .cse9 .cse11)))) [2018-11-10 12:17:13,414 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-11-10 12:17:13,414 INFO L425 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-11-10 12:17:13,414 INFO L425 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-10 12:17:13,415 INFO L421 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse4 (= 2 ~c_dr_st~0)) (.cse57 (= ~c_num_read~0 1)) (.cse52 (= ~c_num_read~0 0)) (.cse55 (= 1 ~p_num_write~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse58 (+ ~c_num_read~0 1)) (.cse13 (= |old(~p_dw_pc~0)| 1)) (.cse26 (= ~q_free~0 0)) (.cse50 (not (= ~c_dr_pc~0 1))) (.cse59 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse60 (+ |old(~c_num_read~0)| 1)) (.cse31 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse56 (not (= 0 ~c_dr_st~0))) (.cse23 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse24 (= 1 ~c_dr_pc~0)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (<= 1 ~q_free~0)) (.cse33 (<= ~c_num_read~0 ~p_num_write~0)) (.cse27 (= 2 ~p_dw_st~0)) (.cse28 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse34 (<= ~q_free~0 1)) (.cse35 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse19 (and .cse31 .cse22 .cse56 .cse23 .cse24 .cse25 .cse32 .cse33 .cse27 .cse28 .cse34 .cse35)) (.cse20 (< |old(~p_num_write~0)| .cse60)) (.cse30 (< .cse60 |old(~p_num_write~0)|)) (.cse45 (not .cse59)) (.cse47 (and .cse26 .cse50 .cse56 .cse59 .cse25 (= 2 ~q_read_ev~0))) (.cse53 (= 0 ~p_num_write~0)) (.cse41 (not (= 0 |old(~p_num_write~0)|))) (.cse37 (not .cse13)) (.cse14 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse15 (< |old(~q_free~0)| 1)) (.cse16 (< 1 |old(~q_free~0)|)) (.cse17 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse18 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse21 (<= .cse58 ~p_num_write~0)) (.cse36 (= 1 ~p_dw_pc~0)) (.cse49 (not (= 0 eval_~tmp___1~0))) (.cse29 (<= ~p_num_write~0 .cse58)) (.cse10 (and .cse22 .cse56 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (not .cse0)) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse43 (= ~p_dw_st~0 0)) (.cse39 (not (= |old(~p_dw_st~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (not (= ~q_read_ev~0 2))) (.cse44 (and .cse50 .cse23 .cse25 .cse52 .cse26 .cse27 .cse28 .cse55)) (.cse9 (not (= |old(~p_dw_st~0)| 2))) (.cse38 (< 0 |old(~q_req_up~0)|)) (.cse42 (and .cse26 .cse50 .cse56 .cse25)) (.cse5 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse48 (not (= 1 |old(~p_num_write~0)|))) (.cse40 (not (= 0 |old(~c_num_read~0)|))) (.cse46 (and .cse23 .cse4 .cse24 .cse25 .cse57 .cse32 .cse27 .cse34 .cse55 .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse9 .cse4) (or .cse10 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 .cse12 .cse13 .cse9) (or .cse6 .cse1 .cse11 .cse8 .cse9 .cse14 .cse5 .cse15 .cse7 .cse12 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse30 .cse13 .cse9 (and .cse31 .cse22 .cse23 .cse4 .cse24 .cse25 .cse32 .cse33 .cse27 .cse34 .cse35)) (or (and (and .cse31 .cse22 .cse4 .cse24 .cse25 .cse32 .cse33 .cse27 .cse28 .cse34 .cse35) .cse36) .cse37 (or .cse5 .cse14 .cse1 .cse15 .cse6 .cse11 .cse3 .cse9 .cse16 .cse17 .cse18 .cse38)) (or .cse20 .cse1 .cse6 .cse11 (and .cse21 .cse29) .cse30 .cse8 .cse5 .cse2 .cse7 .cse12 .cse39 .cse13) (or .cse4 .cse0 .cse1 .cse15 .cse3 .cse13 .cse40 .cse16 .cse41 .cse18) (or .cse20 .cse6 .cse1 .cse11 .cse30 .cse8 .cse37 .cse9 (= 0 ~q_write_ev~0) .cse38 (and .cse21 .cse22 .cse4 .cse24 .cse25 .cse36 .cse26 .cse27 .cse28 .cse29) .cse2 .cse3) (or .cse6 .cse1 .cse11 .cse9 .cse14 .cse5 .cse15 .cse4 .cse3 .cse7 .cse13 .cse16 .cse17 .cse18) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse8 .cse39 .cse13 .cse4) (or .cse6 .cse1 .cse11 .cse19 .cse9 .cse14 .cse5 .cse15 .cse7 .cse12 .cse13 .cse16 .cse17 .cse18) (or .cse6 .cse1 .cse11 .cse8 .cse9 .cse14 .cse5 .cse15 .cse4 .cse3 .cse7 .cse16 .cse17 .cse18) (or .cse42 .cse0 .cse1 .cse15 .cse12 .cse39 .cse13 .cse40 .cse43 .cse16 .cse41 .cse18) (or .cse6 .cse1 .cse8 .cse44 .cse9 .cse45 .cse0 .cse2 .cse7 .cse46 .cse47 .cse48 .cse13 .cse40) (or (and .cse31 .cse22 .cse4 .cse24 .cse25 .cse36 .cse32 .cse33 .cse27 .cse34 .cse49 .cse35) (and .cse21 .cse22 .cse24 .cse25 .cse36 .cse26 .cse27 .cse28 .cse29) (or .cse20 .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 .cse30 .cse8 .cse37 .cse9)) (let ((.cse51 (= 0 ~p_dw_st~0)) (.cse54 (= eval_~tmp___1~0 1))) (or (and .cse32 .cse50 .cse23 .cse51 .cse25 .cse52 .cse28 .cse34 .cse35 .cse53) .cse6 .cse38 (and .cse54 .cse4 .cse32 .cse23 .cse51 .cse25 .cse52 .cse28 .cse34 .cse35 .cse53) .cse0 .cse15 (and .cse4 .cse25 .cse36 .cse52 .cse26 .cse27 .cse49 .cse55) (and .cse50 .cse56 .cse23 .cse43 .cse25 .cse32 .cse52 .cse34 .cse35 .cse53) .cse13 .cse40 .cse16 (and .cse50 .cse54 .cse25 .cse36 .cse52 .cse26 .cse27 .cse55) .cse18 .cse1 .cse8 .cse41 .cse45 (and .cse4 .cse24 .cse25 .cse57 .cse36 .cse32 .cse27 .cse34 .cse49 .cse55 .cse35) .cse47 .cse39)) (or (and .cse50 .cse56 .cse23 .cse25 .cse32 .cse52 .cse34 .cse35 .cse53) .cse42 .cse0 .cse1 .cse15 .cse12 .cse13 .cse40 .cse16 .cse41 .cse18) (or (and (and .cse31 .cse22 .cse43 .cse4 .cse24 .cse25 .cse32 .cse33 .cse28 .cse34 .cse35) .cse36) (or .cse37 (or .cse6 .cse1 .cse11 .cse8 .cse14 .cse5 .cse15 .cse3 .cse7 .cse39 .cse16 .cse17 .cse18)) (and .cse21 .cse4 .cse24 .cse25 .cse36 .cse26 .cse27 .cse49 .cse29)) (or .cse42 .cse0 .cse1 .cse2 .cse12) (or .cse5 .cse1 .cse6 .cse11 .cse10 .cse2 .cse7 .cse12 .cse8 .cse9) (or .cse5 .cse1 .cse6 .cse2 .cse3 .cse7 .cse4 .cse13 .cse9) (or .cse5 .cse1 .cse6 .cse11 .cse2 .cse7 (and .cse22 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28) .cse12 (and .cse22 .cse56 .cse23 .cse43 .cse24 .cse25 .cse26 .cse28) .cse8 .cse39 .cse13) (or .cse1 .cse6 .cse8 .cse44 .cse9 .cse38 .cse42 .cse0 .cse5 .cse2 .cse48 .cse13 .cse40 .cse46)))) [2018-11-10 12:17:13,415 INFO L421 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse13 (= 1 |old(~c_dr_pc~0)|)) (.cse16 (= |old(~p_dw_pc~0)| 1)) (.cse42 (+ ~c_num_read~0 1)) (.cse43 (+ |old(~c_num_read~0)| 1)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 0 ~c_dr_st~0))) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_num_read~0 0)) (.cse21 (= ~q_free~0 0)) (.cse22 (= 2 ~p_dw_st~0)) (.cse8 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse23 (= 1 ~p_num_write~0))) (let ((.cse12 (< 0 |old(~q_req_up~0)|)) (.cse2 (= eval_~tmp___1~0 1)) (.cse20 (= 1 ~p_dw_pc~0)) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse32 (= 0 |old(~c_dr_st~0)|)) (.cse36 (and .cse4 .cse3 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse23)) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse37 (not (= 1 |old(~p_num_write~0)|))) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse24 (< |old(~p_num_write~0)| .cse43)) (.cse28 (not (= |old(~q_free~0)| 0))) (.cse25 (< .cse43 |old(~p_num_write~0)|)) (.cse27 (not (= |old(~p_dw_st~0)| 2))) (.cse38 (<= .cse42 ~p_num_write~0)) (.cse39 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse40 (= 1 ~c_dr_pc~0)) (.cse41 (<= ~p_num_write~0 .cse42)) (.cse26 (not .cse16)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse34 (not .cse13)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse33 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse30 (< ~q_write_ev~0 2)) (.cse14 (< |old(~q_free~0)| 1)) (.cse29 (not (= 2 |old(~c_dr_st~0)|))) (.cse31 (= 1 |old(~q_req_up~0)|)) (.cse15 (not (= |old(~p_dw_st~0)| 0))) (.cse18 (< 1 |old(~q_free~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse19 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (<= 1 ~q_free~0) .cse4 .cse5 (= 0 ~p_dw_st~0) .cse6 .cse7 .cse8 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse4 .cse2 .cse3 .cse6 .cse20 .cse7 .cse21 .cse22 .cse23)) (or .cse24 .cse0 .cse1 .cse25 .cse9 .cse26 .cse27 (= 0 ~q_write_ev~0) .cse12 .cse28 .cse29) (or .cse30 .cse1 .cse0 .cse28 .cse31 .cse32 .cse9 .cse15 .cse16) (or .cse30 .cse33 .cse1 .cse14 .cse0 .cse34 .cse29 .cse27 .cse18 .cse35 .cse19 .cse12) (or .cse0 .cse1 .cse34 .cse27 .cse33 .cse30 .cse14 .cse31 .cse32 .cse16 .cse18 .cse35 .cse19) (or .cse30 .cse1 .cse0 .cse28 .cse31 .cse32 .cse9 .cse27) (or .cse13 .cse1 .cse28 .cse32) (or .cse13 .cse30 .cse1 .cse0 .cse28 .cse9 .cse36 .cse37 .cse16 .cse27 .cse17 .cse12) (or (or .cse24 .cse30 .cse1 .cse0 .cse34 .cse28 .cse31 .cse25 .cse9 .cse26 .cse27) (and .cse2 (and .cse38 .cse39 .cse3 .cse40 .cse6 .cse21 .cse22 .cse8 .cse41) .cse20)) (or .cse0 .cse1 .cse34 .cse9 .cse27 .cse33 .cse30 .cse14 .cse31 .cse32 .cse18 .cse35 .cse19) (or .cse13 .cse1 .cse14 .cse32 .cse16 .cse17 .cse18 .cse10 .cse19) (or .cse30 .cse1 .cse0 .cse28 .cse31 .cse32 .cse16 .cse27) (or .cse0 .cse1 .cse36 .cse9 .cse27 .cse11 .cse13 .cse28 .cse31 .cse37 .cse16 .cse17) (or .cse24 .cse30 .cse1 .cse0 .cse34 .cse28 .cse31 .cse25 .cse16 .cse27 (and .cse38 .cse39 .cse3 .cse5 .cse40 .cse6 .cse21 .cse22 .cse8 .cse41)) (or .cse26 (or .cse0 .cse1 .cse34 .cse9 .cse33 .cse30 .cse14 .cse29 .cse31 .cse15 .cse18 .cse35 .cse19))))) [2018-11-10 12:17:13,416 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-10 12:17:13,416 INFO L428 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-11-10 12:17:13,416 INFO L425 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-10 12:17:13,417 INFO L428 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-11-10 12:17:13,417 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-11-10 12:17:13,417 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-11-10 12:17:13,420 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-11-10 12:17:13,420 INFO L428 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-11-10 12:17:13,420 INFO L421 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse19 (= 1 ~c_dr_pc~0))) (let ((.cse10 (not .cse19)) (.cse24 (not (= ~q_read_ev~0 2))) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse22 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse7 (< ~q_free~0 1)) (.cse11 (< 1 ~q_free~0)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse6 (< ~q_write_ev~0 2)) (.cse15 (= 0 ~c_dr_st~0)) (.cse27 (< ~p_num_write~0 .cse29)) (.cse28 (< .cse29 ~p_num_write~0)) (.cse3 (not (= 1 ~p_dw_pc~0))) (.cse4 (< 0 ~q_req_up~0)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse23 (or .cse10 .cse24)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse14 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse16 (not (= ~p_dw_st~0 2))) (.cse25 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse18 (not (= ~q_free~0 0))) (.cse17 (= 1 ~q_req_up~0)) (.cse26 (not (= 1 ~p_num_write~0))) (.cse20 (= ~p_dw_pc~0 1)) (.cse21 (not (= 0 ~c_num_read~0)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse14 (or .cse6 (or .cse1 (or .cse5 .cse2 .cse7 .cse15 .cse10 .cse11 .cse12 .cse13) .cse16) .cse17) .cse0) (or .cse2 .cse14 .cse18 .cse15 .cse19) (or .cse2 .cse7 .cse15 .cse20 .cse21 .cse14 .cse11 .cse22 .cse19 .cse13) (or .cse6 .cse2 .cse1 .cse18 .cse17 .cse15 .cse23 .cse9 .cse20 .cse14) (or .cse14 .cse1 .cse2 .cse24 .cse22 .cse25 .cse4 .cse19 .cse7 .cse9 .cse20 .cse21 .cse11 .cse13) (or .cse1 .cse2 .cse14 .cse16 .cse5 .cse6 .cse7 .cse17 .cse15 .cse10 .cse20 .cse11 .cse12 .cse13) (or .cse6 .cse2 .cse1 .cse18 .cse14 .cse26 .cse20 .cse16 .cse21 .cse24 .cse4) (or .cse6 .cse2 .cse1 .cse18 .cse17 .cse15 .cse20 .cse16 .cse14) (or .cse27 .cse6 .cse2 .cse1 .cse18 .cse17 .cse28 .cse14 .cse10 .cse20 .cse16) (or .cse1 .cse2 .cse16 .cse5 .cse6 .cse7 .cse17 .cse14 .cse23 .cse15 .cse11 .cse12 .cse13) (or (or .cse6 (or .cse1 (or .cse5 .cse2 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) .cse16) .cse4) .cse14) (or .cse6 .cse2 .cse1 .cse18 .cse17 .cse15 .cse23 .cse14 .cse16) (or .cse27 .cse1 .cse2 .cse28 .cse16 (= 0 ~q_write_ev~0) .cse3 .cse4 (= 1 ~q_write_ev~0) .cse18 .cse8 .cse23 .cse14) (or .cse1 .cse2 .cse14 .cse24 .cse16 .cse25 .cse18 .cse17 .cse26 .cse20 .cse21))))) [2018-11-10 12:17:13,420 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-11-10 12:17:13,420 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-10 12:17:13,420 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-11-10 12:17:13,420 INFO L425 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-11-10 12:17:13,421 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-11-10 12:17:13,421 INFO L421 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse12 (= 1 ~c_dr_pc~0)) (.cse33 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse19 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse34 (+ ~c_num_read~0 1))) (let ((.cse0 (< ~p_num_write~0 .cse34)) (.cse26 (and .cse19 .cse32 .cse21)) (.cse8 (< .cse34 ~p_num_write~0)) (.cse27 (not .cse9)) (.cse17 (< 0 |old(~q_req_up~0)|)) (.cse20 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse16 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse29 (not (= 1 ~p_num_write~0))) (.cse13 (and .cse33 .cse32)) (.cse23 (not (= 0 ~c_num_read~0))) (.cse15 (not (= 0 ~p_num_write~0))) (.cse5 (not (= ~q_free~0 0))) (.cse22 (not (= ~p_dw_st~0 0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse6 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 ~c_dr_st~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse12)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse7 (and .cse33 .cse19 .cse32)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse30 (< ~p_num_write~0 ~c_num_read~0)) (.cse18 (< ~q_free~0 1)) (.cse28 (not (= 2 ~c_dr_st~0))) (.cse24 (< 1 ~q_free~0)) (.cse31 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse7 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse9 .cse10) (or .cse12 .cse2 .cse5 .cse13 .cse11) (or .cse3 .cse2 .cse14 .cse15 .cse16 .cse17 .cse12 .cse18 (and .cse19 .cse20 .cse21) .cse22 .cse9 .cse23 .cse24 .cse25) (or .cse0 .cse2 .cse3 .cse4 .cse8 .cse26 .cse14 .cse27 .cse10 .cse1 .cse5 .cse28) (or .cse0 .cse3 .cse2 .cse4 .cse26 .cse8 .cse14 .cse27 .cse10 (= 0 |old(~q_write_ev~0)|) .cse17 .cse5 .cse28) (or .cse1 .cse2 .cse3 .cse5 .cse14 .cse7 .cse29 .cse9 .cse10 .cse23 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6 .cse11 .cse14 .cse10) (or (and .cse19 (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse21) (or .cse1 .cse30 .cse2 .cse18 .cse3 .cse4 .cse28 .cse10 .cse24 .cse31 .cse25 .cse17)) (or (and (and .cse19 .cse32) .cse21) (or .cse1 .cse30 .cse2 .cse18 .cse3 .cse4 .cse28 .cse14 .cse10 .cse24 .cse31 .cse25)) (or .cse3 .cse2 .cse14 (and .cse19 .cse32 .cse20) .cse10 .cse16 .cse5 .cse6 .cse29 .cse9 .cse23) (or .cse13 .cse12 .cse2 .cse18 .cse11 .cse9 .cse23 .cse24 .cse15 .cse25) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse14 .cse22 .cse9) (or .cse3 .cse2 .cse4 .cse7 .cse10 .cse30 .cse1 .cse18 .cse6 .cse11 .cse9 .cse24 .cse31 .cse25) (or .cse3 .cse2 .cse4 .cse14 .cse10 .cse30 .cse1 .cse18 .cse6 .cse11 .cse24 .cse31 .cse25 .cse7) (or .cse2 .cse3 .cse4 .cse10 .cse7 .cse1 .cse30 .cse18 .cse28 .cse9 .cse24 .cse31 .cse25)))) [2018-11-10 12:17:13,424 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-11-10 12:17:13,424 INFO L421 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse28 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse31 (+ ~c_num_read~0 1)) (.cse30 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse17 (= ~p_dw_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse3 (and .cse30 .cse29)) (.cse20 (not (= 0 ~p_num_write~0))) (.cse5 (< ~p_num_write~0 .cse31)) (.cse8 (< .cse31 ~p_num_write~0)) (.cse22 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse14 (and .cse30 .cse28 .cse29)) (.cse13 (not (= 2 ~c_dr_st~0))) (.cse27 (not (= 1 ~p_num_write~0))) (.cse18 (not (= 0 ~c_num_read~0))) (.cse12 (< 0 |old(~q_req_up~0)|)) (.cse2 (not (= ~q_free~0 0))) (.cse9 (not (= |old(~q_read_ev~0)| 2))) (.cse23 (not (= ~p_dw_st~0 0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not .cse0)) (.cse11 (not (= ~p_dw_st~0 2))) (.cse25 (< ~p_num_write~0 ~c_num_read~0)) (.cse15 (< |old(~q_write_ev~0)| 2)) (.cse16 (< ~q_free~0 1)) (.cse24 (= 1 |old(~q_req_up~0)|)) (.cse4 (= 0 ~c_dr_st~0)) (.cse19 (< 1 ~q_free~0)) (.cse26 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |old(~q_write_ev~0)|) .cse12 .cse2 .cse13) (or .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse2 .cse13) (or .cse0 .cse1 .cse16 .cse4 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse6 .cse1 .cse9 .cse20 .cse22 .cse12 .cse0 .cse16 .cse23 .cse17 .cse18 .cse19 .cse21) (or .cse5 .cse15 .cse1 .cse6 .cse7 .cse2 .cse24 .cse8 .cse17 .cse11) (or .cse6 .cse1 .cse7 .cse9 .cse11 .cse25 .cse15 .cse16 .cse24 .cse4 .cse19 .cse26 .cse21) (or .cse6 .cse1 .cse9 .cse11 .cse22 .cse2 .cse24 .cse27 .cse17 .cse18) (or .cse1 .cse6 .cse7 .cse11 .cse15 .cse25 .cse16 .cse13 .cse14 .cse17 .cse19 .cse26 .cse21) (or .cse15 .cse1 .cse6 .cse7 .cse2 .cse24 .cse4 .cse9 .cse11) (or .cse15 .cse25 .cse1 .cse16 .cse6 .cse7 .cse13 .cse11 .cse19 .cse26 .cse21 .cse12) (or (and (and .cse28 .cse29) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (or .cse15 .cse25 .cse1 .cse16 .cse6 .cse7 .cse13 .cse9 .cse11 .cse19 .cse26 .cse21)) (or .cse15 .cse1 .cse6 .cse2 .cse9 .cse27 .cse17 .cse11 .cse18 .cse12) (or .cse15 .cse1 .cse6 .cse7 .cse2 .cse24 .cse4 .cse17 .cse11) (or .cse15 .cse1 .cse6 .cse7 .cse2 .cse24 .cse4 .cse9 .cse23 .cse17) (or .cse6 .cse1 .cse7 .cse11 .cse25 .cse15 .cse16 .cse24 .cse4 .cse17 .cse19 .cse26 .cse21)))) [2018-11-10 12:17:13,426 INFO L425 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-11-10 12:17:13,426 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse27 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse19 (= 1 ~c_dr_pc~0)) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse24 (not (= ~p_dw_st~0 0))) (.cse20 (< ~p_num_write~0 .cse29)) (.cse21 (< .cse29 ~p_num_write~0)) (.cse22 (not (= 0 ~p_num_write~0))) (.cse26 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse28 (not (= 2 ~c_dr_st~0))) (.cse18 (< 0 ~q_req_up~0)) (.cse2 (not .cse19)) (.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) .cse27)) (.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))) (.cse23 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse25 (= ~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 .cse19 .cse1 .cse14 .cse3 .cse9) (or .cse3 .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse10 .cse4) (or .cse20 .cse6 .cse1 .cse0 .cse2 .cse14 .cse8 .cse3 .cse21 .cse10 .cse4) (or .cse0 .cse1 .cse15 .cse22 .cse23 .cse18 .cse19 .cse7 .cse24 .cse10 .cse17 .cse11 (and .cse25 .cse26) .cse13) (or .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse3 .cse15 .cse24 .cse10) (or .cse20 .cse1 .cse0 .cse21 .cse15 (not .cse10) .cse4 .cse18 (and .cse27 .cse26) .cse14 .cse28) (or .cse6 .cse1 .cse0 .cse3 .cse14 .cse8 .cse9 .cse15 .cse4) (or .cse3 .cse19 .cse1 .cse7 .cse9 .cse10 .cse17 .cse11 .cse22 .cse13) (or (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse26) (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse28 .cse4 .cse11 .cse12 .cse13 .cse18)) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse3) (or .cse0 .cse1 .cse15 .cse4 .cse23 (and .cse27 .cse25) .cse14 .cse8 .cse16 .cse10 .cse17)))) [2018-11-10 12:17:13,427 INFO L425 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-11-10 12:17:13,428 INFO L425 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-11-10 12:17:13,428 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-11-10 12:17:13,428 INFO L421 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse22 (+ ~c_num_read~0 1))) (let ((.cse6 (= 1 ~p_num_write~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse21 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse10 (not (= ~q_req_up~0 1))) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= 1 ~c_dr_pc~0)) (.cse13 (<= 1 ~q_free~0)) (.cse14 (<= ~c_num_read~0 ~p_num_write~0)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse15 (<= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (<= .cse22 ~p_num_write~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse18 (= 2 ~c_dr_st~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse19 (= 1 ~p_dw_pc~0)) (.cse4 (= ~q_free~0 0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse20 (<= ~p_num_write~0 .cse22))) (or (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse4 .cse1 .cse9 .cse2 .cse5 .cse10 .cse7) (and .cse7 .cse8 .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 (= ~q_read_ev~0 ~q_write_ev~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse11 .cse9 .cse2 .cse12 .cse7 .cse13 .cse14 .cse1 .cse5 .cse15 .cse16 .cse10) (< 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 .cse0 .cse17 .cse18 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse19 .cse4 .cse1 .cse20) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse11 .cse0 .cse2 .cse18 .cse12 .cse7 .cse13 .cse14 .cse1 .cse15 .cse16) (and .cse1 .cse2 .cse10 (and .cse4 .cse9 .cse7 .cse8)) (and .cse9 .cse2 (= 0 ~p_dw_st~0) .cse7 .cse8 .cse4 .cse5 .cse10) (< |old(~q_free~0)| 1) (and .cse4 .cse21 .cse9 .cse7) (and .cse1 .cse2 (and .cse14 .cse11 .cse15 .cse16 .cse18 .cse12 .cse7 .cse8 .cse13)) (and .cse1 .cse2 (and .cse14 .cse11 .cse9 .cse15 .cse16 .cse12 .cse7 .cse8 .cse13) .cse10) (and .cse3 .cse21 .cse9 .cse5 .cse15 .cse16 .cse7 .cse13 (= 0 ~p_num_write~0)) (and .cse4 .cse17 .cse1 .cse2 .cse5 .cse20 .cse10 .cse12 .cse7) (not (= 0 |old(~p_num_write~0)|)) (and .cse11 .cse2 .cse18 .cse12 .cse7 .cse13 .cse14 .cse1 .cse5 .cse15 .cse16) (and .cse17 .cse2 .cse18 .cse7 .cse8 .cse19 .cse4 .cse1 .cse20) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-10 12:17:13,432 INFO L425 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-10 12:17:13,433 INFO L421 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse25 (+ ~c_num_read~0 1))) (let ((.cse6 (= 1 ~p_num_write~0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse20 (= 2 ~c_dr_st~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse14 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse3 (= ~c_num_read~0 0)) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse18 (<= ~q_free~0 1)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= 1 ~q_free~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse4 (= ~q_free~0 0)) (.cse11 (<= .cse25 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse13 (<= ~p_num_write~0 .cse25)) (.cse10 (not (= ~q_req_up~0 1))) (.cse12 (= 1 ~c_dr_pc~0)) (.cse7 (= ~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 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse4 .cse1 .cse9 .cse2 .cse5 .cse10 .cse7) (and .cse11 .cse2 .cse12 .cse7 .cse8 .cse4 .cse1 .cse13 .cse10) (and .cse7 .cse8 .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 .cse14) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse15 .cse9 .cse2 .cse12 .cse7 .cse16 .cse17 .cse1 .cse5 .cse18 .cse19 .cse10) (< 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 .cse0 .cse11 .cse20 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse21 .cse4 .cse1 .cse13) (not (= |old(~q_read_ev~0)| 2)) (and (and .cse2 .cse10 (and .cse17 .cse15 .cse18 .cse19 (= ~p_dw_st~0 0) .cse20 .cse12 .cse7 .cse8 .cse16)) .cse21) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse15 .cse0 .cse2 .cse20 .cse12 .cse7 .cse16 .cse17 .cse1 .cse18 .cse19) (and .cse1 .cse2 .cse10 (and .cse4 .cse9 .cse7 .cse8)) (and .cse9 .cse2 .cse22 .cse7 .cse8 .cse4 .cse5 .cse10) (and .cse16 .cse23 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse22 .cse7 .cse3 (= |old(~q_req_up~0)| ~q_req_up~0) .cse18 .cse19 .cse14 .cse24) (< |old(~q_free~0)| 1) (and .cse4 .cse23 .cse9 .cse7) (and .cse1 .cse2 (and .cse17 .cse15 .cse9 .cse18 .cse19 .cse12 .cse7 .cse8 .cse16) .cse10) (and .cse3 .cse23 .cse9 .cse5 .cse18 .cse19 .cse7 .cse16 .cse24) (and .cse4 .cse11 .cse1 .cse2 .cse5 .cse13 .cse10 .cse12 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-10 12:17:13,433 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-10 12:17:13,434 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-11-10 12:17:13,434 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 431) no Hoare annotation was computed. [2018-11-10 12:17:13,434 INFO L421 ceAbstractionStarter]: At program point L409-2(lines 406 431) the Hoare annotation is: (let ((.cse25 (+ ~c_num_read~0 1))) (let ((.cse6 (= 1 ~p_num_write~0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse20 (= 2 ~c_dr_st~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse14 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse3 (= ~c_num_read~0 0)) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse18 (<= ~q_free~0 1)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= 1 ~q_free~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse4 (= ~q_free~0 0)) (.cse11 (<= .cse25 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse13 (<= ~p_num_write~0 .cse25)) (.cse10 (not (= ~q_req_up~0 1))) (.cse12 (= 1 ~c_dr_pc~0)) (.cse7 (= ~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 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse4 .cse1 .cse9 .cse2 .cse5 .cse10 .cse7) (and .cse11 .cse2 .cse12 .cse7 .cse8 .cse4 .cse1 .cse13 .cse10) (and .cse7 .cse8 .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 .cse14) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse15 .cse9 .cse2 .cse12 .cse7 .cse16 .cse17 .cse1 .cse5 .cse18 .cse19 .cse10) (< 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 .cse0 .cse11 .cse20 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse21 .cse4 .cse1 .cse13) (not (= |old(~q_read_ev~0)| 2)) (and (and .cse2 .cse10 (and .cse17 .cse15 .cse18 .cse19 (= ~p_dw_st~0 0) .cse20 .cse12 .cse7 .cse8 .cse16)) .cse21) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse15 .cse0 .cse2 .cse20 .cse12 .cse7 .cse16 .cse17 .cse1 .cse18 .cse19) (and .cse1 .cse2 .cse10 (and .cse4 .cse9 .cse7 .cse8)) (and .cse9 .cse2 .cse22 .cse7 .cse8 .cse4 .cse5 .cse10) (and .cse16 .cse23 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse22 .cse7 .cse3 (= |old(~q_req_up~0)| ~q_req_up~0) .cse18 .cse19 .cse14 .cse24) (< |old(~q_free~0)| 1) (and .cse4 .cse23 .cse9 .cse7) (and .cse1 .cse2 (and .cse17 .cse15 .cse9 .cse18 .cse19 .cse12 .cse7 .cse8 .cse16) .cse10) (and .cse3 .cse23 .cse9 .cse5 .cse18 .cse19 .cse7 .cse16 .cse24) (and .cse4 .cse11 .cse1 .cse2 .cse5 .cse13 .cse10 .cse12 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-10 12:17:13,435 INFO L421 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse4 (= ~c_num_read~0 0)) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse0 (<= 1 ~q_free~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 .cse4 .cse1 .cse2 .cse5 .cse6 (= 2 ~c_dr_st~0) .cse3 .cse7 .cse0) (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-11-10 12:17:13,436 INFO L421 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 1 ~q_free~0)) (.cse0 (= ~c_num_read~0 0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 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 .cse3 .cse4 (= 2 ~c_dr_st~0) .cse5 .cse6 .cse7) (and .cse1 .cse2 (= ~p_dw_st~0 0) .cse5 .cse7 .cse0 (= |old(~q_req_up~0)| ~q_req_up~0) .cse3 .cse4 (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse6) (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-11-10 12:17:13,437 INFO L428 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-11-10 12:17:13,437 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-11-10 12:17:13,437 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-10 12:17:13,437 INFO L421 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse19 (= 2 ~c_dr_st~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 1)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (<= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 1 ~q_free~0)) (.cse1 (<= .cse23 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 .cse23)) (.cse2 (= 1 ~c_dr_pc~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse20 (= ~c_num_read~0 0)) (.cse22 (= 1 ~p_num_write~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse4 (= 2 ~q_read_ev~0)) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse17 (not (= ~q_req_up~0 1))) (.cse6 (= ~q_free~0 0)) (.cse21 (not (= ~c_dr_pc~0 1))) (.cse10 (not (= 0 ~c_dr_st~0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0))) (or (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 1 ~q_write_ev~0)) (and .cse9 .cse10 .cse11 .cse2 .cse3 .cse12 .cse13 .cse7 .cse14 .cse15 .cse16 .cse17) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse18 (and .cse9 .cse10 .cse11 .cse2 .cse3 .cse12 .cse13 .cse7 .cse15 .cse16 .cse17)) (and .cse0 .cse1 .cse19 (not (= 0 ~q_write_ev~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse11 .cse19 .cse2 .cse3 .cse12 .cse13 .cse7 .cse15 .cse16) (and (and (and .cse9 .cse11 (= ~p_dw_st~0 0) .cse19 .cse2 .cse3 .cse12 .cse13 .cse15 .cse16 .cse17) .cse5) .cse18) (< |old(~q_free~0)| 1) (and .cse7 .cse11 (and .cse13 .cse9 .cse10 .cse15 .cse16 .cse2 .cse3 .cse4 .cse12) .cse17) (and .cse20 .cse21 .cse10 .cse14 .cse15 .cse16 .cse3 .cse12 (= 0 ~p_num_write~0)) (and .cse6 .cse1 .cse7 .cse11 .cse14 .cse8 .cse17 .cse2 .cse3) (not (= |old(~p_dw_st~0)| 0)) (not (= ~p_dw_i~0 1)) (< 0 |old(~q_req_up~0)|) (and .cse0 .cse7 .cse11 (and .cse20 .cse6 .cse14 .cse22 .cse3 .cse4)) (and .cse6 .cse7 .cse10 .cse11 .cse14 .cse17 .cse3) (and .cse3 .cse4 .cse20 .cse6 .cse7 .cse14 .cse22 .cse17 (= ~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)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse7 .cse11 .cse17 (and .cse6 .cse10 .cse3 .cse4)) (and .cse10 .cse11 (= 0 ~p_dw_st~0) .cse3 .cse4 .cse6 .cse14 .cse17) (and .cse6 .cse21 .cse10 .cse3) (not (= 0 |old(~p_num_write~0)|))))) [2018-11-10 12:17:13,437 INFO L421 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-11-10 12:17:13,438 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-10 12:17:13,439 INFO L421 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse4 (= ~c_num_read~0 0)) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse0 (<= 1 ~q_free~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 .cse4 .cse1 .cse2 .cse5 .cse6 (= 2 ~c_dr_st~0) .cse3 .cse7 .cse0) (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-11-10 12:17:13,439 INFO L421 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-11-10 12:17:13,439 INFO L421 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-11-10 12:17:13,439 INFO L421 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse22 (+ ~c_num_read~0 1))) (let ((.cse6 (= 1 ~p_num_write~0)) (.cse20 (= 1 ~p_dw_pc~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse3 (= ~c_num_read~0 0)) (.cse21 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse17 (<= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= 1 ~q_free~0)) (.cse4 (= ~q_free~0 0)) (.cse11 (<= .cse22 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse13 (<= ~p_num_write~0 .cse22)) (.cse10 (not (= ~q_req_up~0 1))) (.cse12 (= 1 ~c_dr_pc~0)) (.cse7 (= ~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 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse4 .cse1 .cse9 .cse2 .cse5 .cse10 .cse7) (and .cse11 .cse2 .cse12 .cse7 .cse8 .cse4 .cse1 .cse13 .cse10) (and .cse7 .cse8 .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 (= ~q_read_ev~0 ~q_write_ev~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse14 .cse9 .cse2 .cse12 .cse7 .cse15 .cse16 .cse1 .cse5 .cse17 .cse18 .cse10) (< 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 .cse0 .cse11 .cse19 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 .cse20 .cse4 .cse1 .cse13) (not (= |old(~q_read_ev~0)| 2)) (and (and .cse2 .cse10 (and .cse16 .cse14 .cse17 .cse18 (= ~p_dw_st~0 0) .cse19 .cse12 .cse7 .cse8 .cse15)) .cse20) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse14 .cse0 .cse2 .cse19 .cse12 .cse7 .cse15 .cse16 .cse1 .cse17 .cse18) (and .cse1 .cse2 .cse10 (and .cse4 .cse9 .cse7 .cse8)) (and .cse9 .cse2 (= 0 ~p_dw_st~0) .cse7 .cse8 .cse4 .cse5 .cse10) (< |old(~q_free~0)| 1) (and .cse4 .cse21 .cse9 .cse7) (and .cse1 .cse2 (and .cse16 .cse14 .cse9 .cse17 .cse18 .cse12 .cse7 .cse8 .cse15) .cse10) (and .cse3 .cse21 .cse9 .cse5 .cse17 .cse18 .cse7 .cse15 (= 0 ~p_num_write~0)) (and .cse4 .cse11 .cse1 .cse2 .cse5 .cse13 .cse10 .cse12 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-10 12:17:13,440 INFO L421 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse6 (= 1 ~p_num_write~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse17 (= 2 ~c_dr_st~0)) (.cse14 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse3 (= ~c_num_read~0 0)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse15 (<= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= 1 ~q_free~0)) (.cse4 (= ~q_free~0 0)) (.cse18 (<= .cse21 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse19 (<= ~p_num_write~0 .cse21)) (.cse10 (not (= ~q_req_up~0 1))) (.cse12 (= 1 ~c_dr_pc~0)) (.cse7 (= ~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 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse4 .cse1 .cse9 .cse2 .cse5 .cse10 .cse7) (and .cse7 .cse8 .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 (= ~q_read_ev~0 ~q_write_ev~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse11 .cse9 .cse2 .cse12 .cse7 .cse13 .cse14 .cse1 .cse5 .cse15 .cse16 .cse10) (< 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)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse11 .cse0 .cse2 .cse17 .cse12 .cse7 .cse13 .cse14 .cse1 .cse15 .cse16) (and .cse1 .cse2 .cse10 (and .cse4 .cse9 .cse7 .cse8)) (and .cse9 .cse2 (= 0 ~p_dw_st~0) .cse7 .cse8 .cse4 .cse5 .cse10) (and .cse0 .cse18 .cse17 .cse7 .cse8 (= 1 ~p_dw_pc~0) .cse4 .cse1 .cse19) (< |old(~q_free~0)| 1) (and .cse4 .cse20 .cse9 .cse7) (and .cse1 .cse2 (and .cse14 .cse11 .cse9 .cse15 .cse16 .cse12 .cse7 .cse8 .cse13) .cse10) (and .cse3 .cse20 .cse9 .cse5 .cse15 .cse16 .cse7 .cse13 (= 0 ~p_num_write~0)) (and .cse4 .cse18 .cse1 .cse2 .cse5 .cse19 .cse10 .cse12 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-10 12:17:13,442 INFO L421 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse6 (= 1 ~p_num_write~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse18 (= 2 ~c_dr_st~0)) (.cse14 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse3 (= ~c_num_read~0 0)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse15 (<= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= 1 ~q_free~0)) (.cse4 (= ~q_free~0 0)) (.cse17 (<= .cse21 ~p_num_write~0)) (.cse1 (= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse19 (<= ~p_num_write~0 .cse21)) (.cse10 (not (= ~q_req_up~0 1))) (.cse12 (= 1 ~c_dr_pc~0)) (.cse7 (= ~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 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse4 .cse1 .cse9 .cse2 .cse5 .cse10 .cse7) (and .cse7 .cse8 .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 (= ~q_read_ev~0 ~q_write_ev~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse11 .cse9 .cse2 .cse12 .cse7 .cse13 .cse14 .cse1 .cse5 .cse15 .cse16 .cse10) (< 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 .cse0 .cse17 .cse18 (not (= 0 ~q_write_ev~0)) .cse7 .cse8 (= 1 ~p_dw_pc~0) .cse4 .cse1 .cse19) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse11 .cse0 .cse2 .cse18 .cse12 .cse7 .cse13 .cse14 .cse1 .cse15 .cse16) (and .cse1 .cse2 .cse10 (and .cse4 .cse9 .cse7 .cse8)) (and .cse9 .cse2 (= 0 ~p_dw_st~0) .cse7 .cse8 .cse4 .cse5 .cse10) (< |old(~q_free~0)| 1) (and .cse4 .cse20 .cse9 .cse7) (and .cse1 .cse2 (and .cse14 .cse11 .cse9 .cse15 .cse16 .cse12 .cse7 .cse8 .cse13) .cse10) (and .cse3 .cse20 .cse9 .cse5 .cse15 .cse16 .cse7 .cse13 (= 0 ~p_num_write~0)) (and .cse4 .cse17 .cse1 .cse2 .cse5 .cse19 .cse10 .cse12 .cse7) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-10 12:17:13,442 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:17:13,442 INFO L421 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-11-10 12:17:13,442 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:17:13,442 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:17:13,443 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-11-10 12:17:13,443 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-11-10 12:17:13,443 INFO L425 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-11-10 12:17:13,443 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-10 12:17:13,443 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-10 12:17:13,443 INFO L428 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-11-10 12:17:13,443 INFO L421 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse26 (+ ~c_num_read~0 1)) (.cse21 (= 1 ~c_dr_pc~0))) (let ((.cse5 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse20 (not (= 0 ~p_num_write~0))) (.cse8 (not (= 1 ~p_num_write~0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse12 (< ~p_num_write~0 ~c_num_read~0)) (.cse13 (< ~q_free~0 1)) (.cse16 (< 1 ~q_free~0)) (.cse17 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (= ~p_dw_st~0 0))) (.cse11 (< ~q_write_ev~0 2)) (.cse14 (not .cse21)) (.cse7 (= 1 ~q_req_up~0)) (.cse24 (< ~p_num_write~0 .cse26)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse25 (< .cse26 ~p_num_write~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse9 (= ~p_dw_pc~0 1)) (.cse3 (not (= ~p_dw_st~0 2))) (.cse19 (< 0 ~q_req_up~0)) (.cse15 (not (= 2 ~c_dr_st~0))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse6 (not (= ~q_free~0 0))) (.cse23 (= 0 ~c_dr_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (= ~q_read_ev~0 1) (or .cse11 .cse12 .cse1 .cse13 .cse0 .cse14 .cse15 .cse3 .cse16 .cse17 .cse18 .cse19) .cse4) (or .cse0 .cse1 .cse2 .cse20 .cse5 .cse19 .cse21 .cse13 .cse4 .cse22 .cse9 .cse10 .cse16 .cse18) (or .cse21 .cse1 .cse6 .cse23 .cse4 .cse9) (or .cse11 .cse1 .cse0 .cse6 .cse7 .cse23 .cse4 .cse2 .cse3) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse12 .cse11 .cse13 .cse7 .cse23 .cse9 .cse16 .cse17 .cse18) (or .cse21 .cse1 .cse13 .cse23 .cse9 .cse10 .cse16 .cse20 .cse4 .cse18) (or .cse21 .cse1 .cse6 .cse4 .cse23 .cse2) (or .cse11 .cse1 .cse0 .cse4 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 .cse19) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse12 .cse11 .cse13 .cse7 .cse23 .cse4 .cse16 .cse17 .cse18) (or .cse4 .cse11 .cse1 .cse0 .cse6 .cse7 .cse23 .cse2 .cse22 .cse9) (or .cse11 .cse1 .cse0 .cse6 .cse7 .cse4 .cse23 .cse9 .cse3) (or .cse24 .cse11 .cse1 .cse0 .cse4 .cse14 .cse6 .cse7 .cse25 .cse9 .cse3) (or .cse24 .cse0 .cse1 .cse25 .cse2 (not .cse9) .cse3 (= 0 ~q_write_ev~0) .cse19 .cse6 .cse15 .cse4) (or .cse21 .cse1 .cse4 .cse6 (not (= 0 ~q_read_ev~0)) .cse23)))) [2018-11-10 12:17:13,444 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-11-10 12:17:13,445 INFO L425 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-11-10 12:17:13,445 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-11-10 12:17:13,445 INFO L425 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-11-10 12:17:13,445 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 201) no Hoare annotation was computed. [2018-11-10 12:17:13,445 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-11-10 12:17:13,445 INFO L421 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse16 (= ~p_dw_pc~0 1))) (let ((.cse8 (not .cse16)) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< ~p_num_write~0 .cse18)) (.cse17 (= 1 |old(~q_req_up~0)|)) (.cse13 (< .cse18 ~p_num_write~0)) (.cse12 (not .cse15)) (.cse10 (< ~q_write_ev~0 2)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= ~p_dw_st~0 2))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (< 0 |old(~q_req_up~0)|))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 (or .cse11 .cse1 .cse2 (or .cse0 (or .cse12 .cse4)) .cse13 .cse3 .cse6) .cse8) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse14 .cse15 (< |old(~q_free~0)| 1) .cse3 (not (= ~p_dw_st~0 0)) .cse16 .cse7 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse17 .cse3 .cse5 .cse7) (or .cse10 (or .cse11 .cse1 .cse2 .cse17 .cse13 .cse3 .cse6 (or .cse0 .cse12 .cse16))) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse14)))) [2018-11-10 12:17:13,447 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-11-10 12:17:13,447 INFO L421 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse21 (not (= ~c_dr_pc~0 1))) (.cse22 (= ~c_num_read~0 0)) (.cse20 (not (= 0 ~c_dr_st~0))) (.cse24 (= ~q_free~0 0)) (.cse23 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~c_num_read~0)| 1)) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse9 (not .cse18)) (.cse13 (< ~p_num_write~0 .cse26)) (.cse15 (< .cse26 ~p_num_write~0)) (.cse14 (not .cse0)) (.cse16 (let ((.cse25 (+ ~c_num_read~0 1))) (and (<= .cse25 ~p_num_write~0) .cse20 (= 1 ~c_dr_pc~0) .cse24 .cse23 (<= ~p_num_write~0 .cse25)))) (.cse12 (< ~q_write_ev~0 2)) (.cse19 (< 0 |old(~q_req_up~0)|)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse10 (and .cse21 .cse20 .cse22 .cse24 .cse23)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse7 (not (= ~p_dw_st~0 2))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse17 (= 1 |old(~q_req_up~0)|)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11) (or .cse12 (or .cse13 .cse2 .cse3 (or .cse1 (or .cse14 .cse5)) .cse15 .cse4 .cse7) .cse9 .cse16) (or .cse12 (or .cse13 .cse2 .cse3 .cse17 .cse15 .cse4 .cse7 (or .cse1 .cse14 .cse18)) .cse16) (or .cse1 .cse2 .cse5 .cse7 .cse19 .cse0 .cse12 .cse3 .cse4 .cse10 .cse6 .cse18 .cse8) (or .cse2 .cse1 .cse5 (not (= 0 ~p_num_write~0)) .cse11 (and .cse20 (<= 1 ~q_free~0) .cse21 .cse22 .cse23 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0)) .cse19 .cse0 (< |old(~q_free~0)| 1) .cse4 (not (= ~p_dw_st~0 0)) .cse18 .cse8 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse2 .cse1 .cse10 .cse5 .cse7 .cse11 .cse0 .cse3 .cse17 .cse4 .cse6 .cse8)))) [2018-11-10 12:17:13,447 INFO L425 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-11-10 12:17:13,447 INFO L421 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse18 (= ~c_num_read~0 1)) (.cse13 (= ~p_dw_pc~0 1)) (.cse24 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~c_num_read~0)| 1)) (.cse17 (= 2 ~c_dr_st~0)) (.cse20 (= 1 ~c_dr_pc~0)) (.cse19 (<= 1 ~q_free~0)) (.cse21 (<= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse1 (and (<= ~p_num_write~0 ~c_num_read~0) .cse17 .cse20 .cse19 (<= ~c_num_read~0 ~p_num_write~0) .cse21 .cse22)) (.cse2 (< ~p_num_write~0 .cse26)) (.cse8 (< .cse26 ~p_num_write~0)) (.cse6 (not .cse24)) (.cse11 (not .cse13)) (.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse12 (= 1 |old(~q_req_up~0)|)) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse7 (not (= ~q_read_ev~0 2))) (.cse10 (not (= ~p_dw_st~0 2))) (.cse23 (< 0 |old(~q_req_up~0)|)) (.cse0 (< ~q_write_ev~0 2)) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse14 (not (= 1 ~p_num_write~0))) (.cse15 (not (= 0 |old(~c_num_read~0)|))) (.cse25 (and .cse17 .cse20 .cse18 .cse19 .cse21 .cse22))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 (or .cse5 (or .cse6 .cse7)) .cse8 .cse9 .cse10) .cse11) (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse12 .cse8 .cse9 .cse10 (or .cse5 .cse6 .cse13))) (or (or .cse5 .cse3 .cse4 .cse9 .cse7 .cse14 .cse10 .cse15) .cse11 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) (or .cse3 .cse5 (and .cse17 .cse19 .cse20 (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) .cse21 .cse22) .cse7 (not (= 0 ~p_num_write~0)) .cse16 .cse23 .cse24 (< |old(~q_free~0)| 1) .cse9 (not (= ~p_dw_st~0 0)) .cse13 .cse15 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse3 .cse5 .cse7 .cse10 .cse16 .cse4 .cse12 .cse9 .cse25 .cse14 .cse15) (or .cse5 .cse3 .cse7 .cse10 .cse23 .cse0 .cse4 .cse9 .cse14 .cse13 .cse15 .cse25)))) [2018-11-10 12:17:13,449 INFO L421 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse16 (= ~p_dw_pc~0 1))) (let ((.cse8 (not .cse16)) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< ~p_num_write~0 .cse18)) (.cse17 (= 1 |old(~q_req_up~0)|)) (.cse13 (< .cse18 ~p_num_write~0)) (.cse12 (not .cse15)) (.cse10 (< ~q_write_ev~0 2)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= ~p_dw_st~0 2))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (< 0 |old(~q_req_up~0)|))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 (or .cse11 .cse1 .cse2 (or .cse0 (or .cse12 .cse4)) .cse13 .cse3 .cse6) .cse8) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse14 .cse15 (< |old(~q_free~0)| 1) .cse3 (not (= ~p_dw_st~0 0)) .cse16 .cse7 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse17 .cse3 .cse5 .cse7) (or .cse10 (or .cse11 .cse1 .cse2 .cse17 .cse13 .cse3 .cse6 (or .cse0 .cse12 .cse16))) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse14)))) [2018-11-10 12:17:13,449 INFO L421 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1)) (.cse22 (= 1 |old(~c_dr_pc~0)|)) (.cse27 (+ |old(~c_num_read~0)| 1)) (.cse18 (= ~c_num_read~0 0)) (.cse19 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse17 (<= 1 ~q_free~0)) (.cse20 (<= ~q_free~0 1)) (.cse21 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse2 (and .cse16 (= ~c_num_read~0 1) .cse17 .cse20 .cse21)) (.cse10 (not (= 1 ~p_num_write~0))) (.cse6 (and .cse16 .cse18 (= ~q_free~0 0) .cse19)) (.cse13 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (< 0 |old(~q_req_up~0)|)) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (= 1 |old(~q_req_up~0)|)) (.cse7 (< ~q_write_ev~0 2)) (.cse24 (< ~p_num_write~0 .cse27)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse26 (not .cse22)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse25 (< .cse27 ~p_num_write~0)) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse15 (not .cse11)) (.cse23 (and (<= ~p_num_write~0 ~c_num_read~0) .cse16 .cse17 (<= ~c_num_read~0 ~p_num_write~0) .cse20 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 .cse1 .cse0 .cse3 .cse4 .cse13 .cse8 .cse2 .cse14 .cse9 .cse10 .cse12) (or .cse2 (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse4 .cse12) .cse15 .cse6 .cse13) (or .cse1 .cse0 .cse3 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (not (= 0 ~p_num_write~0)) .cse13 .cse5 .cse22 (< |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 .cse23 (or .cse24 .cse1 .cse8 .cse14 .cse25 .cse9 .cse4 (or .cse0 .cse26 .cse11))) (or .cse7 (or .cse24 .cse1 .cse8 (or .cse0 (or .cse26 .cse3)) .cse25 .cse9 .cse4) .cse15 .cse23)))) [2018-11-10 12:17:13,453 INFO L421 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse20 (+ |old(~c_num_read~0)| 1))) (let ((.cse12 (< ~p_num_write~0 .cse20)) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse14 (< .cse20 ~p_num_write~0)) (.cse13 (not .cse5)) (.cse16 (let ((.cse19 (+ ~c_num_read~0 1))) (and (<= .cse19 ~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 .cse19)))) (.cse15 (not .cse17)) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~p_num_write~0))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 (or .cse12 .cse0 .cse6 (or .cse1 (or .cse13 .cse2)) .cse14 .cse8 .cse3) .cse15 .cse16) (or .cse11 (or .cse12 .cse0 .cse6 .cse7 .cse14 .cse8 .cse3 (or .cse1 .cse13 .cse17)) .cse16) (or .cse0 .cse1 .cse2 (not (= 0 ~p_num_write~0)) .cse4 .cse18 .cse5 (< |old(~q_free~0)| 1) .cse8 (not (= ~p_dw_st~0 0)) .cse17 .cse10 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or (or .cse5 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse3 .cse10) .cse15 .cse4) (or .cse5 .cse11 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse17 .cse3 .cse10 .cse18)))) [2018-11-10 12:17:13,453 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-11-10 12:17:13,453 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-11-10 12:17:13,453 INFO L421 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-11-10 12:17:13,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:17:13 BoogieIcfgContainer [2018-11-10 12:17:13,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:17:13,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:17:13,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:17:13,514 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:17:13,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:15:52" (3/4) ... [2018-11-10 12:17:13,517 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:17:13,526 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-10 12:17:13,526 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-10 12:17:13,526 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-11-10 12:17:13,526 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-10 12:17:13,526 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-10 12:17:13,526 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:17:13,526 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-10 12:17:13,527 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-10 12:17:13,528 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-10 12:17:13,534 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-10 12:17:13,534 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 12:17:13,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(p_dw_i == 1) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || (((q_req_up <= 0 && 2 == p_dw_st) && 2 <= q_write_ev) && ((((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_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)) || ((((((((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && !(q_req_up == 1))) || ((((((((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)) || \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))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((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) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || !(\old(q_read_ev) == 2)) || (((2 <= q_write_ev && !(q_req_up == 1)) && ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free <= 1) && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && 1 == p_dw_pc)) || !(\old(q_read_ev) == \old(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)) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((((!(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))) || (((((((((((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) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((2 == p_dw_st && 2 <= q_write_ev) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_free <= 1) && c_last_read == p_last_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free) && 0 == p_num_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-11-10 12:17:13,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) && ((((((((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))) && (((((((((((((!(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))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 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) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((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))) && ((((((((((((\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)) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || !(\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))) || !(\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)))) && (((((((((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)))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \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)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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_pc) == 1)) || !(\old(p_dw_st) == 2))) && ((((((((((((((((((((((((((((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)) || 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) || (((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || (((((((((!(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_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 == p_dw_pc) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(\old(p_dw_st) == 0))) && ((((((((((((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \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)) && 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) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 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))) || ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((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))) && (((((((((((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)) && (((((((((((((!(\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)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 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)) [2018-11-10 12:17:13,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) && ((((((((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))) && ((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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_pc) == 1)) || !(\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) || 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))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 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) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((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))) && ((((((((((((\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)) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((((((((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(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)) || (((((((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(\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)))) && (((((((((((((!(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)))) && (((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(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)))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \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)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || !(\old(p_dw_pc) == 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)))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((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))) && (((((((((((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)) && (((((((((((((!(\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)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 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)) [2018-11-10 12:17:13,556 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || ((((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)) || 0 == c_dr_st) || (((((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)) && ((((((((((((((!(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))) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_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))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || 1 == p_num_write) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || c_last_read == p_last_write) || !(c_last_read == \old(p_last_write)))) && (((((0 == c_dr_st || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || (((q_free == 0 && p_dw_pc == \old(p_dw_pc)) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \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) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || ((((((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) && 0 == p_num_write)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write))) && ((((((\old(p_dw_st) == 0 || !(p_dw_i == 1)) || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || q_write_ev < 2) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || !(\old(p_dw_pc) == 1)) [2018-11-10 12:17:13,556 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0) || 0 == c_dr_st) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0))) && ((((((((((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && ((((((\old(p_dw_st) == 0 || !(p_dw_i == 1)) || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || q_write_ev < 2) || !(\old(p_dw_pc) == 1)) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && 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)) || !(1 == \old(p_dw_pc)))) && ((((((((((\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)) || !(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)) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(c_last_read == \old(p_last_write))) [2018-11-10 12:17:13,556 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((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)) && (((((((((((((!(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) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up) && 0 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && ((((((((\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) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write)))) && ((((((\old(p_dw_st) == 0 || !(p_dw_i == 1)) || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || 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_pc) == 1)) [2018-11-10 12:17:13,556 WARN L220 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))) && ((((((((((((((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up) || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(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) || ((((((!(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))) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(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 <= 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 || !(p_dw_i == 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1)) && (((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || !(p_dw_pc == 1)) || (((((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)) [2018-11-10 12:17:13,556 WARN L220 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 || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || !(p_dw_pc == 1)) && ((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 || !(p_dw_i == 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1)) && ((((((((((!(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))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && 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))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && (((((((((((!(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)) [2018-11-10 12:17:13,557 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) && (((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || !(p_dw_pc == 1)) || (((((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 || ((((((p_num_write < \old(c_num_read) + 1 || !(p_dw_i == 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || (((((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_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))) && ((((((((((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))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && (((((((((((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)) [2018-11-10 12:17:13,597 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d1c317c6-36df-464c-b011-13ea7911da92/bin-2019/uautomizer/witness.graphml [2018-11-10 12:17:13,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:17:13,598 INFO L168 Benchmark]: Toolchain (without parser) took 82038.27 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 960.3 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 12:17:13,598 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:17:13,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.22 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:13,599 INFO L168 Benchmark]: Boogie Preprocessor took 28.38 ms. Allocated memory is still 1.0 GB. Free memory was 946.7 MB in the beginning and 944.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:13,599 INFO L168 Benchmark]: RCFGBuilder took 386.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.0 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:13,599 INFO L168 Benchmark]: TraceAbstraction took 81347.17 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-11-10 12:17:13,599 INFO L168 Benchmark]: Witness Printer took 83.81 ms. Allocated memory is still 4.6 GB. Free memory is still 3.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:17:13,600 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.22 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.38 ms. Allocated memory is still 1.0 GB. Free memory was 946.7 MB in the beginning and 944.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.0 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81347.17 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 83.81 ms. Allocated memory is still 4.6 GB. Free memory is still 3.1 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)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) && (((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || !(p_dw_pc == 1)) || (((((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 || ((((((p_num_write < \old(c_num_read) + 1 || !(p_dw_i == 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || (((((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_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))) && ((((((((((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))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && (((((((((((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)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((((((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0) || 0 == c_dr_st) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0))) && ((((((((((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && ((((((\old(p_dw_st) == 0 || !(p_dw_i == 1)) || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || q_write_ev < 2) || !(\old(p_dw_pc) == 1)) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && 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)) || !(1 == \old(p_dw_pc)))) && ((((((((((\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)) || !(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)) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(c_last_read == \old(p_last_write))) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || ((((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)) || 0 == c_dr_st) || (((((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)) && ((((((((((((((!(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))) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_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))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || 1 == p_num_write) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || c_last_read == p_last_write) || !(c_last_read == \old(p_last_write)))) && (((((0 == c_dr_st || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || (((q_free == 0 && p_dw_pc == \old(p_dw_pc)) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \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) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || ((((((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) && 0 == p_num_write)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && 1 == p_num_write))) && ((((((\old(p_dw_st) == 0 || !(p_dw_i == 1)) || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || q_write_ev < 2) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || !(\old(p_dw_pc) == 1)) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) && ((((((((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))) && (((((((((((((!(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))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 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) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((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))) && ((((((((((((\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)) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || !(\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))) || !(\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)))) && (((((((((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)))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \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)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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_pc) == 1)) || !(\old(p_dw_st) == 2))) && ((((((((((((((((((((((((((((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)) || 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) || (((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || (((((((((!(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_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 == p_dw_pc) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(\old(p_dw_st) == 0))) && ((((((((((((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \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)) && 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) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 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))) || ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((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))) && (((((((((((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)) && (((((((((((((!(\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)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 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)) - 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)) && ((q_read_ev == 1 || ((((((((((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)) && (((((((((((((!(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))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 0 == c_dr_st) || 0 == __retres1) || 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 == 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))) && (((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || q_free < 1) || 0 == c_dr_st) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || 0 == __retres1) || !(c_last_read == p_last_write))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 0 == __retres1) || 0 == c_dr_st) || !(q_read_ev == 2))) && ((((((((((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)) && (((((((((((((!(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))) && (((((((((((p_num_write < c_num_read + 1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || c_num_read + 1 < p_num_write) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || 0 == q_write_ev) || 0 < q_req_up) || !(q_free == 0)) || !(2 == c_dr_st)) || 0 == __retres1)) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_free == 0)) || !(0 == q_read_ev)) || 0 == c_dr_st) - 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 || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || !(p_dw_pc == 1)) && ((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 || !(p_dw_i == 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1)) && ((((((((((!(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))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && 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))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || (((((2 == c_dr_st && 1 == c_dr_pc) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && (((((((((((!(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)) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(p_dw_i == 1) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || (((q_req_up <= 0 && 2 == p_dw_st) && 2 <= q_write_ev) && ((((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_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)) || ((((((((c_num_read + 1 <= p_num_write && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && !(q_req_up == 1))) || ((((((((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)) || \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))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((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) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || !(\old(q_read_ev) == 2)) || (((2 <= q_write_ev && !(q_req_up == 1)) && ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free <= 1) && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && 1 == p_dw_pc)) || !(\old(q_read_ev) == \old(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)) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((((!(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))) || (((((((((((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) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((2 == p_dw_st && 2 <= q_write_ev) && (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_free <= 1) && c_last_read == p_last_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free) && 0 == p_num_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: ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((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)) && (((((((((((((!(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) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up) && 0 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && ((((((((\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) || !(0 == c_num_read)) || (((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(p_num_write)))) && ((((((\old(p_dw_st) == 0 || !(p_dw_i == 1)) || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || c_num_read < \old(p_num_write)) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || 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_pc) == 1)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) && ((((((((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))) && ((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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_pc) == 1)) || !(\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) || 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))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && 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) && 1 == p_dw_pc) || !(\old(p_dw_pc) == 1)) || ((((((((((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))) && ((((((((((((\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)) && (((((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((((((((((((2 == c_dr_st && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write) || !(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)) || (((((((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(\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)))) && (((((((((((((!(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)))) && (((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || ((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 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)) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(0 == \old(p_num_write))) || !(\old(c_last_read) == \old(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)))) && ((((((((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || p_dw_st == 0) || 1 < \old(q_free)) || !(0 == \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)) || 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)) || (((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && q_read_ev == q_write_ev) && p_last_write == q_buf_0) && 2 == q_read_ev)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 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)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || 0 < \old(q_req_up)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && ((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || !(\old(p_dw_pc) == 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)))) && (((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && (((((((((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))) && (((((((((((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)) && (((((((((((((!(\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)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || 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)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((((((((((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) && (((((((((((((!(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))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || 1 == __retres1) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && (((((((((((!(0 == c_dr_st) || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || !(q_free == 0)) || __retres1 == 1) || !(1 == p_num_write)) || !(0 == c_num_read))) && (__retres1 == 1 || !(p_dw_pc == 1) || (((((((((((!(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))) && ((!(0 == c_dr_st) || __retres1 == 1) || (((((((((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_pc == 1)) || !(p_dw_st == 2))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(q_free == 0)) || 0 == c_dr_st) || !(p_dw_st == 0)) || 1 == __retres1)) && ((((((((((1 == __retres1 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || q_free < 1) || 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)) - 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))) && ((((((((((((((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up) || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(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) || ((((((!(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))) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(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 <= 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 || !(p_dw_i == 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)) || (!(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1)) && (((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(q_buf_0 == p_last_write) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || !(p_dw_pc == 1)) || (((((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)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((((((((!(q_read_ev == 1) || (((((((((((!(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)) || 0 == __retres1) && ((0 == __retres1 || (q_write_ev < 2 || (!(p_dw_i == 1) || ((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 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)) || 1 == q_req_up) || !(q_read_ev == 1))) && ((((!(q_buf_0 == p_last_write) || 0 == __retres1) || !(q_free == 0)) || 0 == c_dr_st) || 1 == c_dr_pc)) && (((((((((!(q_buf_0 == p_last_write) || q_free < 1) || 0 == c_dr_st) || 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 || !(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))) && (((q_write_ev < 2 || (!(p_dw_i == 1) || ((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 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_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))) && ((((((((((((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) || !(1 == p_dw_pc)) || 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)) && ((((((((((!(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 20 procedures, 143 locations, 1 error locations. SAFE Result, 81.2s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 15.1s AutomataDifference, 0.0s DeadEndRemovalTime, 55.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4179 SDtfs, 8079 SDslu, 6058 SDs, 0 SdLazy, 9098 SolverSat, 2768 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1783 GetRequests, 1596 SyntacticMatches, 14 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26785occurred 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: 7.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 11739 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 51211 PreInvPairs, 59830 NumberOfFragments, 25205 HoareAnnotationTreeSize, 51211 FomulaSimplifications, 398867 FormulaSimplificationTreeSizeReduction, 8.7s HoareSimplificationTime, 56 FomulaSimplificationsInter, 410933 FormulaSimplificationTreeSizeReductionInter, 46.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 4124 NumberOfCodeBlocks, 4124 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4097 ConstructedInterpolants, 0 QuantifiedInterpolants, 1166158 SizeOfPredicates, 11 NumberOfNonLiveVariables, 6996 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 2516/2598 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...