./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-0cd3be1 [2018-11-28 11:19:59,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:19:59,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:19:59,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:19:59,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:19:59,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:19:59,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:19:59,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:19:59,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:19:59,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:19:59,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:19:59,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:19:59,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:19:59,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:19:59,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:19:59,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:19:59,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:19:59,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:19:59,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:19:59,366 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:19:59,367 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:19:59,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:19:59,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:19:59,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:19:59,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:19:59,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:19:59,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:19:59,371 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:19:59,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:19:59,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:19:59,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:19:59,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:19:59,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:19:59,373 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:19:59,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:19:59,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:19:59,374 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:19:59,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:19:59,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:19:59,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:19:59,382 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:19:59,383 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:19:59,383 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:19:59,383 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:19:59,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:19:59,383 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:19:59,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:19:59,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:19:59,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:19:59,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:19:59,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:19:59,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:19:59,384 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:19:59,385 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:19:59,385 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:19:59,385 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:19:59,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:19:59,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:19:59,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:19:59,386 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:19:59,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:19:59,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:19:59,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:19:59,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:19:59,386 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:19:59,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:19:59,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:19:59,387 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_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:19:59,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:19:59,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:19:59,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:19:59,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:19:59,424 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:19:59,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-28 11:19:59,464 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/data/83e491c98/67a1edf61fc64ea69c55e4cc60d90b6b/FLAG56217eec5 [2018-11-28 11:19:59,879 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:19:59,880 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-28 11:19:59,887 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/data/83e491c98/67a1edf61fc64ea69c55e4cc60d90b6b/FLAG56217eec5 [2018-11-28 11:19:59,899 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/data/83e491c98/67a1edf61fc64ea69c55e4cc60d90b6b [2018-11-28 11:19:59,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:19:59,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:19:59,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:19:59,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:19:59,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:19:59,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:59" (1/1) ... [2018-11-28 11:19:59,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636b256e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:59, skipping insertion in model container [2018-11-28 11:19:59,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:59" (1/1) ... [2018-11-28 11:19:59,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:19:59,938 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:20:00,062 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:20:00,066 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:20:00,089 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:20:00,099 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:20:00,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00 WrapperNode [2018-11-28 11:20:00,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:20:00,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:20:00,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:20:00,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:20:00,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:20:00,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:20:00,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:20:00,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:20:00,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... [2018-11-28 11:20:00,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:20:00,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:20:00,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:20:00,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:20:00,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-28 11:20:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-28 11:20:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-28 11:20:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-28 11:20:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-11-28 11:20:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-11-28 11:20:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-28 11:20:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-28 11:20:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-28 11:20:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-28 11:20:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:20:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:20:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-28 11:20:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-28 11:20:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-28 11:20:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-28 11:20:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:20:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:20:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-28 11:20:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-28 11:20:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-28 11:20:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-28 11:20:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-28 11:20:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-28 11:20:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-28 11:20:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-28 11:20:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-28 11:20:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-28 11:20:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-28 11:20:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-28 11:20:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:20:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:20:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-28 11:20:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-28 11:20:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-28 11:20:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-28 11:20:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-28 11:20:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-28 11:20:00,514 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:20:00,514 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 11:20:00,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:00 BoogieIcfgContainer [2018-11-28 11:20:00,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:20:00,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:20:00,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:20:00,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:20:00,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:19:59" (1/3) ... [2018-11-28 11:20:00,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d16a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:20:00, skipping insertion in model container [2018-11-28 11:20:00,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:00" (2/3) ... [2018-11-28 11:20:00,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d16a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:20:00, skipping insertion in model container [2018-11-28 11:20:00,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:00" (3/3) ... [2018-11-28 11:20:00,519 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-28 11:20:00,525 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:20:00,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:20:00,544 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:20:00,572 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:20:00,573 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:20:00,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:20:00,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:20:00,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:20:00,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:20:00,573 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:20:00,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:20:00,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:20:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-11-28 11:20:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:20:00,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:00,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:00,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:00,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash 11439179, now seen corresponding path program 1 times [2018-11-28 11:20:00,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:00,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:00,790 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-28 11:20:00,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:00,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:20:00,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:20:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:20:00,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:20:00,811 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2018-11-28 11:20:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:01,256 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-11-28 11:20:01,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:20:01,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-28 11:20:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:01,271 INFO L225 Difference]: With dead ends: 379 [2018-11-28 11:20:01,272 INFO L226 Difference]: Without dead ends: 252 [2018-11-28 11:20:01,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:20:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-28 11:20:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2018-11-28 11:20:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-28 11:20:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2018-11-28 11:20:01,337 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2018-11-28 11:20:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:01,338 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2018-11-28 11:20:01,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:20:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2018-11-28 11:20:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:20:01,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:01,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:01,341 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:01,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1438317323, now seen corresponding path program 1 times [2018-11-28 11:20:01,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:01,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:01,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:01,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:01,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:01,428 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-28 11:20:01,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:20:01,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:20:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:20:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:20:01,431 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2018-11-28 11:20:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:01,962 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2018-11-28 11:20:01,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:20:01,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-28 11:20:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:01,966 INFO L225 Difference]: With dead ends: 628 [2018-11-28 11:20:01,967 INFO L226 Difference]: Without dead ends: 422 [2018-11-28 11:20:01,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:20:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-11-28 11:20:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2018-11-28 11:20:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-28 11:20:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-11-28 11:20:02,014 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2018-11-28 11:20:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:02,014 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-11-28 11:20:02,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:20:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-11-28 11:20:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:20:02,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:02,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:02,018 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:02,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1469864563, now seen corresponding path program 1 times [2018-11-28 11:20:02,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:02,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:02,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:02,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:02,084 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-28 11:20:02,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:02,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:20:02,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:20:02,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:20:02,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:20:02,086 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2018-11-28 11:20:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:02,127 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2018-11-28 11:20:02,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:20:02,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-28 11:20:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:02,130 INFO L225 Difference]: With dead ends: 685 [2018-11-28 11:20:02,130 INFO L226 Difference]: Without dead ends: 369 [2018-11-28 11:20:02,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:20:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-28 11:20:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2018-11-28 11:20:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-28 11:20:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2018-11-28 11:20:02,158 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2018-11-28 11:20:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:02,159 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2018-11-28 11:20:02,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:20:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2018-11-28 11:20:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:20:02,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:02,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:02,161 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:02,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1221718069, now seen corresponding path program 1 times [2018-11-28 11:20:02,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:02,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:02,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:02,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:02,236 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-28 11:20:02,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:02,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:20:02,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:20:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:20:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:20:02,237 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2018-11-28 11:20:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:02,341 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2018-11-28 11:20:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:20:02,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 11:20:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:02,345 INFO L225 Difference]: With dead ends: 991 [2018-11-28 11:20:02,345 INFO L226 Difference]: Without dead ends: 670 [2018-11-28 11:20:02,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:20:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-28 11:20:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-11-28 11:20:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-28 11:20:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2018-11-28 11:20:02,381 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2018-11-28 11:20:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:02,382 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2018-11-28 11:20:02,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:20:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2018-11-28 11:20:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:20:02,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:02,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:02,384 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:02,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2116320844, now seen corresponding path program 1 times [2018-11-28 11:20:02,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:02,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:02,430 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-28 11:20:02,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:02,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:20:02,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:20:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:20:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:20:02,431 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2018-11-28 11:20:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:02,483 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2018-11-28 11:20:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:20:02,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-28 11:20:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:02,487 INFO L225 Difference]: With dead ends: 1280 [2018-11-28 11:20:02,487 INFO L226 Difference]: Without dead ends: 672 [2018-11-28 11:20:02,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:20:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-28 11:20:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2018-11-28 11:20:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-11-28 11:20:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2018-11-28 11:20:02,521 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2018-11-28 11:20:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:02,521 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2018-11-28 11:20:02,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:20:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2018-11-28 11:20:02,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:20:02,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:02,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:02,523 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:02,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:02,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934286, now seen corresponding path program 1 times [2018-11-28 11:20:02,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:02,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:02,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:02,603 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-28 11:20:02,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:02,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:20:02,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:20:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:20:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:20:02,604 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2018-11-28 11:20:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:03,201 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2018-11-28 11:20:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:20:03,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-28 11:20:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:03,206 INFO L225 Difference]: With dead ends: 1359 [2018-11-28 11:20:03,206 INFO L226 Difference]: Without dead ends: 831 [2018-11-28 11:20:03,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:20:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-28 11:20:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2018-11-28 11:20:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-11-28 11:20:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2018-11-28 11:20:03,247 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2018-11-28 11:20:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:03,247 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2018-11-28 11:20:03,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:20:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2018-11-28 11:20:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 11:20:03,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:03,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:03,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:03,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1534461196, now seen corresponding path program 1 times [2018-11-28 11:20:03,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:03,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:03,280 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-28 11:20:03,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:03,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:03,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:03,281 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2018-11-28 11:20:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:03,347 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2018-11-28 11:20:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:03,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-11-28 11:20:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:03,354 INFO L225 Difference]: With dead ends: 1887 [2018-11-28 11:20:03,354 INFO L226 Difference]: Without dead ends: 1276 [2018-11-28 11:20:03,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-11-28 11:20:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2018-11-28 11:20:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-28 11:20:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2018-11-28 11:20:03,422 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2018-11-28 11:20:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:03,423 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2018-11-28 11:20:03,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2018-11-28 11:20:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 11:20:03,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:03,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:03,425 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:03,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash -578263435, now seen corresponding path program 1 times [2018-11-28 11:20:03,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:03,499 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-28 11:20:03,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:03,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:20:03,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:20:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:20:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:20:03,501 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2018-11-28 11:20:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:03,659 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2018-11-28 11:20:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:20:03,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-28 11:20:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:03,669 INFO L225 Difference]: With dead ends: 3564 [2018-11-28 11:20:03,669 INFO L226 Difference]: Without dead ends: 2309 [2018-11-28 11:20:03,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:20:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-11-28 11:20:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2018-11-28 11:20:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-11-28 11:20:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2018-11-28 11:20:03,808 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2018-11-28 11:20:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:03,808 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2018-11-28 11:20:03,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:20:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2018-11-28 11:20:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 11:20:03,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:03,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:03,811 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:03,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1713093210, now seen corresponding path program 1 times [2018-11-28 11:20:03,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:03,916 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-28 11:20:03,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:03,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:20:03,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:20:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:20:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:20:03,917 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2018-11-28 11:20:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:04,626 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2018-11-28 11:20:04,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:20:04,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-11-28 11:20:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:04,649 INFO L225 Difference]: With dead ends: 6956 [2018-11-28 11:20:04,649 INFO L226 Difference]: Without dead ends: 4830 [2018-11-28 11:20:04,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:20:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-11-28 11:20:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2018-11-28 11:20:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2018-11-28 11:20:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2018-11-28 11:20:04,963 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2018-11-28 11:20:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:04,964 INFO L480 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2018-11-28 11:20:04,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:20:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2018-11-28 11:20:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:20:04,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:04,966 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:04,966 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:04,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1838635891, now seen corresponding path program 1 times [2018-11-28 11:20:04,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:04,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:04,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:20:05,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:05,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:20:05,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:20:05,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:20:05,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:20:05,015 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2018-11-28 11:20:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:05,285 INFO L93 Difference]: Finished difference Result 9202 states and 12339 transitions. [2018-11-28 11:20:05,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:20:05,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-28 11:20:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:05,307 INFO L225 Difference]: With dead ends: 9202 [2018-11-28 11:20:05,307 INFO L226 Difference]: Without dead ends: 4574 [2018-11-28 11:20:05,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:20:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2018-11-28 11:20:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2018-11-28 11:20:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2018-11-28 11:20:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6130 transitions. [2018-11-28 11:20:05,579 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6130 transitions. Word has length 88 [2018-11-28 11:20:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:05,579 INFO L480 AbstractCegarLoop]: Abstraction has 4574 states and 6130 transitions. [2018-11-28 11:20:05,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:20:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6130 transitions. [2018-11-28 11:20:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:20:05,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:05,581 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:05,581 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:05,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1488980751, now seen corresponding path program 1 times [2018-11-28 11:20:05,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:05,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:05,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:05,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:20:05,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:20:05,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:20:05,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:20:05,649 INFO L87 Difference]: Start difference. First operand 4574 states and 6130 transitions. Second operand 4 states. [2018-11-28 11:20:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:06,019 INFO L93 Difference]: Finished difference Result 6044 states and 8116 transitions. [2018-11-28 11:20:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:20:06,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-28 11:20:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:06,045 INFO L225 Difference]: With dead ends: 6044 [2018-11-28 11:20:06,045 INFO L226 Difference]: Without dead ends: 6041 [2018-11-28 11:20:06,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:20:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2018-11-28 11:20:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5872. [2018-11-28 11:20:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2018-11-28 11:20:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2018-11-28 11:20:06,377 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 88 [2018-11-28 11:20:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:06,377 INFO L480 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2018-11-28 11:20:06,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:20:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2018-11-28 11:20:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:20:06,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:06,379 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:06,379 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:06,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1085920016, now seen corresponding path program 1 times [2018-11-28 11:20:06,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:06,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:06,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:06,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:06,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:06,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:06,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:06,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:20:06,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-28 11:20:06,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:20:06,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:20:06,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:20:06,714 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 11 states. [2018-11-28 11:20:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:09,779 INFO L93 Difference]: Finished difference Result 15758 states and 23867 transitions. [2018-11-28 11:20:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 11:20:09,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-11-28 11:20:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:09,863 INFO L225 Difference]: With dead ends: 15758 [2018-11-28 11:20:09,863 INFO L226 Difference]: Without dead ends: 15755 [2018-11-28 11:20:09,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:20:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15755 states. [2018-11-28 11:20:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15755 to 15192. [2018-11-28 11:20:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15192 states. [2018-11-28 11:20:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15192 states to 15192 states and 22734 transitions. [2018-11-28 11:20:11,060 INFO L78 Accepts]: Start accepts. Automaton has 15192 states and 22734 transitions. Word has length 89 [2018-11-28 11:20:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:11,061 INFO L480 AbstractCegarLoop]: Abstraction has 15192 states and 22734 transitions. [2018-11-28 11:20:11,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:20:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 15192 states and 22734 transitions. [2018-11-28 11:20:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 11:20:11,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:11,063 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:11,063 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:11,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2042764433, now seen corresponding path program 2 times [2018-11-28 11:20:11,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:11,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:11,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:11,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:11,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:11,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:11,125 INFO L87 Difference]: Start difference. First operand 15192 states and 22734 transitions. Second operand 3 states. [2018-11-28 11:20:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:11,713 INFO L93 Difference]: Finished difference Result 24841 states and 38821 transitions. [2018-11-28 11:20:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:11,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-11-28 11:20:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:11,751 INFO L225 Difference]: With dead ends: 24841 [2018-11-28 11:20:11,751 INFO L226 Difference]: Without dead ends: 10372 [2018-11-28 11:20:11,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10372 states. [2018-11-28 11:20:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10372 to 10116. [2018-11-28 11:20:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10116 states. [2018-11-28 11:20:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 14383 transitions. [2018-11-28 11:20:12,274 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 14383 transitions. Word has length 92 [2018-11-28 11:20:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:12,274 INFO L480 AbstractCegarLoop]: Abstraction has 10116 states and 14383 transitions. [2018-11-28 11:20:12,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 14383 transitions. [2018-11-28 11:20:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 11:20:12,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:12,276 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:12,276 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:12,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash -131765010, now seen corresponding path program 1 times [2018-11-28 11:20:12,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:12,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:12,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:20:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:20:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:20:12,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:20:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:20:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:20:12,327 INFO L87 Difference]: Start difference. First operand 10116 states and 14383 transitions. Second operand 7 states. [2018-11-28 11:20:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:14,232 INFO L93 Difference]: Finished difference Result 35655 states and 58048 transitions. [2018-11-28 11:20:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:20:14,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-28 11:20:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:14,326 INFO L225 Difference]: With dead ends: 35655 [2018-11-28 11:20:14,326 INFO L226 Difference]: Without dead ends: 19845 [2018-11-28 11:20:14,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:20:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2018-11-28 11:20:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 18429. [2018-11-28 11:20:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18429 states. [2018-11-28 11:20:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18429 states to 18429 states and 25148 transitions. [2018-11-28 11:20:15,340 INFO L78 Accepts]: Start accepts. Automaton has 18429 states and 25148 transitions. Word has length 100 [2018-11-28 11:20:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:15,340 INFO L480 AbstractCegarLoop]: Abstraction has 18429 states and 25148 transitions. [2018-11-28 11:20:15,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:20:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18429 states and 25148 transitions. [2018-11-28 11:20:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-28 11:20:15,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:15,343 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:15,344 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:15,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash 193904721, now seen corresponding path program 1 times [2018-11-28 11:20:15,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:15,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:20:15,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:15,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:15,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:15,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:20:15,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:20:15,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-28 11:20:15,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:20:15,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:20:15,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:20:15,572 INFO L87 Difference]: Start difference. First operand 18429 states and 25148 transitions. Second operand 9 states. [2018-11-28 11:20:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:16,842 INFO L93 Difference]: Finished difference Result 32556 states and 45174 transitions. [2018-11-28 11:20:16,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 11:20:16,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-11-28 11:20:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:16,891 INFO L225 Difference]: With dead ends: 32556 [2018-11-28 11:20:16,891 INFO L226 Difference]: Without dead ends: 15096 [2018-11-28 11:20:16,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-28 11:20:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15096 states. [2018-11-28 11:20:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15096 to 14338. [2018-11-28 11:20:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14338 states. [2018-11-28 11:20:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 17118 transitions. [2018-11-28 11:20:17,519 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 17118 transitions. Word has length 110 [2018-11-28 11:20:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:17,520 INFO L480 AbstractCegarLoop]: Abstraction has 14338 states and 17118 transitions. [2018-11-28 11:20:17,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:20:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 17118 transitions. [2018-11-28 11:20:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-28 11:20:17,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:17,525 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:17,526 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:17,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 716240703, now seen corresponding path program 1 times [2018-11-28 11:20:17,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:17,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:17,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 11:20:17,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:17,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:17,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:17,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:17,842 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-11-28 11:20:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 11:20:17,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:20:17,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-28 11:20:17,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:20:17,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:20:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:20:17,899 INFO L87 Difference]: Start difference. First operand 14338 states and 17118 transitions. Second operand 8 states. [2018-11-28 11:20:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:18,781 INFO L93 Difference]: Finished difference Result 31805 states and 38553 transitions. [2018-11-28 11:20:18,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:20:18,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2018-11-28 11:20:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:18,832 INFO L225 Difference]: With dead ends: 31805 [2018-11-28 11:20:18,832 INFO L226 Difference]: Without dead ends: 17865 [2018-11-28 11:20:18,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:20:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17865 states. [2018-11-28 11:20:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17865 to 17655. [2018-11-28 11:20:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17655 states. [2018-11-28 11:20:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17655 states to 17655 states and 21178 transitions. [2018-11-28 11:20:19,576 INFO L78 Accepts]: Start accepts. Automaton has 17655 states and 21178 transitions. Word has length 174 [2018-11-28 11:20:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:19,576 INFO L480 AbstractCegarLoop]: Abstraction has 17655 states and 21178 transitions. [2018-11-28 11:20:19,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:20:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17655 states and 21178 transitions. [2018-11-28 11:20:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-28 11:20:19,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:19,579 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:19,580 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:19,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 745588165, now seen corresponding path program 1 times [2018-11-28 11:20:19,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:19,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 11:20:19,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:19,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:19,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:19,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 11:20:19,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:20:19,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-28 11:20:19,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:20:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:20:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:20:19,891 INFO L87 Difference]: Start difference. First operand 17655 states and 21178 transitions. Second operand 11 states. [2018-11-28 11:20:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:21,753 INFO L93 Difference]: Finished difference Result 53069 states and 65336 transitions. [2018-11-28 11:20:21,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 11:20:21,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-11-28 11:20:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:21,838 INFO L225 Difference]: With dead ends: 53069 [2018-11-28 11:20:21,839 INFO L226 Difference]: Without dead ends: 30556 [2018-11-28 11:20:21,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-11-28 11:20:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30556 states. [2018-11-28 11:20:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30556 to 25958. [2018-11-28 11:20:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25958 states. [2018-11-28 11:20:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25958 states to 25958 states and 30391 transitions. [2018-11-28 11:20:22,999 INFO L78 Accepts]: Start accepts. Automaton has 25958 states and 30391 transitions. Word has length 189 [2018-11-28 11:20:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:22,999 INFO L480 AbstractCegarLoop]: Abstraction has 25958 states and 30391 transitions. [2018-11-28 11:20:22,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:20:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 25958 states and 30391 transitions. [2018-11-28 11:20:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-28 11:20:23,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:23,005 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:23,006 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:23,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash -622457563, now seen corresponding path program 1 times [2018-11-28 11:20:23,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:23,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:23,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-28 11:20:23,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:23,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:23,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:23,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-28 11:20:23,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:20:23,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-28 11:20:23,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:20:23,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:20:23,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:20:23,319 INFO L87 Difference]: Start difference. First operand 25958 states and 30391 transitions. Second operand 12 states. [2018-11-28 11:20:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:23,970 INFO L93 Difference]: Finished difference Result 40134 states and 47644 transitions. [2018-11-28 11:20:23,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:20:23,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 274 [2018-11-28 11:20:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:24,012 INFO L225 Difference]: With dead ends: 40134 [2018-11-28 11:20:24,012 INFO L226 Difference]: Without dead ends: 14225 [2018-11-28 11:20:24,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:20:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14225 states. [2018-11-28 11:20:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14225 to 11886. [2018-11-28 11:20:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2018-11-28 11:20:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 13870 transitions. [2018-11-28 11:20:24,527 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 13870 transitions. Word has length 274 [2018-11-28 11:20:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:24,527 INFO L480 AbstractCegarLoop]: Abstraction has 11886 states and 13870 transitions. [2018-11-28 11:20:24,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:20:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 13870 transitions. [2018-11-28 11:20:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-28 11:20:24,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:24,533 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:24,533 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:24,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash 823377233, now seen corresponding path program 1 times [2018-11-28 11:20:24,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:24,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-11-28 11:20:24,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:24,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:24,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:24,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-28 11:20:24,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:20:24,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-28 11:20:24,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:20:24,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:20:24,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:20:24,869 INFO L87 Difference]: Start difference. First operand 11886 states and 13870 transitions. Second operand 8 states. [2018-11-28 11:20:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:25,581 INFO L93 Difference]: Finished difference Result 18360 states and 21485 transitions. [2018-11-28 11:20:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:20:25,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2018-11-28 11:20:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:25,596 INFO L225 Difference]: With dead ends: 18360 [2018-11-28 11:20:25,596 INFO L226 Difference]: Without dead ends: 7022 [2018-11-28 11:20:25,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:20:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2018-11-28 11:20:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 6787. [2018-11-28 11:20:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6787 states. [2018-11-28 11:20:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6787 states to 6787 states and 7840 transitions. [2018-11-28 11:20:25,975 INFO L78 Accepts]: Start accepts. Automaton has 6787 states and 7840 transitions. Word has length 293 [2018-11-28 11:20:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:25,976 INFO L480 AbstractCegarLoop]: Abstraction has 6787 states and 7840 transitions. [2018-11-28 11:20:25,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:20:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6787 states and 7840 transitions. [2018-11-28 11:20:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-28 11:20:25,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:25,980 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 11:20:25,980 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:25,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 938728294, now seen corresponding path program 1 times [2018-11-28 11:20:25,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:25,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:25,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:25,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 72 proven. 22 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-28 11:20:26,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:26,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/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-28 11:20:26,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:26,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-28 11:20:26,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:20:26,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-28 11:20:26,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:20:26,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:20:26,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:20:26,317 INFO L87 Difference]: Start difference. First operand 6787 states and 7840 transitions. Second operand 4 states. [2018-11-28 11:20:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:26,554 INFO L93 Difference]: Finished difference Result 9110 states and 10566 transitions. [2018-11-28 11:20:26,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:20:26,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-11-28 11:20:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:26,560 INFO L225 Difference]: With dead ends: 9110 [2018-11-28 11:20:26,560 INFO L226 Difference]: Without dead ends: 4009 [2018-11-28 11:20:26,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:20:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-28 11:20:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4001. [2018-11-28 11:20:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4001 states. [2018-11-28 11:20:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 4553 transitions. [2018-11-28 11:20:26,741 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 4553 transitions. Word has length 292 [2018-11-28 11:20:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:26,741 INFO L480 AbstractCegarLoop]: Abstraction has 4001 states and 4553 transitions. [2018-11-28 11:20:26,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:20:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 4553 transitions. [2018-11-28 11:20:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-28 11:20:26,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:26,744 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-28 11:20:26,744 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:26,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash 585639202, now seen corresponding path program 1 times [2018-11-28 11:20:26,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:26,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:26,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-28 11:20:26,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:20:26,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:20:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:26,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:20:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-28 11:20:27,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:20:27,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-28 11:20:27,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:20:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:20:27,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:20:27,048 INFO L87 Difference]: Start difference. First operand 4001 states and 4553 transitions. Second operand 6 states. [2018-11-28 11:20:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:27,324 INFO L93 Difference]: Finished difference Result 4633 states and 5251 transitions. [2018-11-28 11:20:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:20:27,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 294 [2018-11-28 11:20:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:27,326 INFO L225 Difference]: With dead ends: 4633 [2018-11-28 11:20:27,326 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:20:27,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 295 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-28 11:20:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:20:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:20:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:20:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:20:27,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2018-11-28 11:20:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:27,333 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:20:27,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:20:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:20:27,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:20:27,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:20:27,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:27,940 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 262 [2018-11-28 11:20:28,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:28,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:29,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:30,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:30,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:30,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:30,066 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 268 [2018-11-28 11:20:31,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,333 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 244 [2018-11-28 11:20:31,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,618 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 372 DAG size of output: 240 [2018-11-28 11:20:31,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:31,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,452 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 251 [2018-11-28 11:20:32,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:32,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:33,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,125 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 401 DAG size of output: 267 [2018-11-28 11:20:34,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:34,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,163 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 401 DAG size of output: 267 [2018-11-28 11:20:35,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:35,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:20:36,057 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 85 [2018-11-28 11:20:37,155 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 268 DAG size of output: 104 [2018-11-28 11:20:38,137 WARN L180 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 98 [2018-11-28 11:20:41,899 WARN L180 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 417 DAG size of output: 161 [2018-11-28 11:20:44,631 WARN L180 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 393 DAG size of output: 112 [2018-11-28 11:20:44,902 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 1 [2018-11-28 11:20:45,005 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-11-28 11:20:46,296 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 285 DAG size of output: 123 [2018-11-28 11:20:48,026 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 477 DAG size of output: 95 [2018-11-28 11:20:48,228 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-11-28 11:20:49,416 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 274 DAG size of output: 107 [2018-11-28 11:20:49,607 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 1 [2018-11-28 11:20:49,784 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 1 [2018-11-28 11:20:51,243 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 378 DAG size of output: 99 [2018-11-28 11:20:52,473 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 377 DAG size of output: 91 [2018-11-28 11:20:52,618 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 1 [2018-11-28 11:20:53,772 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 247 DAG size of output: 103 [2018-11-28 11:20:54,361 WARN L180 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 82 [2018-11-28 11:20:54,996 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 92 [2018-11-28 11:20:55,949 WARN L180 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 100 [2018-11-28 11:20:56,863 WARN L180 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 98 [2018-11-28 11:20:58,469 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 378 DAG size of output: 99 [2018-11-28 11:21:01,669 WARN L180 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 384 DAG size of output: 151 [2018-11-28 11:21:02,768 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 260 DAG size of output: 103 [2018-11-28 11:21:04,106 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 494 DAG size of output: 79 [2018-11-28 11:21:05,654 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 425 DAG size of output: 107 [2018-11-28 11:21:09,379 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 417 DAG size of output: 161 [2018-11-28 11:21:09,601 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 1 [2018-11-28 11:21:10,800 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 271 DAG size of output: 108 [2018-11-28 11:21:11,494 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 491 DAG size of output: 1 [2018-11-28 11:21:13,802 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 413 DAG size of output: 143 [2018-11-28 11:21:15,223 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 308 DAG size of output: 94 [2018-11-28 11:21:17,648 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 387 DAG size of output: 88 [2018-11-28 11:21:18,109 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2018-11-28 11:21:19,272 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 271 DAG size of output: 108 [2018-11-28 11:21:21,393 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 299 DAG size of output: 136 [2018-11-28 11:21:22,110 WARN L180 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 89 [2018-11-28 11:21:22,470 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 94 [2018-11-28 11:21:24,085 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 404 DAG size of output: 101 [2018-11-28 11:21:24,292 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-11-28 11:21:24,829 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 91 [2018-11-28 11:21:24,926 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-11-28 11:21:24,927 INFO L448 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-11-28 11:21:24,927 INFO L448 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-11-28 11:21:24,927 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-11-28 11:21:24,927 INFO L444 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse13 (= 2 ~p_dw_st~0)) (.cse31 (not (= 0 ~c_dr_st~0))) (.cse24 (= ~p_dw_st~0 0))) (let ((.cse10 (not (= 0 ~p_num_write~0))) (.cse15 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (and .cse31 .cse24)) (.cse18 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 ~c_num_read~0))) (.cse26 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (< ~q_free~0 1)) (.cse9 (< 1 ~q_free~0)) (.cse27 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (and .cse31 .cse13)) (.cse25 (< 0 ~q_req_up~0)) (.cse28 (and .cse20 .cse13)) (.cse29 (< ~p_num_write~0 .cse32)) (.cse22 (not .cse0)) (.cse30 (< .cse32 ~p_num_write~0)) (.cse14 (not (= |old(~p_dw_st~0)| 2))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse21 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse17 (= 1 ~q_req_up~0)) (.cse12 (not (= ~q_read_ev~0 2))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse7 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse3 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse19 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse21 .cse1 .cse3 .cse22 .cse23 .cse16 .cse17 .cse4 .cse12 .cse14) (or .cse0 .cse1 .cse3 .cse24 .cse16 .cse4 .cse6) (or (= 0 ~p_dw_st~0) .cse3 .cse1 .cse12 .cse10 .cse15 .cse25 .cse0 .cse2 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse21 .cse1 .cse3 .cse16 .cse17 .cse4 .cse5 .cse12 .cse6 .cse7) (or .cse20 .cse0 .cse1 .cse3 .cse16 .cse19) (or (or .cse21 .cse26 .cse1 .cse2 .cse3 .cse22 .cse19 .cse14 .cse9 .cse27 .cse11 .cse25) .cse28) (or .cse21 .cse1 .cse3 .cse16 .cse19 .cse17 .cse20 .cse7 .cse14) (or .cse3 .cse1 .cse22 .cse12 .cse14 .cse26 .cse21 .cse2 .cse20 .cse19 .cse17 .cse9 .cse27 .cse11) (or .cse21 .cse1 .cse3 .cse16 .cse12 .cse13 .cse18 .cse7 .cse14 .cse8 .cse25) (or .cse3 .cse1 .cse22 .cse14 .cse26 .cse21 .cse2 .cse20 .cse19 .cse17 .cse7 .cse9 .cse27 .cse11) (or .cse3 .cse1 .cse22 .cse23 .cse14 .cse26 .cse21 .cse2 .cse17 .cse4 .cse7 .cse9 .cse27 .cse11) (or .cse3 .cse1 .cse22 .cse12 .cse14 .cse26 .cse21 .cse2 .cse17 .cse4 .cse9 .cse27 .cse11 .cse23) (or .cse23 .cse21 .cse1 .cse3 .cse22 .cse16 .cse17 .cse4 .cse7 .cse14) (or .cse21 .cse1 .cse3 .cse16 .cse19 .cse17 .cse12 .cse14 .cse20) (or .cse29 .cse3 .cse1 .cse22 .cse30 .cse12 (not .cse7) .cse14 (= 0 ~q_write_ev~0) .cse25 .cse16 .cse19 .cse28) (or .cse29 .cse21 .cse1 .cse3 .cse22 .cse16 .cse17 .cse13 .cse30 .cse7 .cse14) (or .cse0 .cse1 .cse3 .cse16 .cse4 .cse31) (or .cse21 .cse1 .cse3 .cse16 .cse19 .cse17 .cse12 .cse6 .cse7 .cse20)))) [2018-11-28 11:21:24,928 INFO L444 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)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse28 (= activate_threads_~tmp~1 0)) (.cse12 (= 2 ~p_dw_st~0))) (let ((.cse19 (not (= 0 ~p_num_write~0))) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse32 (and .cse16 .cse28 .cse12)) (.cse29 (and .cse16 .cse12)) (.cse27 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse21 (and .cse28 .cse12)) (.cse23 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse7 (< ~p_num_write~0 .cse33)) (.cse10 (= 1 ~q_req_up~0)) (.cse11 (< .cse33 ~p_num_write~0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse3 (not (= ~q_free~0 0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse22 (not (= ~q_read_ev~0 2))) (.cse8 (< ~q_write_ev~0 2)) (.cse30 (< ~p_num_write~0 ~c_num_read~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse15 (< ~q_free~0 1)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse9 (not .cse0)) (.cse25 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= |old(~p_dw_st~0)| 2))) (.cse18 (< 1 ~q_free~0)) (.cse31 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse24 (< 0 ~q_req_up~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse26 (= 2 ~c_dr_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse4 (and .cse16 .cse6) .cse5 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse4) (or .cse8 .cse1 .cse2 .cse3 .cse21 .cse22 .cse23 .cse13 .cse14 .cse17 .cse24) (or .cse0 .cse1 .cse15 .cse2 .cse25 .cse26 .cse5 .cse13 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse1 .cse22 .cse19 .cse27 .cse24 .cse0 .cse15 .cse5 (and (= 0 ~p_dw_st~0) .cse28) .cse13 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse25 .cse26) (or (and .cse16 .cse6 .cse28) .cse8 .cse1 .cse2 .cse3 .cse10 .cse4 .cse22 .cse5 .cse13) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse22 .cse26 .cse14) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse26 .cse13 .cse14) (or .cse8 .cse1 .cse2 .cse29 .cse9 .cse3 .cse10 .cse4 .cse13 .cse14) (or .cse2 .cse1 .cse9 .cse22 .cse14 .cse30 .cse8 .cse15 .cse26 .cse25 .cse10 .cse18 .cse31 .cse20) (or .cse7 .cse2 .cse1 .cse9 .cse11 .cse22 (not .cse13) .cse14 (= 0 ~q_write_ev~0) .cse24 .cse3 .cse25 (and .cse26 .cse28 .cse12)) (or .cse1 .cse2 .cse22 .cse19 .cse28 .cse0 .cse15 .cse4 .cse5 .cse13 .cse17 .cse18 .cse20) (or .cse2 .cse1 .cse9 .cse26 .cse14 .cse30 .cse8 .cse15 .cse25 .cse10 .cse13 .cse18 .cse31 .cse20) (or .cse8 .cse1 .cse2 .cse3 .cse25 .cse10 .cse22 .cse5 .cse26 .cse13) (or .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse22 .cse14 .cse32) (or .cse2 .cse1 .cse9 .cse32 .cse22 .cse14 .cse30 .cse8 .cse15 .cse10 .cse4 .cse18 .cse31 .cse20) (or .cse29 .cse2 .cse1 .cse9 .cse14 .cse30 .cse8 .cse15 .cse10 .cse4 .cse13 .cse18 .cse31 .cse20) (or .cse2 .cse1 .cse22 .cse14 .cse27 .cse3 .cse10 .cse21 .cse23 .cse13 .cse17) (or .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse22 .cse13 .cse14 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse28) (or (and .cse26 .cse12) (or .cse8 .cse30 .cse1 .cse15 .cse2 .cse9 .cse25 .cse14 .cse18 .cse31 .cse20 .cse24) (and (and .cse6 .cse26) (= ~q_read_ev~0 1)))))) [2018-11-28 11:21:24,928 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse13 (= 2 ~p_dw_st~0)) (.cse31 (not (= 0 ~c_dr_st~0))) (.cse24 (= ~p_dw_st~0 0))) (let ((.cse10 (not (= 0 ~p_num_write~0))) (.cse15 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (and .cse31 .cse24)) (.cse18 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 ~c_num_read~0))) (.cse26 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (< ~q_free~0 1)) (.cse9 (< 1 ~q_free~0)) (.cse27 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (and .cse31 .cse13)) (.cse25 (< 0 ~q_req_up~0)) (.cse28 (and .cse20 .cse13)) (.cse29 (< ~p_num_write~0 .cse32)) (.cse22 (not .cse0)) (.cse30 (< .cse32 ~p_num_write~0)) (.cse14 (not (= |old(~p_dw_st~0)| 2))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse21 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse17 (= 1 ~q_req_up~0)) (.cse12 (not (= ~q_read_ev~0 2))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse7 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse3 .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse19 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse21 .cse1 .cse3 .cse22 .cse23 .cse16 .cse17 .cse4 .cse12 .cse14) (or .cse0 .cse1 .cse3 .cse24 .cse16 .cse4 .cse6) (or (= 0 ~p_dw_st~0) .cse3 .cse1 .cse12 .cse10 .cse15 .cse25 .cse0 .cse2 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse21 .cse1 .cse3 .cse16 .cse17 .cse4 .cse5 .cse12 .cse6 .cse7) (or .cse20 .cse0 .cse1 .cse3 .cse16 .cse19) (or (or .cse21 .cse26 .cse1 .cse2 .cse3 .cse22 .cse19 .cse14 .cse9 .cse27 .cse11 .cse25) .cse28) (or .cse21 .cse1 .cse3 .cse16 .cse19 .cse17 .cse20 .cse7 .cse14) (or .cse3 .cse1 .cse22 .cse12 .cse14 .cse26 .cse21 .cse2 .cse20 .cse19 .cse17 .cse9 .cse27 .cse11) (or .cse21 .cse1 .cse3 .cse16 .cse12 .cse13 .cse18 .cse7 .cse14 .cse8 .cse25) (or .cse3 .cse1 .cse22 .cse14 .cse26 .cse21 .cse2 .cse20 .cse19 .cse17 .cse7 .cse9 .cse27 .cse11) (or .cse3 .cse1 .cse22 .cse23 .cse14 .cse26 .cse21 .cse2 .cse17 .cse4 .cse7 .cse9 .cse27 .cse11) (or .cse3 .cse1 .cse22 .cse12 .cse14 .cse26 .cse21 .cse2 .cse17 .cse4 .cse9 .cse27 .cse11 .cse23) (or .cse23 .cse21 .cse1 .cse3 .cse22 .cse16 .cse17 .cse4 .cse7 .cse14) (or .cse21 .cse1 .cse3 .cse16 .cse19 .cse17 .cse12 .cse14 .cse20) (or .cse29 .cse3 .cse1 .cse22 .cse30 .cse12 (not .cse7) .cse14 (= 0 ~q_write_ev~0) .cse25 .cse16 .cse19 .cse28) (or .cse29 .cse21 .cse1 .cse3 .cse22 .cse16 .cse17 .cse13 .cse30 .cse7 .cse14) (or .cse0 .cse1 .cse3 .cse16 .cse4 .cse31) (or .cse21 .cse1 .cse3 .cse16 .cse19 .cse17 .cse12 .cse6 .cse7 .cse20)))) [2018-11-28 11:21:24,929 INFO L448 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-11-28 11:21:24,929 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-11-28 11:21:24,929 INFO L444 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse5 (= 0 ~c_dr_st~0))) (let ((.cse11 (not (= 0 ~p_num_write~0))) (.cse17 (< 0 ~q_req_up~0)) (.cse20 (= exists_runnable_thread_~__retres1~2 1)) (.cse24 (not (= ~p_dw_st~0 2))) (.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse21 (not .cse5)) (.cse3 (not (= ~q_free~0 0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse4 (= 1 exists_runnable_thread_~__retres1~2)) (.cse22 (not .cse8)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse18 (not .cse0)) (.cse15 (not (= ~q_read_ev~0 2))) (.cse13 (< ~q_write_ev~0 2)) (.cse7 (< ~q_free~0 1)) (.cse19 (not (= 2 ~c_dr_st~0))) (.cse14 (= 1 ~q_req_up~0)) (.cse6 (not (= ~p_dw_st~0 0))) (.cse10 (< 1 ~q_free~0)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse15 .cse6 .cse4 .cse8) (or .cse2 .cse1 .cse15 .cse11 .cse16 .cse17 .cse0 .cse7 .cse6 .cse4 .cse8 .cse9 .cse10 .cse12) (or .cse2 .cse1 .cse18 .cse4 .cse15 .cse11 .cse16 .cse17 .cse7 .cse19 .cse6 .cse9 .cse10 .cse12) (or .cse20 .cse21 .cse22 (let ((.cse23 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse23) .cse13 .cse1 .cse2 .cse18 .cse3 .cse14 (< .cse23 ~p_num_write~0) .cse15 .cse24))) (or .cse2 .cse1 .cse20 .cse15 .cse22 .cse24 .cse16 .cse21 .cse0 .cse3 (not (= 1 ~p_num_write~0)) .cse9) (or .cse4 .cse22 (or .cse2 .cse1 .cse18 .cse15 (< ~p_num_write~0 ~c_num_read~0) .cse13 .cse7 .cse19 .cse14 .cse6 .cse10 (< ~c_num_read~0 ~p_num_write~0) .cse12))))) [2018-11-28 11:21:24,929 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-11-28 11:21:24,929 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-11-28 11:21:24,929 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-11-28 11:21:24,929 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-11-28 11:21:24,929 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-11-28 11:21:24,929 INFO L444 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0))) (let ((.cse5 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse6 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse7 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse19 (< ~q_free~0 1)) (.cse22 (not .cse18)) (.cse20 (< 1 ~q_free~0))) (let ((.cse0 (< |old(~q_write_ev~0)| 2)) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse8 (or .cse19 .cse22 .cse20)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (and (and .cse6 .cse7) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse15 (not (= |old(~q_read_ev~0)| 2))) (.cse10 (not (= ~p_dw_st~0 2))) (.cse11 (not (= 1 |old(~q_req_up~0)|))) (.cse9 (= ~p_dw_pc~0 1)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse23 (not (= ~q_free~0 0))) (.cse16 (= 0 ~c_dr_st~0)) (.cse17 (and .cse5 .cse7))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13)) (or .cse2 .cse3 .cse16 .cse17 .cse9 (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (or .cse18 .cse19 (not (= ~p_dw_st~0 0)) .cse20) .cse13) (or .cse14 (or .cse4 (let ((.cse21 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse21) .cse2 .cse3 .cse22 .cse23 (< .cse21 ~p_num_write~0) .cse15)) .cse10 .cse11 (= 0 |old(~q_write_ev~0)|)) (not .cse9)) (or .cse18 .cse2 .cse3 .cse23 .cse16 .cse17))))) [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-11-28 11:21:24,930 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse19 (= ~p_dw_pc~0 1)) (.cse26 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse10 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse34 (+ ~c_num_read~0 1)) (.cse33 (= 1 ~c_dr_pc~0)) (.cse4 (not (= |old(~q_read_ev~0)| 2)))) (let ((.cse29 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (not (= 1 ~p_num_write~0))) (.cse32 (or .cse33 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (.cse24 (not (= 0 ~c_num_read~0))) (.cse30 (not (= 0 ~p_num_write~0))) (.cse28 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (.cse0 (< ~p_num_write~0 .cse34)) (.cse3 (< .cse34 ~p_num_write~0)) (.cse7 (< 0 ~q_req_up~0)) (.cse8 (not (= ~q_free~0 0))) (.cse6 (not (= ~p_dw_st~0 2))) (.cse18 (= 0 ~c_dr_st~0)) (.cse13 (and .cse26 .cse10)) (.cse15 (< |old(~q_write_ev~0)| 2)) (.cse14 (< ~p_num_write~0 ~c_num_read~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse16 (< ~q_free~0 1)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not .cse33)) (.cse9 (not (= 2 ~c_dr_st~0))) (.cse17 (= 1 ~q_req_up~0)) (.cse31 (not (= ~p_dw_st~0 0))) (.cse20 (< 1 ~q_free~0)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse27 (= ~q_read_ev~0 1)) (.cse25 (not (= |old(~q_read_ev~0)| 1))) (.cse5 (not .cse19))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 |old(~q_write_ev~0)|) .cse7 .cse8 .cse9 (and .cse10 .cse11)) (or .cse1 .cse2 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse15 .cse2 .cse1 .cse8 .cse4 .cse13 .cse23 .cse19 .cse6 .cse24 .cse7) (or (or .cse15 .cse14 .cse2 .cse16 .cse1 .cse12 .cse17 .cse18 .cse6 .cse20 .cse21 .cse22) .cse25 (and .cse26 .cse27)) (or .cse13 .cse15 .cse2 .cse1 .cse8 .cse17 .cse18 .cse19 .cse6) (or .cse1 .cse2 (and .cse28 .cse29) .cse30 .cse7 .cse16 .cse31 .cse19 .cse24 .cse20 .cse32 .cse22) (or .cse0 .cse15 .cse2 .cse1 .cse12 .cse8 .cse17 .cse13 .cse3 .cse19 .cse6) (or .cse2 .cse1 .cse6 (and .cse10 .cse29) .cse8 .cse17 .cse23 .cse19 .cse24 .cse32) (or .cse33 .cse2 .cse16 .cse1 .cse18 .cse13 .cse31 .cse19 .cse24 .cse20 .cse30 .cse22) (or .cse33 .cse2 .cse1 .cse8 .cse18 .cse13) (or (or .cse15 .cse14 .cse2 .cse16 .cse1 .cse12 .cse9 .cse6 .cse20 .cse21 .cse22 .cse7) (and .cse28 .cse11)) (or .cse15 .cse2 .cse1 .cse8 .cse17 .cse18 .cse13 .cse4 .cse31 .cse19) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (and .cse10 (= 1 ~q_write_ev~0)) .cse7 .cse8 (not (= 1 |old(~q_write_ev~0)|))) (or .cse15 .cse2 .cse1 .cse13 .cse8 .cse17 .cse18 .cse4 .cse6) (or .cse1 .cse2 .cse12 .cse4 .cse6 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse13) (or (or .cse15 .cse14 .cse2 .cse16 .cse1 .cse12 .cse9 .cse17 .cse31 .cse20 .cse21 .cse22) (and .cse11 .cse27) .cse25 .cse5)))) [2018-11-28 11:21:24,930 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-11-28 11:21:24,931 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 223 240) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~q_read_ev~0 2)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (< 0 ~q_req_up~0) (= 1 ~c_dr_pc~0) (< ~q_free~0 1) (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (< 1 ~q_free~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-28 11:21:24,931 INFO L448 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-11-28 11:21:24,931 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-11-28 11:21:24,931 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-28 11:21:24,931 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-28 11:21:24,931 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-11-28 11:21:24,931 INFO L444 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-28 11:21:24,931 INFO L444 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= 2 ~q_read_ev~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (not (= ~p_dw_pc~0 1)) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (< 0 |old(~q_req_up~0)|)) [2018-11-28 11:21:24,931 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-11-28 11:21:24,932 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse7 (= 1 ~c_dr_pc~0))) (let ((.cse5 (< 0 |old(~q_req_up~0)|)) (.cse26 (not (= 2 ~c_dr_st~0))) (.cse13 (<= 1 ~q_free~0)) (.cse18 (<= ~q_free~0 1)) (.cse20 (= 0 ~p_num_write~0)) (.cse6 (= |old(~p_dw_st~0)| 0)) (.cse24 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse15 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= ~q_free~0 0)) (.cse14 (not (= 0 ~p_dw_st~0))) (.cse17 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse27 (< ~q_write_ev~0 2)) (.cse25 (not .cse7)) (.cse21 (not (= |old(~q_free~0)| 0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~q_read_ev~0 2))) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (< |old(~q_free~0)| 1)) (.cse22 (= 0 ~c_dr_st~0)) (.cse9 (= |old(~p_dw_pc~0)| 1)) (.cse10 (not (= 0 ~c_num_read~0))) (.cse11 (< 1 |old(~q_free~0)|)) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~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 .cse0 .cse21 .cse22 (and .cse23 .cse24 .cse15 .cse16)) (or (or .cse1 .cse8 .cse0 .cse25 .cse11) .cse2 .cse3 .cse4 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) .cse5 .cse6 .cse26 .cse10) (or .cse27 (and .cse14 .cse17 (and .cse24 .cse15 .cse18 .cse16 .cse13)) (not .cse9) (or .cse6 .cse26 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse0 .cse8 .cse25 .cse2 .cse11) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse22 (or .cse7 .cse1 .cse0 .cse8 .cse9 .cse11) .cse10 (and .cse15 .cse16 .cse13 .cse18 .cse20) .cse3) (or .cse6 (and .cse24 .cse15 .cse16 .cse23 .cse14 .cse17) .cse27 .cse1 .cse0 .cse25 .cse21 (= 1 |old(~q_req_up~0)|) .cse22 .cse2 .cse9) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12)))) [2018-11-28 11:21:24,932 INFO L444 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse12 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= 1 ~c_dr_pc~0))) (let ((.cse7 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (< 0 |old(~q_req_up~0)|)) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse23 (< ~q_write_ev~0 2)) (.cse14 (not (= 0 ~p_dw_st~0))) (.cse15 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= |old(~p_dw_st~0)| 0)) (.cse10 (not (= 2 ~c_dr_st~0))) (.cse3 (not .cse17)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse18 (and .cse12 .cse13)) (.cse16 (= 0 ~p_num_write~0)) (.cse22 (= 0 ~c_dr_st~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (< |old(~q_free~0)| 1)) (.cse19 (= |old(~p_dw_pc~0)| 1)) (.cse4 (< 1 |old(~q_free~0)|)) (.cse11 (not (= 0 ~c_num_read~0))) (.cse6 (not (= 0 |old(~p_num_write~0)|)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16)) (or .cse2 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse1 (and .cse14 .cse15 .cse18 .cse16) .cse19 .cse11 .cse4 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse17 .cse0 .cse2 .cse20 (and (= ~q_free~0 0) (= 1 |old(~p_dw_pc~0)|) .cse21 .cse12 .cse13) .cse22) (or .cse9 .cse23 .cse0 .cse2 .cse20 (= 1 |old(~q_req_up~0)|) .cse22 .cse5 .cse19) (or .cse23 (not .cse19) (and .cse14 .cse15 (and .cse21 .cse12 .cse13)) (or .cse9 .cse10 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse0 .cse2 .cse1 .cse3 .cse5 .cse4) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or (and .cse18 .cse16) .cse22 (or .cse17 .cse0 .cse2 .cse1 .cse19 .cse4) .cse11 .cse6)))) [2018-11-28 11:21:24,932 INFO L444 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse5 (= 1 ~c_dr_pc~0)) (.cse31 (+ |old(~p_num_write~0)| 1)) (.cse0 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 0)) (.cse19 (not (= 0 ~p_dw_st~0))) (.cse3 (= 1 ~p_num_write~0))) (let ((.cse21 (< 0 |old(~q_req_up~0)|)) (.cse24 (and .cse0 .cse1 .cse2 .cse19 .cse3)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~q_free~0 1)) (.cse14 (= 0 ~p_num_write~0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse25 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse29 (= ~p_dw_pc~0 1)) (.cse30 (<= .cse31 ~p_num_write~0)) (.cse23 (not (= 2 ~c_dr_st~0))) (.cse8 (< |old(~q_free~0)| 1)) (.cse10 (< 1 |old(~q_free~0)|)) (.cse22 (= |old(~p_dw_st~0)| 0)) (.cse28 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse20 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse32 (< ~q_write_ev~0 2)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse16 (not .cse5)) (.cse27 (not (= |old(~q_free~0)| 0))) (.cse4 (= 0 ~c_dr_st~0)) (.cse17 (not (= ~q_read_ev~0 2))) (.cse9 (= |old(~p_dw_pc~0)| 1))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse0 .cse1 .cse12 .cse13 .cse14) .cse15) (or (or .cse6 .cse8 .cse7 .cse16 .cse10) .cse17 .cse15 .cse18 (and .cse12 .cse19 .cse0 .cse1 .cse20 .cse13 .cse14) .cse21 .cse22 .cse23 .cse11 .cse24) (or .cse7 .cse6 .cse17 .cse15 .cse18 .cse21 .cse22 .cse5 .cse8 .cse9 .cse11 .cse10 .cse25 .cse24 (and .cse12 .cse19 .cse0 .cse1 .cse20 .cse13 .cse26 .cse14)) (or .cse3 .cse7 .cse6 .cse17 .cse26 .cse15 .cse18 .cse5 .cse8 .cse4 .cse9 .cse11 .cse10 .cse25) (or .cse5 .cse6 .cse7 .cse27 .cse4 (and .cse2 .cse28 .cse0 (not .cse29) .cse1) (and .cse2 (= 1 |old(~p_dw_pc~0)|) .cse0 .cse1 .cse30 (<= ~p_num_write~0 .cse31))) (or .cse32 (not .cse9) (and .cse29 .cse1 .cse30 .cse2 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (or .cse22 .cse23 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse6 .cse7 .cse8 .cse16 .cse17 .cse10) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse22 (and .cse28 .cse0 .cse1 .cse2 .cse19 .cse20) .cse32 .cse6 .cse7 .cse16 .cse27 (= 1 |old(~q_req_up~0)|) .cse4 .cse17 .cse9)))) [2018-11-28 11:21:24,933 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-11-28 11:21:24,933 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-11-28 11:21:24,933 INFO L444 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse28 (+ |old(~p_num_write~0)| 1))) (let ((.cse26 (= 1 |old(~p_dw_pc~0)|)) (.cse0 (= 0 ~c_dr_st~0)) (.cse24 (<= .cse28 ~p_num_write~0)) (.cse27 (= ~p_dw_i~0 1)) (.cse1 (= 1 ~c_dr_pc~0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~q_free~0 0)) (.cse22 (= 2 ~p_dw_st~0)) (.cse10 (= 1 ~p_num_write~0))) (let ((.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse15 (< 0 |old(~q_req_up~0)|)) (.cse16 (and .cse23 .cse11 .cse9 .cse22 .cse10)) (.cse7 (not (= 0 ~c_num_read~0))) (.cse19 (< ~q_write_ev~0 2)) (.cse5 (= |old(~p_dw_pc~0)| 1)) (.cse17 (= |old(~p_dw_st~0)| 0)) (.cse18 (not (= 2 ~c_dr_st~0))) (.cse4 (< |old(~q_free~0)| 1)) (.cse12 (not .cse1)) (.cse13 (not (= ~q_read_ev~0 2))) (.cse6 (< 1 |old(~q_free~0)|)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse27)) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse25 (and .cse9 (not (= ~c_dr_pc~0 1)) .cse26 (not .cse0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse27 .cse11 .cse24 (<= ~p_num_write~0 .cse28)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 (and .cse9 .cse10 .cse11)) (or (or .cse2 .cse4 .cse3 .cse12 .cse6) .cse13 .cse8 .cse14 .cse15 .cse16 .cse17 .cse18 .cse7) (or .cse17 .cse19 .cse2 .cse3 .cse12 .cse20 (= 1 |old(~q_req_up~0)|) (and .cse21 .cse11 .cse9 .cse22 (= |old(~q_req_up~0)| ~q_req_up~0)) .cse0 .cse13 .cse5) (or .cse3 .cse2 .cse13 .cse8 .cse14 .cse15 .cse17 .cse1 .cse4 .cse16 .cse5 .cse7 .cse6 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse19 (not .cse5) (and .cse23 .cse11 .cse24 .cse9 .cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (or .cse17 .cse18 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse2 .cse3 .cse4 .cse12 .cse13 .cse6) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse1 .cse2 .cse3 .cse20 .cse0 .cse25 (not .cse26)) (or .cse1 .cse2 .cse3 .cse20 .cse0 (and .cse9 .cse21 .cse11) .cse25))))) [2018-11-28 11:21:24,933 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-11-28 11:21:24,933 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-28 11:21:24,933 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-28 11:21:24,933 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-28 11:21:24,933 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-28 11:21:24,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:21:24,934 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= |old(~q_req_up~0)| ~q_req_up~0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2018-11-28 11:21:24,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:21:24,934 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-28 11:21:24,934 INFO L451 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-11-28 11:21:24,934 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-28 11:21:24,934 INFO L451 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-11-28 11:21:24,934 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-11-28 11:21:24,934 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-11-28 11:21:24,934 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-11-28 11:21:24,935 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse51 (+ ~c_num_read~0 1))) (let ((.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse31 (= 1 |old(~c_dr_pc~0)|)) (.cse50 (+ |old(~c_num_read~0)| 1)) (.cse41 (not (= ~c_dr_pc~0 1))) (.cse36 (= ~c_num_read~0 0)) (.cse46 (<= .cse51 ~p_num_write~0)) (.cse47 (<= ~p_num_write~0 .cse51)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (<= 1 ~q_free~0)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= ~q_free~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse34 (not (= 0 ~c_dr_st~0))) (.cse16 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse35 (= ~q_free~0 0)) (.cse48 (= 2 ~p_dw_st~0)) (.cse22 (= |old(~q_req_up~0)| ~q_req_up~0))) (let ((.cse9 (and .cse15 .cse34 .cse16 .cse18 .cse19 .cse35 .cse48 .cse22)) (.cse42 (= 0 ~p_num_write~0)) (.cse33 (not (= 0 |old(~p_num_write~0)|))) (.cse17 (= ~p_dw_st~0 0)) (.cse27 (not (= |old(~p_dw_st~0)| 0))) (.cse45 (and .cse14 .cse15 .cse34 .cse16 .cse18 .cse19 .cse20 .cse21 .cse48 .cse22 .cse23 .cse24)) (.cse25 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse26 (< |old(~q_free~0)| 1)) (.cse28 (< 1 |old(~q_free~0)|)) (.cse29 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse30 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse39 (and .cse46 .cse15 .cse16 .cse18 .cse19 .cse35 .cse48 .cse22 .cse47)) (.cse43 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse0 (< ~q_write_ev~0 2)) (.cse49 (and .cse41 .cse16 .cse19 .cse36 .cse35 .cse48 .cse22 (= 1 ~p_num_write~0))) (.cse37 (not (= 1 |old(~p_num_write~0)|))) (.cse32 (not (= 0 |old(~c_num_read~0)|))) (.cse38 (< |old(~p_num_write~0)| .cse50)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not .cse31)) (.cse40 (< .cse50 |old(~p_num_write~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse13 (not .cse12)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse44 (< 0 |old(~q_req_up~0)|)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (= 2 ~c_dr_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 .cse12 .cse7) (or .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse2 .cse1 .cse10 .cse6 .cse25 .cse0 .cse26 .cse4 .cse5 .cse27 .cse28 .cse29 .cse30)) (or .cse31 .cse1 .cse26 .cse2 .cse4 .cse8 .cse27 .cse12 .cse32 .cse28 .cse33 .cse30) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 (and .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse35 .cse22) .cse6 .cse27 .cse12) (or .cse31 .cse1 .cse2 .cse3 .cse36 .cse11 .cse37 .cse32) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse28 .cse29 .cse30) (or .cse38 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse39 .cse40 .cse12 .cse7) (or (and .cse20 .cse41 .cse16 (= 0 ~p_dw_st~0) .cse19 .cse36 .cse22 .cse23 .cse24 .cse42) .cse2 .cse1 .cse6 .cse33 .cse43 .cse44 .cse31 .cse26 .cse27 .cse12 .cse32 .cse28 .cse30) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse31 .cse1 .cse26 .cse2 .cse11 (and .cse41 .cse34 .cse16 .cse17 .cse19 .cse20 .cse36 .cse23 .cse24 .cse42) .cse27 .cse12 .cse32 .cse28 .cse33 .cse30) (or .cse31 .cse1 .cse2 .cse17 .cse3 .cse11 .cse27) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse28 .cse29 .cse30 .cse45) (or .cse38 .cse1 .cse2 .cse10 (and .cse46 .cse47) .cse40 .cse6 .cse0 .cse3 .cse5 .cse11 .cse27 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse25 .cse0 .cse26 .cse8 .cse4 .cse5 .cse12 .cse28 .cse29 .cse30) (or (or .cse0 .cse25 .cse1 .cse26 .cse2 .cse10 .cse4 .cse7 .cse28 .cse29 .cse30 .cse44) (and .cse14 .cse15 .cse16 .cse8 .cse18 .cse19 .cse20 .cse21 .cse48 .cse22 .cse23 .cse24)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse45 .cse7 .cse25 .cse0 .cse26 .cse5 .cse11 .cse12 .cse28 .cse29 .cse30) (or (or .cse38 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse40 .cse6 .cse7) .cse39) (or .cse8 .cse31 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse1 .cse6 .cse49 .cse7 .cse43 .cse31 .cse3 .cse5 .cse37 .cse12 .cse32) (or .cse31 .cse1 .cse2 .cse3 .cse11 (and .cse35 .cse41 .cse15 .cse34 .cse16 .cse19)) (or .cse31 .cse0 .cse1 .cse2 .cse3 .cse6 .cse49 .cse37 .cse12 .cse7 .cse32 .cse44) (or .cse38 .cse2 .cse1 .cse10 .cse40 .cse6 .cse13 .cse7 (= 0 ~q_write_ev~0) .cse44 .cse3 .cse4 (and .cse46 .cse15 (= ~p_dw_pc~0 1) .cse8 .cse18 .cse19 .cse35 .cse48 .cse22 .cse47)))))) [2018-11-28 11:21:24,935 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-11-28 11:21:24,935 INFO L448 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-11-28 11:21:24,935 INFO L444 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse39 (= 1 |old(~c_dr_pc~0)|)) (.cse56 (+ ~c_num_read~0 1)) (.cse31 (= |old(~p_dw_pc~0)| 1)) (.cse57 (+ |old(~c_num_read~0)| 1)) (.cse54 (= ~p_dw_st~0 0)) (.cse55 (= ~p_dw_i~0 1)) (.cse58 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (= 2 ~c_dr_st~0)) (.cse53 (= ~c_num_read~0 1)) (.cse47 (not (= ~c_dr_pc~0 1))) (.cse50 (= ~c_num_read~0 0)) (.cse6 (= ~q_free~0 0)) (.cse51 (= 1 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse3 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse4 (= 1 ~c_dr_pc~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= 1 ~q_free~0)) (.cse25 (<= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse8 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse26 (<= ~q_free~0 1)) (.cse27 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse37 (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse25 .cse7 .cse8 .cse26 .cse27)) (.cse32 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse41 (and .cse47 .cse3 .cse5 .cse50 .cse6 .cse7 .cse8 .cse51)) (.cse45 (not (= 1 |old(~p_num_write~0)|))) (.cse44 (and .cse3 .cse23 .cse4 .cse5 .cse53 .cse24 .cse7 .cse26 .cse51 .cse27)) (.cse42 (not .cse58)) (.cse43 (and .cse47 .cse2 .cse5 (= 2 ~q_read_ev~0) .cse6 .cse58 .cse55)) (.cse48 (and .cse6 .cse47 .cse2 .cse55 .cse5)) (.cse52 (and .cse47 .cse2 .cse3 .cse54 .cse5 .cse24 .cse50 .cse26 .cse27 (= 0 ~p_num_write~0))) (.cse29 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (.cse11 (< |old(~p_num_write~0)| .cse57)) (.cse18 (< .cse57 |old(~p_num_write~0)|)) (.cse10 (not .cse31)) (.cse20 (not (= |old(~p_dw_st~0)| 2))) (.cse40 (< 0 |old(~q_req_up~0)|)) (.cse0 (<= .cse56 ~p_num_write~0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse9 (<= ~p_num_write~0 .cse56)) (.cse49 (not (= 0 |old(~p_num_write~0)|))) (.cse33 (< |old(~q_free~0)| 1)) (.cse28 (not (= 2 |old(~c_dr_st~0)|))) (.cse46 (not (= 0 |old(~c_num_read~0)|))) (.cse34 (< 1 |old(~q_free~0)|)) (.cse36 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse12 (< ~q_write_ev~0 2)) (.cse13 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse14 (not .cse55)) (.cse15 (not .cse39)) (.cse16 (not (= |old(~q_free~0)| 0))) (.cse17 (= 1 |old(~q_req_up~0)|)) (.cse30 (= 0 |old(~c_dr_st~0)|)) (.cse19 (not (= ~q_read_ev~0 2))) (.cse38 (not (= |old(~p_dw_st~0)| 0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse1 .cse22 .cse23 .cse4 .cse5 .cse24 .cse25 .cse7 .cse26 .cse27)) (or .cse12 .cse13 .cse14 .cse16 .cse28 .cse17 .cse19 .cse20 .cse23) (or .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse31 .cse20) (or .cse14 .cse13 .cse15 .cse19 .cse20 .cse32 .cse12 .cse33 .cse17 .cse30 .cse34 .cse35 .cse36 .cse37) (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse18 .cse31 .cse20 (and .cse21 .cse1 .cse3 .cse23 .cse4 .cse5 .cse24 .cse25 .cse7 .cse26 .cse27)) (or .cse11 .cse13 .cse14 .cse15 (and .cse0 .cse9) .cse18 .cse19 .cse12 .cse16 .cse17 .cse30 .cse38 .cse31) (or .cse14 .cse13 .cse15 .cse20 .cse32 .cse12 .cse33 .cse23 .cse28 .cse17 .cse31 .cse34 .cse35 .cse36) (or .cse39 .cse13 .cse14 .cse16 .cse28 .cse23) (or (or .cse12 .cse32 .cse13 .cse33 .cse14 .cse15 .cse28 .cse20 .cse34 .cse35 .cse36 .cse40) (and .cse21 .cse1 .cse3 .cse23 .cse4 .cse5 .cse24 .cse25 .cse7 .cse8 .cse26 .cse27)) (or (and (and .cse0 .cse23 .cse4 .cse5 .cse6 .cse7 .cse9) .cse22) .cse10 (or .cse14 .cse13 .cse15 .cse19 .cse32 .cse12 .cse33 .cse28 .cse17 .cse38 .cse34 .cse35 .cse36)) (or .cse12 .cse13 .cse14 .cse16 .cse28 .cse17 .cse19 .cse38 .cse31 .cse23) (or .cse14 .cse13 .cse15 .cse37 .cse20 .cse32 .cse12 .cse33 .cse17 .cse30 .cse31 .cse34 .cse35 .cse36) (or .cse14 .cse13 .cse15 .cse19 .cse20 .cse32 .cse12 .cse33 .cse23 .cse28 .cse17 .cse34 .cse35 .cse36) (or .cse14 .cse13 .cse19 .cse41 .cse20 .cse42 .cse43 .cse39 .cse16 .cse17 .cse44 .cse45 .cse31 .cse46) (or .cse13 .cse14 .cse19 .cse41 .cse20 .cse40 .cse39 .cse12 .cse16 .cse45 .cse31 .cse46 .cse44 (and .cse6 .cse47 .cse2 .cse5)) (or .cse48 .cse39 .cse13 .cse14 .cse16 .cse30) (or .cse14 .cse13 .cse19 .cse49 .cse42 .cse43 .cse40 (and .cse22 .cse23 .cse5 .cse50 .cse6 .cse7 .cse51) .cse39 .cse33 .cse52 (and .cse23 .cse53 .cse24 .cse22 .cse4 .cse5 .cse7 .cse26 .cse51 .cse27) .cse38 .cse31 .cse46 .cse34 .cse36) (or .cse13 .cse14 .cse49 .cse48 .cse39 .cse33 .cse30 .cse52 .cse38 .cse31 .cse46 .cse34 .cse36) (or .cse12 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse30 .cse19 .cse20) (or .cse12 .cse13 .cse14 .cse16 .cse28 .cse17 .cse23 .cse31 .cse20) (or .cse11 .cse14 .cse13 .cse15 .cse18 .cse19 .cse10 .cse20 (= 0 ~q_write_ev~0) .cse40 .cse16 .cse28 (and .cse0 .cse1 .cse22 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse13 .cse14 .cse49 .cse39 .cse33 .cse28 .cse23 .cse38 .cse31 .cse46 .cse34 .cse36) (or .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) .cse30 (and .cse1 .cse2 .cse3 .cse54 .cse4 .cse5 .cse6 .cse8) .cse19 .cse38 .cse31)))) [2018-11-28 11:21:24,935 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-11-28 11:21:24,936 INFO L444 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse63 (+ ~c_num_read~0 1))) (let ((.cse35 (= 1 |old(~c_dr_pc~0)|)) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse61 (+ |old(~c_num_read~0)| 1)) (.cse59 (= ~p_dw_st~0 0)) (.cse41 (= 0 ~p_num_write~0)) (.cse32 (<= .cse63 ~p_num_write~0)) (.cse33 (<= ~p_num_write~0 .cse63)) (.cse8 (= 2 ~c_dr_st~0)) (.cse52 (= ~c_num_read~0 1)) (.cse40 (= ~c_num_read~0 0)) (.cse45 (= 1 ~p_num_write~0)) (.cse38 (not (= ~c_dr_pc~0 1))) (.cse43 (= ~q_free~0 0)) (.cse60 (= ~p_dw_i~0 1)) (.cse62 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse56 (not (= 0 ~c_dr_st~0))) (.cse24 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse25 (= 1 ~c_dr_pc~0)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (<= 1 ~q_free~0)) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse29 (= 2 ~p_dw_st~0)) (.cse37 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse30 (<= ~q_free~0 1)) (.cse31 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse18 (and .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse37 .cse30 .cse31)) (.cse50 (not .cse62)) (.cse46 (and .cse38 .cse56 .cse26 (= 2 ~q_read_ev~0) .cse43 .cse62 .cse60)) (.cse53 (and .cse38 .cse24 .cse26 .cse40 .cse43 .cse29 .cse37 .cse45)) (.cse55 (not (= 1 |old(~p_num_write~0)|))) (.cse54 (and .cse24 .cse8 .cse25 .cse26 .cse52 .cse27 .cse29 .cse30 .cse45 .cse31)) (.cse20 (and .cse32 .cse23 .cse24 .cse25 .cse26 .cse43 .cse29 .cse37 .cse33)) (.cse13 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse16 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse44 (not (= 0 eval_~tmp___1~0))) (.cse57 (and .cse43 .cse38 .cse56 .cse60 .cse26)) (.cse51 (and .cse38 .cse56 .cse24 .cse59 .cse26 .cse27 .cse40 .cse30 .cse31 .cse41)) (.cse9 (and .cse23 .cse56 .cse24 .cse25 .cse26 .cse43 .cse29 .cse37)) (.cse19 (< |old(~p_num_write~0)| .cse61)) (.cse21 (< .cse61 |old(~p_num_write~0)|)) (.cse58 (not .cse12)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse36 (< 0 |old(~q_req_up~0)|)) (.cse42 (= ~p_dw_pc~0 1)) (.cse49 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse48 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (< 1 |old(~q_free~0)|)) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse60)) (.cse10 (not .cse35)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse34 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 .cse12 .cse7) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse13 .cse0 .cse14 .cse5 .cse11 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse20 .cse21 .cse12 .cse7 (and .cse22 .cse23 .cse24 .cse8 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)) (or .cse19 .cse1 .cse2 .cse10 (and .cse32 .cse33) .cse21 .cse6 .cse0 .cse3 .cse5 .cse11 .cse34 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse13 .cse0 .cse14 .cse8 .cse4 .cse5 .cse12 .cse15 .cse16 .cse17) (or .cse35 .cse1 .cse2 .cse3 .cse4 .cse8) (or (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse10 .cse4 .cse7 .cse15 .cse16 .cse17 .cse36) (and .cse22 .cse23 .cse24 .cse8 .cse25 .cse26 .cse27 .cse28 .cse29 .cse37 .cse30 .cse31)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse34 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse18 .cse7 .cse13 .cse0 .cse14 .cse5 .cse11 .cse12 .cse15 .cse16 .cse17) (let ((.cse39 (= 0 ~p_dw_st~0)) (.cse47 (= eval_~tmp___1~0 1))) (or (and .cse27 .cse38 .cse24 .cse39 .cse26 .cse40 .cse37 .cse30 .cse31 .cse41) .cse2 (and .cse42 (and .cse8 .cse26 .cse40 .cse43 .cse29 .cse44 .cse45)) .cse46 .cse36 (and .cse47 .cse8 .cse27 .cse24 .cse39 .cse26 .cse40 .cse37 .cse30 .cse31 .cse41) (and .cse38 .cse47 .cse42 .cse26 .cse40 .cse43 .cse29 .cse45) .cse35 .cse14 .cse12 .cse48 .cse15 .cse17 .cse1 .cse6 .cse49 .cse50 .cse51 .cse34 (and (and .cse8 .cse25 .cse26 .cse52 .cse27 .cse29 .cse30 .cse44 .cse45 .cse31) .cse42))) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse13 .cse0 .cse14 .cse8 .cse4 .cse5 .cse15 .cse16 .cse17) (or .cse2 .cse1 .cse6 .cse53 .cse7 .cse50 .cse46 .cse35 .cse3 .cse5 .cse54 .cse55 .cse12 .cse48) (or .cse1 .cse2 .cse6 .cse53 .cse7 .cse36 .cse35 .cse0 .cse3 .cse55 .cse12 .cse48 .cse54 (and .cse43 .cse38 .cse56 .cse26)) (or .cse57 .cse35 .cse1 .cse2 .cse3 .cse11) (or (and .cse22 .cse23 .cse24 .cse8 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse44 .cse31) .cse58 (or .cse19 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse21 .cse6 .cse7) .cse20) (or .cse58 (and .cse22 .cse23 .cse24 .cse59 .cse8 .cse25 .cse26 .cse27 .cse28 .cse37 .cse30 .cse31) (or .cse2 .cse1 .cse10 .cse6 .cse13 .cse0 .cse14 .cse4 .cse5 .cse34 .cse15 .cse16 .cse17) (and (and .cse32 .cse8 .cse25 .cse26 .cse43 .cse29 .cse44 .cse33) .cse42)) (or .cse1 .cse2 .cse49 .cse57 .cse35 .cse14 .cse11 .cse51 .cse34 .cse12 .cse48 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse19 .cse2 .cse1 .cse10 .cse21 .cse6 .cse58 .cse7 (= 0 ~q_write_ev~0) .cse36 .cse3 .cse4 (and .cse32 .cse23 .cse42 .cse8 .cse25 .cse26 .cse43 .cse29 .cse37 .cse33)) (or .cse1 .cse2 .cse49 .cse35 .cse14 .cse4 .cse8 .cse34 .cse12 .cse48 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse23 .cse56 .cse25 .cse26 .cse43 .cse29 .cse37) .cse11 (and .cse23 .cse56 .cse24 .cse59 .cse25 .cse26 .cse43 .cse37) .cse6 .cse34 .cse12))))) [2018-11-28 11:21:24,936 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-11-28 11:21:24,936 INFO L444 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse47 (+ |old(~c_num_read~0)| 1)) (.cse49 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse24 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse48 (= 2 ~q_read_ev~0)) (.cse26 (<= 1 ~q_free~0)) (.cse27 (= ~c_num_read~0 0)) (.cse28 (<= ~q_free~0 1)) (.cse45 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= 0 ~p_num_write~0)) (.cse35 (= ~q_free~0 0)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse23 (not (= 0 ~c_dr_st~0))) (.cse46 (= ~p_dw_i~0 1)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= |old(~p_dw_pc~0)| 1))) (let ((.cse33 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse16 (not .cse8)) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (and .cse35 .cse22 .cse23 .cse46 .cse25)) (.cse38 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse39 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse5 (= 2 ~c_dr_st~0)) (.cse34 (= 1 ~c_dr_pc~0)) (.cse43 (= eval_~tmp___1~0 1)) (.cse36 (not (= 0 ~p_dw_st~0))) (.cse37 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse44 (and .cse22 .cse23 .cse24 .cse25 .cse48 .cse26 .cse27 .cse28 .cse45 .cse46 .cse29)) (.cse2 (not (= 0 |old(~p_num_write~0)|))) (.cse40 (not .cse49)) (.cse41 (and .cse22 .cse23 .cse25 .cse48 .cse35 .cse49 .cse46)) (.cse4 (< |old(~q_free~0)| 1)) (.cse21 (= 0 |old(~c_dr_st~0)|)) (.cse7 (not (= |old(~p_dw_st~0)| 0))) (.cse10 (< 1 |old(~q_free~0)|)) (.cse11 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse12 (< |old(~p_num_write~0)| .cse47)) (.cse13 (not .cse3)) (.cse31 (= 1 |old(~q_req_up~0)|)) (.cse14 (< .cse47 |old(~p_num_write~0)|)) (.cse30 (< ~q_write_ev~0 2)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse46)) (.cse19 (not (= |old(~q_free~0)| 0))) (.cse15 (not (= ~q_read_ev~0 2))) (.cse42 (not (= 1 |old(~p_num_write~0)|))) (.cse17 (not (= |old(~p_dw_st~0)| 2))) (.cse9 (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 .cse11) (or .cse12 .cse1 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 (= 0 ~q_write_ev~0) .cse18 .cse19 .cse6) (or .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse21 .cse7 .cse8 .cse9 .cse10 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse11) (or .cse12 .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse14 .cse8 .cse17) (or (let ((.cse32 (+ ~c_num_read~0 1))) (and (<= .cse32 ~p_num_write~0) (<= ~p_num_write~0 .cse32))) .cse12 .cse0 .cse1 .cse13 .cse14 .cse15 .cse30 .cse19 .cse31 .cse21 .cse7 .cse8) (or .cse3 .cse0 .cse1 .cse19 .cse6 .cse5) (or .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse21 .cse15 .cse17) (or .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse21 .cse8 .cse17) (or .cse30 .cse0 .cse1 .cse19 .cse6 .cse31 .cse15 .cse5 .cse7 .cse8) (or (and .cse33 .cse23 .cse24 .cse34 .cse25 .cse35 .cse36 .cse37) .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse21 .cse15 .cse7 .cse8) (or .cse30 .cse38 .cse0 .cse4 .cse1 .cse13 .cse6 .cse17 .cse10 .cse39 .cse11 .cse18) (or .cse1 .cse0 .cse13 .cse17 .cse38 .cse30 .cse4 .cse31 .cse21 .cse8 .cse10 .cse39 .cse11) (or .cse1 .cse0 .cse15 .cse17 .cse40 .cse41 .cse19 .cse31 .cse42 .cse8 .cse9) (or (and .cse43 (and .cse36 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse33 .cse24 .cse28 .cse34 .cse25 .cse26) .cse5)) .cse16 (or .cse1 .cse0 .cse13 .cse15 .cse38 .cse30 .cse4 .cse6 .cse31 .cse7 .cse10 .cse39 .cse11)) (or .cse20 .cse3 .cse0 .cse1 .cse19 .cse21) (or .cse1 .cse0 .cse13 .cse15 .cse17 .cse38 .cse30 .cse4 .cse31 .cse21 .cse10 .cse39 .cse11) (or .cse1 .cse0 .cse44 .cse15 .cse2 .cse40 .cse41 .cse18 .cse3 (and .cse43 .cse5 .cse26 .cse36 .cse24 .cse34 .cse25 .cse27 .cse37 .cse28 .cse29) .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse43 .cse26 .cse36 .cse22 .cse24 .cse25 .cse27 .cse37 .cse28 .cse45 .cse29)) (or .cse1 .cse0 .cse15 .cse44 .cse2 .cse40 .cse41 .cse3 .cse4 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse30 .cse0 .cse1 .cse13 .cse19 .cse31 .cse14 .cse15 .cse17) (or .cse30 .cse0 .cse1 .cse19 .cse15 .cse42 .cse8 .cse17 .cse9 (and .cse35 .cse22 .cse23 .cse25) .cse18)))) [2018-11-28 11:21:24,936 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-11-28 11:21:24,936 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-11-28 11:21:24,936 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-28 11:21:24,937 INFO L444 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse63 (+ ~c_num_read~0 1))) (let ((.cse35 (= 1 |old(~c_dr_pc~0)|)) (.cse12 (= |old(~p_dw_pc~0)| 1)) (.cse61 (+ |old(~c_num_read~0)| 1)) (.cse59 (= ~p_dw_st~0 0)) (.cse41 (= 0 ~p_num_write~0)) (.cse32 (<= .cse63 ~p_num_write~0)) (.cse33 (<= ~p_num_write~0 .cse63)) (.cse8 (= 2 ~c_dr_st~0)) (.cse52 (= ~c_num_read~0 1)) (.cse40 (= ~c_num_read~0 0)) (.cse45 (= 1 ~p_num_write~0)) (.cse38 (not (= ~c_dr_pc~0 1))) (.cse43 (= ~q_free~0 0)) (.cse60 (= ~p_dw_i~0 1)) (.cse62 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse56 (not (= 0 ~c_dr_st~0))) (.cse24 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse25 (= 1 ~c_dr_pc~0)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (<= 1 ~q_free~0)) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse29 (= 2 ~p_dw_st~0)) (.cse37 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse30 (<= ~q_free~0 1)) (.cse31 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse18 (and .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse37 .cse30 .cse31)) (.cse50 (not .cse62)) (.cse46 (and .cse38 .cse56 .cse26 (= 2 ~q_read_ev~0) .cse43 .cse62 .cse60)) (.cse53 (and .cse38 .cse24 .cse26 .cse40 .cse43 .cse29 .cse37 .cse45)) (.cse55 (not (= 1 |old(~p_num_write~0)|))) (.cse54 (and .cse24 .cse8 .cse25 .cse26 .cse52 .cse27 .cse29 .cse30 .cse45 .cse31)) (.cse20 (and .cse32 .cse23 .cse24 .cse25 .cse26 .cse43 .cse29 .cse37 .cse33)) (.cse13 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse16 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse44 (not (= 0 eval_~tmp___1~0))) (.cse57 (and .cse43 .cse38 .cse56 .cse60 .cse26)) (.cse51 (and .cse38 .cse56 .cse24 .cse59 .cse26 .cse27 .cse40 .cse30 .cse31 .cse41)) (.cse9 (and .cse23 .cse56 .cse24 .cse25 .cse26 .cse43 .cse29 .cse37)) (.cse19 (< |old(~p_num_write~0)| .cse61)) (.cse21 (< .cse61 |old(~p_num_write~0)|)) (.cse58 (not .cse12)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse36 (< 0 |old(~q_req_up~0)|)) (.cse42 (= ~p_dw_pc~0 1)) (.cse49 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (< |old(~q_free~0)| 1)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse48 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (< 1 |old(~q_free~0)|)) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse60)) (.cse10 (not .cse35)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse34 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse11 .cse12 .cse7) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse13 .cse0 .cse14 .cse5 .cse11 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse20 .cse21 .cse12 .cse7 (and .cse22 .cse23 .cse24 .cse8 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)) (or .cse19 .cse1 .cse2 .cse10 (and .cse32 .cse33) .cse21 .cse6 .cse0 .cse3 .cse5 .cse11 .cse34 .cse12) (or .cse2 .cse1 .cse10 .cse7 .cse13 .cse0 .cse14 .cse8 .cse4 .cse5 .cse12 .cse15 .cse16 .cse17) (or .cse35 .cse1 .cse2 .cse3 .cse4 .cse8) (or (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse10 .cse4 .cse7 .cse15 .cse16 .cse17 .cse36) (and .cse22 .cse23 .cse24 .cse8 .cse25 .cse26 .cse27 .cse28 .cse29 .cse37 .cse30 .cse31)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse34 .cse12 .cse8) (or .cse2 .cse1 .cse10 .cse18 .cse7 .cse13 .cse0 .cse14 .cse5 .cse11 .cse12 .cse15 .cse16 .cse17) (let ((.cse39 (= 0 ~p_dw_st~0)) (.cse47 (= eval_~tmp___1~0 1))) (or (and .cse27 .cse38 .cse24 .cse39 .cse26 .cse40 .cse37 .cse30 .cse31 .cse41) .cse2 (and .cse42 (and .cse8 .cse26 .cse40 .cse43 .cse29 .cse44 .cse45)) .cse46 .cse36 (and .cse47 .cse8 .cse27 .cse24 .cse39 .cse26 .cse40 .cse37 .cse30 .cse31 .cse41) (and .cse38 .cse47 .cse42 .cse26 .cse40 .cse43 .cse29 .cse45) .cse35 .cse14 .cse12 .cse48 .cse15 .cse17 .cse1 .cse6 .cse49 .cse50 .cse51 .cse34 (and (and .cse8 .cse25 .cse26 .cse52 .cse27 .cse29 .cse30 .cse44 .cse45 .cse31) .cse42))) (or .cse2 .cse1 .cse10 .cse6 .cse7 .cse13 .cse0 .cse14 .cse8 .cse4 .cse5 .cse15 .cse16 .cse17) (or .cse2 .cse1 .cse6 .cse53 .cse7 .cse50 .cse46 .cse35 .cse3 .cse5 .cse54 .cse55 .cse12 .cse48) (or .cse1 .cse2 .cse6 .cse53 .cse7 .cse36 .cse35 .cse0 .cse3 .cse55 .cse12 .cse48 .cse54 (and .cse43 .cse38 .cse56 .cse26)) (or .cse57 .cse35 .cse1 .cse2 .cse3 .cse11) (or (and .cse22 .cse23 .cse24 .cse8 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse44 .cse31) .cse58 (or .cse19 .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse21 .cse6 .cse7) .cse20) (or .cse58 (and .cse22 .cse23 .cse24 .cse59 .cse8 .cse25 .cse26 .cse27 .cse28 .cse37 .cse30 .cse31) (or .cse2 .cse1 .cse10 .cse6 .cse13 .cse0 .cse14 .cse4 .cse5 .cse34 .cse15 .cse16 .cse17) (and (and .cse32 .cse8 .cse25 .cse26 .cse43 .cse29 .cse44 .cse33) .cse42)) (or .cse1 .cse2 .cse49 .cse57 .cse35 .cse14 .cse11 .cse51 .cse34 .cse12 .cse48 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse10 .cse9 .cse3 .cse5 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse12 .cse7) (or .cse19 .cse2 .cse1 .cse10 .cse21 .cse6 .cse58 .cse7 (= 0 ~q_write_ev~0) .cse36 .cse3 .cse4 (and .cse32 .cse23 .cse42 .cse8 .cse25 .cse26 .cse43 .cse29 .cse37 .cse33)) (or .cse1 .cse2 .cse49 .cse35 .cse14 .cse4 .cse8 .cse34 .cse12 .cse48 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 (and .cse23 .cse56 .cse25 .cse26 .cse43 .cse29 .cse37) .cse11 (and .cse23 .cse56 .cse24 .cse59 .cse25 .cse26 .cse43 .cse37) .cse6 .cse34 .cse12))))) [2018-11-28 11:21:24,937 INFO L444 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse14 (not (= ~c_dr_pc~0 1))) (.cse17 (= ~c_num_read~0 0)) (.cse24 (= 1 ~p_num_write~0)) (.cse13 (not (= 0 ~c_dr_st~0))) (.cse15 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~q_free~0 0)) (.cse23 (= 2 ~p_dw_st~0)) (.cse18 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse39 (+ |old(~c_num_read~0)| 1))) (let ((.cse12 (= eval_~tmp___1~0 1)) (.cse5 (< |old(~p_num_write~0)| .cse39)) (.cse6 (< .cse39 |old(~p_num_write~0)|)) (.cse32 (let ((.cse38 (+ ~c_num_read~0 1))) (and (<= .cse38 ~p_num_write~0) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse13 .cse15 (= 1 ~c_dr_pc~0) .cse16 .cse22 .cse23 .cse18 (<= ~p_num_write~0 .cse38)))) (.cse19 (not (= 0 |old(~p_num_write~0)|))) (.cse10 (< 0 |old(~q_req_up~0)|)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse36 (and .cse14 .cse13 .cse15 .cse16 .cse17 .cse22 .cse23 .cse18 .cse24)) (.cse9 (not (= |old(~p_dw_st~0)| 2))) (.cse20 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse37 (not (= 1 |old(~p_num_write~0)|))) (.cse27 (not (= 0 |old(~c_num_read~0)|))) (.cse8 (not .cse26)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse33 (not .cse0)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse34 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse30 (< ~q_write_ev~0 2)) (.cse21 (< |old(~q_free~0)| 1)) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse31 (= 1 |old(~q_req_up~0)|)) (.cse25 (not (= |old(~p_dw_st~0)| 0))) (.cse28 (< 1 |old(~q_free~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse29 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse2 .cse1 .cse6 .cse7 .cse8 .cse9 (= 0 ~q_write_ev~0) .cse10 .cse3 .cse11) (or .cse2 .cse1 (and .cse12 .cse13 (<= 1 ~q_free~0) .cse14 .cse15 (= 0 ~p_dw_st~0) .cse16 .cse17 .cse18 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) .cse7 .cse19 .cse20 .cse10 .cse0 .cse21 (and .cse14 .cse12 .cse13 (= ~p_dw_pc~0 1) .cse16 .cse17 .cse22 .cse23 .cse24) .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse30 .cse1 .cse2 .cse3 .cse31 .cse4 .cse7 .cse25 .cse26) (or (and .cse12 .cse32) .cse8 (or .cse5 .cse30 .cse1 .cse2 .cse33 .cse3 .cse31 .cse6 .cse7 .cse9)) (or .cse30 .cse34 .cse1 .cse21 .cse2 .cse33 .cse11 .cse9 .cse28 .cse35 .cse29 .cse10) (or .cse2 .cse1 .cse33 .cse9 .cse34 .cse30 .cse21 .cse31 .cse4 .cse26 .cse28 .cse35 .cse29) (or .cse30 .cse1 .cse2 .cse3 .cse31 .cse4 .cse7 .cse9) (or .cse5 .cse30 .cse1 .cse2 .cse33 .cse3 .cse31 .cse6 .cse32 .cse26 .cse9) (or .cse0 .cse1 .cse21 .cse2 .cse4 .cse25 .cse26 .cse27 .cse28 .cse19 .cse29) (or .cse0 .cse30 .cse1 .cse2 .cse3 .cse7 .cse36 .cse37 .cse26 .cse9 .cse27 .cse10) (or .cse2 .cse1 .cse33 .cse7 .cse9 .cse34 .cse30 .cse21 .cse31 .cse4 .cse28 .cse35 .cse29) (or .cse30 .cse1 .cse2 .cse3 .cse31 .cse4 .cse26 .cse9) (or .cse2 .cse1 .cse36 .cse7 .cse9 .cse20 .cse0 .cse3 .cse31 .cse37 .cse26 .cse27) (or .cse8 (or .cse2 .cse1 .cse33 .cse7 .cse34 .cse30 .cse21 .cse11 .cse31 .cse25 .cse28 .cse35 .cse29))))) [2018-11-28 11:21:24,938 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-11-28 11:21:24,938 INFO L444 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse24 (= 1 ~c_dr_pc~0))) (let ((.cse10 (not .cse24)) (.cse26 (not (= ~q_read_ev~0 2))) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse3 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse23 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse4 (< 0 ~q_req_up~0)) (.cse15 (< ~p_num_write~0 .cse29)) (.cse16 (< .cse29 ~p_num_write~0)) (.cse19 (or .cse10 .cse26)) (.cse6 (< ~q_write_ev~0 2)) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse7 (< ~q_free~0 1)) (.cse20 (= 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))) (.cse0 (not (= ~q_read_ev~0 1))) (.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)) (.cse17 (not (= ~p_dw_st~0 2))) (.cse27 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse18 (not (= ~q_free~0 0))) (.cse25 (= 1 ~q_req_up~0)) (.cse28 (not (= 1 ~p_num_write~0))) (.cse21 (= ~p_dw_pc~0 1)) (.cse22 (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 .cse15 .cse1 .cse2 .cse16 .cse17 (= 0 ~q_write_ev~0) .cse3 .cse4 .cse18 .cse8 .cse19 .cse14 (= 1 ~q_write_ev~0)) (or .cse2 .cse7 .cse1 .cse20 .cse9 .cse21 .cse22 .cse14 .cse11 .cse23 .cse24 .cse13) (or .cse14 (or .cse6 (or (or .cse5 .cse2 .cse7 .cse1 .cse8 .cse10 .cse11 .cse12 .cse13) .cse17) .cse4)) (or .cse6 .cse2 .cse1 .cse18 .cse25 .cse20 .cse19 .cse9 .cse21 .cse14) (or .cse14 .cse1 .cse2 .cse26 .cse23 .cse27 .cse4 .cse24 .cse7 .cse9 .cse21 .cse22 .cse11 .cse13) (or .cse1 .cse2 .cse14 .cse17 .cse5 .cse6 .cse7 .cse25 .cse20 .cse10 .cse21 .cse11 .cse12 .cse13) (or .cse6 .cse2 .cse1 .cse18 .cse14 .cse28 .cse21 .cse17 .cse22 .cse26 .cse4) (or .cse6 .cse2 .cse1 .cse18 .cse25 .cse20 .cse21 .cse17 .cse14) (or .cse15 .cse6 .cse2 .cse1 .cse18 .cse25 .cse16 .cse14 .cse10 .cse21 .cse17) (or .cse1 .cse2 .cse17 .cse5 .cse6 .cse7 .cse25 .cse14 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse14 .cse2 .cse1 .cse18 .cse20 .cse24) (or .cse6 .cse2 .cse1 .cse18 .cse25 .cse20 .cse19 .cse14 .cse17) (or .cse14 (or .cse6 .cse25 (or (or .cse5 .cse2 .cse7 .cse1 .cse20 .cse10 .cse11 .cse12 .cse13) .cse17)) .cse0) (or .cse1 .cse2 .cse14 .cse26 .cse17 .cse27 .cse18 .cse25 .cse28 .cse21 .cse22))))) [2018-11-28 11:21:24,943 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-11-28 11:21:24,943 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-28 11:21:24,943 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-11-28 11:21:24,943 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-11-28 11:21:24,943 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-11-28 11:21:24,943 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1)) (.cse22 (+ ~c_num_read~0 1))) (let ((.cse21 (not (= ~c_dr_pc~0 1))) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= 1 ~p_num_write~0)) (.cse5 (= 2 ~q_read_ev~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 0)) (.cse1 (<= .cse22 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 .cse22)) (.cse18 (not (= ~q_req_up~0 1))) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse11 (= 1 ~c_dr_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse17 (not .cse2)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse3 .cse11 .cse4 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 .cse16 .cse10 .cse17 .cse18 .cse4) (and .cse4 .cse5 .cse19 .cse6 .cse7 .cse17 .cse20 .cse18 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse6 .cse16 .cse4 .cse5) .cse7 .cse10 .cse18) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse12 .cse13 .cse7 .cse17 .cse14 .cse15 .cse18) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse21 .cse16 (= ~p_dw_st~0 0) .cse4 .cse12 .cse19 .cse17 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse16 .cse10 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6 .cse17 .cse18) (and .cse6 .cse21 .cse16 .cse4) (< |old(~q_free~0)| 1) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15 .cse18) (and (and .cse19 .cse6 .cse17 .cse20 .cse4 .cse5) .cse0 .cse7 .cse10) (and .cse6 .cse1 .cse7 .cse10 .cse17 .cse8 .cse18 .cse11 .cse4) (not (= 0 |old(~p_num_write~0)|)) (and .cse9 .cse10 .cse3 .cse11 .cse4 .cse12 .cse13 .cse7 .cse17 .cse14 .cse15) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 11:21:24,948 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-28 11:21:24,948 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1)) (.cse25 (+ ~c_num_read~0 1))) (let ((.cse22 (not (= ~c_dr_pc~0 1))) (.cse21 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse24 (= 0 ~p_dw_st~0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= 1 ~p_num_write~0)) (.cse5 (= 2 ~q_read_ev~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 0)) (.cse1 (<= .cse25 ~p_num_write~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse17 (not .cse2)) (.cse8 (<= ~p_num_write~0 .cse25)) (.cse18 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse3 .cse11 .cse4 .cse12 .cse13 .cse7 .cse14 .cse15) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 .cse16 .cse10 .cse17 .cse18 .cse4) (and .cse4 .cse5 .cse19 .cse6 .cse7 .cse17 .cse20 .cse18 .cse21) (and (and .cse6 .cse16 .cse4 .cse5) .cse7 .cse10 .cse18) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse12 .cse13 .cse7 .cse17 .cse14 .cse15 .cse18) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse22 .cse16 (= ~p_dw_st~0 0) .cse4 .cse12 .cse19 .cse17 .cse14 .cse15 .cse23) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse16 .cse10 .cse24 .cse4 .cse5 .cse6 .cse17 .cse18) (and .cse6 .cse22 .cse16 .cse4) (and .cse12 .cse22 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse24 .cse4 .cse19 (= |old(~q_req_up~0)| ~q_req_up~0) .cse14 .cse15 .cse21 .cse23) (< |old(~q_free~0)| 1) (and .cse2 (and .cse9 .cse10 .cse24 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse14 .cse15 .cse18)) (and .cse7 .cse10 .cse18 (and .cse6 .cse1 .cse8 .cse11 .cse4 .cse5)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15 .cse18) (and (and .cse19 .cse6 .cse17 .cse20 .cse4 .cse5) .cse0 .cse7 .cse10) (and .cse6 .cse1 .cse7 .cse10 .cse17 .cse8 .cse18 .cse11 .cse4) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 11:21:24,950 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-28 11:21:24,950 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-11-28 11:21:24,950 INFO L444 ceAbstractionStarter]: At program point L409-1(lines 406 431) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1)) (.cse25 (+ ~c_num_read~0 1))) (let ((.cse22 (not (= ~c_dr_pc~0 1))) (.cse21 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse24 (= 0 ~p_dw_st~0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= 1 ~p_num_write~0)) (.cse5 (= 2 ~q_read_ev~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 0)) (.cse1 (<= .cse25 ~p_num_write~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse17 (not .cse2)) (.cse8 (<= ~p_num_write~0 .cse25)) (.cse18 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse3 .cse11 .cse4 .cse12 .cse13 .cse7 .cse14 .cse15) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 .cse16 .cse10 .cse17 .cse18 .cse4) (and .cse4 .cse5 .cse19 .cse6 .cse7 .cse17 .cse20 .cse18 .cse21) (and (and .cse6 .cse16 .cse4 .cse5) .cse7 .cse10 .cse18) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse12 .cse13 .cse7 .cse17 .cse14 .cse15 .cse18) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse22 .cse16 (= ~p_dw_st~0 0) .cse4 .cse12 .cse19 .cse17 .cse14 .cse15 .cse23) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse16 .cse10 .cse24 .cse4 .cse5 .cse6 .cse17 .cse18) (and .cse6 .cse22 .cse16 .cse4) (and .cse12 .cse22 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse24 .cse4 .cse19 (= |old(~q_req_up~0)| ~q_req_up~0) .cse14 .cse15 .cse21 .cse23) (< |old(~q_free~0)| 1) (and .cse2 (and .cse9 .cse10 .cse24 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse14 .cse15 .cse18)) (and .cse7 .cse10 .cse18 (and .cse6 .cse1 .cse8 .cse11 .cse4 .cse5)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15 .cse18) (and (and .cse19 .cse6 .cse17 .cse20 .cse4 .cse5) .cse0 .cse7 .cse10) (and .cse6 .cse1 .cse7 .cse10 .cse17 .cse8 .cse18 .cse11 .cse4) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 11:21:24,952 INFO L444 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= 0 ~p_dw_st~0) .cse3 .cse4 (= |old(~q_req_up~0)| ~q_req_up~0) .cse5 .cse6 (= ~q_read_ev~0 ~q_write_ev~0) .cse7) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse1 .cse2 (= ~p_dw_st~0 0) (= 2 ~c_dr_st~0) .cse3 .cse0 .cse4 .cse5 .cse6 .cse7) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-28 11:21:24,952 INFO L444 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~p_dw_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 1 ~q_free~0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (<= ~q_free~0 1)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse0 .cse1 .cse2 (= 2 ~c_dr_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |old(~q_req_up~0)| ~q_req_up~0) .cse6 .cse7 (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse8) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-28 11:21:24,956 INFO L451 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-11-28 11:21:24,957 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-11-28 11:21:24,957 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-28 11:21:24,957 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1)) (.cse24 (+ ~c_num_read~0 1))) (let ((.cse19 (not (= ~c_dr_pc~0 1))) (.cse1 (<= .cse24 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 .cse24)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~p_dw_st~0 0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse11 (= 1 ~c_dr_pc~0)) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= ~q_read_ev~0 1)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse17 (not (= ~q_req_up~0 1))) (.cse21 (= ~c_num_read~0 0)) (.cse6 (= ~q_free~0 0)) (.cse18 (not .cse2)) (.cse23 (= 1 ~p_num_write~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 2 ~q_read_ev~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse3 .cse11 .cse4 .cse12 .cse13 .cse7 .cse14 .cse15) (= 1 |old(~c_dr_pc~0)|) (and (and .cse6 .cse16 .cse4 .cse5) .cse7 .cse10 .cse17) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse12 .cse13 .cse7 .cse18 .cse14 .cse15 .cse17) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse19 .cse16 .cse20 .cse4 .cse12 .cse21 .cse18 .cse14 .cse15 (= 0 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 (= 1 ~q_write_ev~0)) (and .cse6 .cse19 .cse16 .cse4) (< |old(~q_free~0)| 1) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15 .cse17) (and .cse22 (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse12 .cse13 .cse7 .cse14 .cse15 .cse17)) (and .cse6 .cse1 .cse7 .cse10 .cse18 .cse8 .cse17 .cse11 .cse4) (not (= |old(~p_dw_st~0)| 0)) (not (= ~p_dw_i~0 1)) (and (and .cse9 .cse10 .cse20 .cse3 .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse17) .cse2 .cse22) (< 0 |old(~q_req_up~0)|) (and .cse6 .cse7 .cse16 .cse10 .cse18 .cse17 .cse4) (and .cse4 .cse5 .cse21 .cse6 .cse7 .cse18 .cse23 .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 .cse16 .cse10 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6 .cse18 .cse17) (and (and .cse21 .cse6 .cse18 .cse23 .cse4 .cse5) .cse0 .cse7 .cse10) (not (= 0 |old(~p_num_write~0)|))))) [2018-11-28 11:21:24,957 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 395 437) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:21:24,958 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-28 11:21:24,958 INFO L444 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse2 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= 0 ~p_dw_st~0) .cse3 .cse4 (= |old(~q_req_up~0)| ~q_req_up~0) .cse5 .cse6 (= ~q_read_ev~0 ~q_write_ev~0) .cse7) (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and .cse1 .cse2 (= ~p_dw_st~0 0) (= 2 ~c_dr_st~0) .cse3 .cse0 .cse4 .cse5 .cse6 .cse7) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2018-11-28 11:21:24,958 INFO L444 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:21:24,958 INFO L444 ceAbstractionStarter]: At program point L402-1(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (< |old(~q_free~0)| 1) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 11:21:24,958 INFO L444 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1)) (.cse23 (+ ~c_num_read~0 1))) (let ((.cse21 (not (= ~c_dr_pc~0 1))) (.cse22 (= 0 ~p_dw_st~0)) (.cse3 (= 2 ~c_dr_st~0)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= 1 ~p_num_write~0)) (.cse5 (= 2 ~q_read_ev~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 0)) (.cse1 (<= .cse23 ~p_num_write~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse17 (not .cse2)) (.cse8 (<= ~p_num_write~0 .cse23)) (.cse18 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse3 .cse11 .cse4 .cse12 .cse13 .cse7 .cse14 .cse15) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 .cse16 .cse10 .cse17 .cse18 .cse4) (and .cse4 .cse5 .cse19 .cse6 .cse7 .cse17 .cse20 .cse18 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse6 .cse16 .cse4 .cse5) .cse7 .cse10 .cse18) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse12 .cse13 .cse7 .cse17 .cse14 .cse15 .cse18) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse21 .cse16 (= ~p_dw_st~0 0) .cse4 .cse12 .cse19 .cse17 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse16 .cse10 .cse22 .cse4 .cse5 .cse6 .cse17 .cse18) (and .cse6 .cse21 .cse16 .cse4) (< |old(~q_free~0)| 1) (and .cse2 (and .cse9 .cse10 .cse22 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse14 .cse15 .cse18)) (and .cse7 .cse10 .cse18 (and .cse6 .cse1 .cse8 .cse11 .cse4 .cse5)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15 .cse18) (and (and .cse19 .cse6 .cse17 .cse20 .cse4 .cse5) .cse0 .cse7 .cse10) (and .cse6 .cse1 .cse7 .cse10 .cse17 .cse8 .cse18 .cse11 .cse4) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 11:21:24,961 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse20 (= ~p_dw_pc~0 1)) (.cse22 (+ ~c_num_read~0 1))) (let ((.cse3 (= 2 ~c_dr_st~0)) (.cse18 (not (= ~c_dr_pc~0 1))) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (not (= 0 ~c_dr_st~0))) (.cse6 (<= 1 ~q_free~0)) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_num_read~0 0)) (.cse17 (= 1 ~p_num_write~0)) (.cse15 (= 2 ~q_read_ev~0)) (.cse1 (<= ~q_req_up~0 0)) (.cse11 (= ~q_free~0 0)) (.cse19 (<= .cse22 ~p_num_write~0)) (.cse8 (= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse13 (not .cse20)) (.cse21 (<= ~p_num_write~0 .cse22)) (.cse14 (not (= ~q_req_up~0 1))) (.cse4 (= 1 ~c_dr_pc~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse11 .cse8 .cse12 .cse2 .cse13 .cse14 .cse5) (and .cse5 .cse15 .cse16 .cse11 .cse8 .cse13 .cse17 .cse14 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse11 .cse12 .cse5 .cse15) .cse8 .cse2 .cse14) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse14) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse18 .cse12 (= ~p_dw_st~0 0) .cse5 .cse6 .cse16 .cse13 .cse9 .cse10 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse12 .cse2 (= 0 ~p_dw_st~0) .cse5 .cse15 .cse11 .cse13 .cse14) (and .cse1 .cse19 .cse20 .cse3 .cse5 .cse15 .cse11 .cse8 .cse21) (and .cse11 .cse18 .cse12 .cse5) (< |old(~q_free~0)| 1) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14) (and (and .cse16 .cse11 .cse13 .cse17 .cse5 .cse15) .cse1 .cse8 .cse2) (and .cse11 .cse19 .cse8 .cse2 .cse13 .cse21 .cse14 .cse4 .cse5) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 11:21:24,962 INFO L444 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1)) (.cse22 (+ ~c_num_read~0 1))) (let ((.cse3 (= 2 ~c_dr_st~0)) (.cse21 (not (= ~c_dr_pc~0 1))) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 1 ~q_free~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= 1 ~p_num_write~0)) (.cse5 (= 2 ~q_read_ev~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 0)) (.cse1 (<= .cse22 ~p_num_write~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse17 (not .cse2)) (.cse8 (<= ~p_num_write~0 .cse22)) (.cse18 (not (= ~q_req_up~0 1))) (.cse11 (= 1 ~c_dr_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3 (not (= 0 ~q_write_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse3 .cse11 .cse4 .cse12 .cse13 .cse7 .cse14 .cse15) (< 0 |old(~q_req_up~0)|) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 .cse16 .cse10 .cse17 .cse18 .cse4) (and .cse4 .cse5 .cse19 .cse6 .cse7 .cse17 .cse20 .cse18 (= ~q_read_ev~0 ~q_write_ev~0)) (and (and .cse6 .cse16 .cse4 .cse5) .cse7 .cse10 .cse18) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse12 .cse13 .cse7 .cse17 .cse14 .cse15 .cse18) (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse21 .cse16 (= ~p_dw_st~0 0) .cse4 .cse12 .cse19 .cse17 .cse14 .cse15 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse16 .cse10 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6 .cse17 .cse18) (and .cse6 .cse21 .cse16 .cse4) (< |old(~q_free~0)| 1) (and .cse9 .cse16 .cse10 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15 .cse18) (and (and .cse19 .cse6 .cse17 .cse20 .cse4 .cse5) .cse0 .cse7 .cse10) (and .cse6 .cse1 .cse7 .cse10 .cse17 .cse8 .cse18 .cse11 .cse4) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 11:21:24,963 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse28 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse23 (not (= 0 ~p_num_write~0))) (.cse22 (not (= ~p_dw_st~0 0))) (.cse19 (< ~p_num_write~0 .cse29)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse20 (< .cse29 ~p_num_write~0)) (.cse18 (< 0 ~q_req_up~0)) (.cse24 (not (= 2 ~c_dr_st~0))) (.cse2 (not .cse21)) (.cse5 (< ~p_num_write~0 ~c_num_read~0)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse7 (< ~q_free~0 1)) (.cse9 (= 0 ~c_dr_st~0)) (.cse11 (< 1 ~q_free~0)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse28)) (.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))) (.cse26 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse27 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse14 (not (= ~q_free~0 0))) (.cse8 (= 1 ~q_req_up~0)) (.cse16 (not (= 1 ~p_num_write~0))) (.cse10 (= ~p_dw_pc~0 1)) (.cse17 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse0 .cse14 .cse15 .cse3 .cse16 .cse10 .cse4 .cse17 .cse18) (or .cse3 .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse10 .cse4) (or .cse19 .cse6 .cse1 .cse0 .cse2 .cse14 .cse8 .cse3 .cse20 .cse10 .cse4) (or .cse21 .cse1 .cse7 .cse0 .cse9 .cse3 .cse22 .cse10 .cse17 .cse11 .cse23 .cse13) (or .cse21 .cse1 .cse0 .cse14 .cse9 .cse3) (or (or .cse6 .cse5 .cse1 .cse7 .cse0 .cse2 .cse24 .cse4 .cse11 .cse12 .cse13 .cse18) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse25)) (or .cse0 .cse1 .cse15 .cse23 .cse26 .cse18 .cse21 .cse7 .cse22 .cse10 .cse17 .cse11 (and .cse27 .cse25) .cse13) (or .cse6 .cse1 .cse0 .cse14 .cse8 .cse9 .cse3 .cse15 .cse22 .cse10) (or .cse6 .cse1 .cse0 .cse3 .cse14 .cse8 .cse9 .cse15 .cse4) (or .cse19 .cse1 .cse0 (and .cse28 .cse25) .cse20 .cse15 (not .cse10) .cse4 .cse18 .cse14 .cse24) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse3) (or .cse0 .cse1 .cse15 .cse4 .cse26 (and .cse28 .cse27) .cse14 .cse8 .cse16 .cse10 .cse17)))) [2018-11-28 11:21:24,964 INFO L448 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-11-28 11:21:24,964 INFO L448 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-11-28 11:21:24,964 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-11-28 11:21:24,965 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse27 (= 1 ~c_dr_pc~0)) (.cse18 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse9 (= ~p_dw_pc~0 1)) (.cse34 (+ ~c_num_read~0 1)) (.cse33 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse24 (not (= 0 ~p_num_write~0))) (.cse31 (and .cse33 .cse19)) (.cse28 (= ~q_read_ev~0 ~q_write_ev~0)) (.cse25 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse32 (not (= 1 ~p_num_write~0))) (.cse30 (not (= 0 ~c_num_read~0))) (.cse29 (not (= ~p_dw_st~0 0))) (.cse6 (= 1 |old(~q_req_up~0)|)) (.cse21 (= 0 ~c_dr_st~0)) (.cse0 (< ~p_num_write~0 .cse34)) (.cse8 (< .cse34 ~p_num_write~0)) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse22 (not .cse9)) (.cse26 (< 0 |old(~q_req_up~0)|)) (.cse5 (not (= ~q_free~0 0))) (.cse23 (and .cse18 .cse19 .cse20)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse27)) (.cse10 (not (= ~p_dw_st~0 2))) (.cse7 (and .cse33 .cse18 .cse19)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse11 (< ~p_num_write~0 ~c_num_read~0)) (.cse12 (< ~q_free~0 1)) (.cse13 (not (= 2 ~c_dr_st~0))) (.cse15 (< 1 ~q_free~0)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (or .cse1 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse14 .cse10 .cse15 .cse16 .cse17) (and (and .cse18 .cse19) .cse20)) (or .cse7 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse9 .cse10) (or .cse0 .cse3 .cse2 .cse4 .cse8 .cse14 .cse22 .cse10 .cse23 .cse1 .cse5 .cse13) (or .cse3 .cse2 .cse14 .cse24 .cse25 .cse26 .cse27 .cse12 (and .cse18 .cse28 .cse20) .cse29 .cse9 .cse30 .cse15 .cse17) (or .cse27 .cse2 .cse12 .cse3 .cse21 .cse31 .cse29 .cse9 .cse30 .cse15 .cse24 .cse17) (or .cse27 .cse2 .cse3 .cse5 .cse21 .cse31) (or .cse1 .cse2 .cse3 .cse5 .cse14 .cse7 .cse32 .cse9 .cse10 .cse30 .cse26) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6 .cse21 .cse14 .cse10) (or .cse3 .cse2 .cse14 (and .cse18 .cse19 .cse28) .cse10 .cse25 .cse5 .cse6 .cse32 .cse9 .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse14 .cse29 .cse9) (or (or .cse1 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse10 .cse15 .cse16 .cse17 .cse26) (and .cse18 (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse20)) (or .cse3 .cse2 .cse4 .cse7 .cse10 .cse11 .cse1 .cse12 .cse6 .cse21 .cse9 .cse15 .cse16 .cse17) (or .cse3 .cse2 .cse4 .cse14 .cse10 .cse11 .cse1 .cse12 .cse6 .cse21 .cse15 .cse16 .cse17 .cse7) (or .cse0 .cse3 .cse2 .cse4 .cse8 .cse14 .cse22 .cse10 (= 0 |old(~q_write_ev~0)|) .cse26 .cse5 .cse13 .cse23) (or .cse2 .cse3 .cse4 .cse10 .cse7 .cse1 .cse11 .cse12 .cse13 .cse9 .cse15 .cse16 .cse17)))) [2018-11-28 11:21:24,966 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-11-28 11:21:24,966 INFO L444 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse20 (= 1 ~c_dr_pc~0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse29 (= |old(~q_req_up~0)| ~q_req_up~0)) (.cse31 (+ ~c_num_read~0 1)) (.cse28 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse30 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse19 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse18 (not (= 0 ~p_num_write~0))) (.cse27 (and .cse28 .cse30)) (.cse26 (not (= 1 ~p_num_write~0))) (.cse23 (not (= 0 ~c_num_read~0))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse13 (< ~p_num_write~0 .cse31)) (.cse12 (and (and .cse29 .cse30) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse14 (< .cse31 ~p_num_write~0)) (.cse15 (not .cse22)) (.cse6 (not (= 2 ~c_dr_st~0))) (.cse17 (not (= ~q_free~0 0))) (.cse7 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not .cse20)) (.cse8 (not (= ~p_dw_st~0 2))) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse3 (< ~q_free~0 1)) (.cse24 (= 1 |old(~q_req_up~0)|)) (.cse25 (= 0 ~c_dr_st~0)) (.cse9 (< 1 ~q_free~0)) (.cse10 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse4 .cse2 .cse5 .cse14 .cse7 .cse15 .cse8 (= 0 |old(~q_write_ev~0)|) .cse16 .cse17 .cse6) (or .cse4 .cse2 .cse7 .cse18 .cse19 .cse16 .cse20 .cse3 .cse21 .cse22 .cse23 .cse9 .cse11) (or .cse13 .cse0 .cse2 .cse4 .cse5 .cse17 .cse24 .cse14 .cse22 .cse8) (or .cse4 .cse2 .cse5 .cse7 .cse8 .cse1 .cse0 .cse3 .cse24 .cse25 .cse9 .cse10 .cse11) (or .cse4 .cse2 .cse7 .cse8 .cse19 .cse17 .cse24 .cse26 .cse22 .cse23) (or .cse20 .cse2 .cse3 .cse4 .cse25 .cse27 .cse21 .cse22 .cse23 .cse9 .cse18 .cse11) (or .cse20 .cse2 .cse4 .cse17 .cse25 .cse27) (or .cse2 .cse4 .cse5 .cse8 .cse0 .cse1 .cse3 .cse6 (and .cse28 .cse29 .cse30) .cse22 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse4 .cse5 .cse17 .cse24 .cse25 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse16) (or .cse0 .cse2 .cse4 .cse17 .cse7 .cse26 .cse22 .cse8 .cse23 .cse16) (or .cse0 .cse2 .cse4 .cse5 .cse17 .cse24 .cse25 .cse22 .cse8) (or .cse13 .cse2 .cse4 .cse5 .cse12 .cse14 .cse7 .cse15 .cse8 .cse0 .cse17 .cse6) (or .cse0 .cse2 .cse4 .cse5 .cse17 .cse24 .cse25 .cse7 .cse21 .cse22) (or .cse4 .cse2 .cse5 .cse8 .cse1 .cse0 .cse3 .cse24 .cse25 .cse22 .cse9 .cse10 .cse11)))) [2018-11-28 11:21:24,967 INFO L448 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-11-28 11:21:24,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:21:24,967 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_free~0 0) (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2018-11-28 11:21:24,967 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:21:24,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:21:24,967 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-11-28 11:21:24,967 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-11-28 11:21:24,967 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-11-28 11:21:24,967 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-28 11:21:24,968 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-28 11:21:24,968 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-11-28 11:21:24,969 INFO L444 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse13 (= 1 ~c_dr_pc~0)) (.cse26 (+ ~c_num_read~0 1))) (let ((.cse5 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (not (= 1 ~p_num_write~0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse11 (not (= 0 ~p_num_write~0))) (.cse15 (not (= ~p_dw_st~0 0))) (.cse19 (= 0 ~c_dr_st~0)) (.cse7 (= 1 ~q_req_up~0)) (.cse23 (< ~p_num_write~0 .cse26)) (.cse24 (< .cse26 ~p_num_write~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse9 (= ~p_dw_pc~0 1)) (.cse6 (not (= ~q_free~0 0))) (.cse4 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse18 (< ~q_write_ev~0 2)) (.cse21 (< ~p_num_write~0 ~c_num_read~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse14 (< ~q_free~0 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse20 (not .cse13)) (.cse25 (not (= 2 ~c_dr_st~0))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse16 (< 1 ~q_free~0)) (.cse22 (< ~c_num_read~0 ~p_num_write~0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (< 0 ~q_req_up~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse11 .cse5 .cse12 .cse13 .cse14 .cse4 .cse15 .cse9 .cse10 .cse16 .cse17) (or .cse18 .cse1 .cse0 .cse6 .cse7 .cse19 .cse4 .cse2 .cse3) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse21 .cse18 .cse14 .cse7 .cse19 .cse9 .cse16 .cse22 .cse17) (or .cse18 .cse1 .cse0 .cse4 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 .cse12) (or .cse13 .cse1 .cse0 .cse6 .cse19 .cse4 (and (= 1 ~p_dw_pc~0) (not (= 0 ~q_read_ev~0)))) (or .cse13 .cse1 .cse14 .cse0 .cse4 .cse19 .cse15 .cse9 .cse10 .cse16 .cse11 .cse17) (or .cse13 .cse1 .cse0 .cse6 .cse19 .cse2 .cse4) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse21 .cse18 .cse14 .cse7 .cse19 .cse4 .cse16 .cse22 .cse17) (or .cse4 .cse18 .cse1 .cse0 .cse6 .cse7 .cse19 .cse2 .cse15 .cse9) (or .cse18 .cse1 .cse0 .cse6 .cse7 .cse4 .cse19 .cse9 .cse3) (or .cse23 .cse18 .cse1 .cse0 .cse4 .cse20 .cse6 .cse7 .cse24 .cse9 .cse3) (or .cse23 .cse0 .cse1 .cse24 .cse2 (not .cse9) .cse3 (= 0 ~q_write_ev~0) .cse12 .cse6 .cse25 .cse4) (or (= ~q_read_ev~0 1) .cse4 (or .cse18 .cse21 .cse1 .cse14 .cse0 .cse20 .cse25 .cse3 .cse16 .cse22 .cse17 .cse12))))) [2018-11-28 11:21:24,969 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-11-28 11:21:24,969 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-11-28 11:21:24,969 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-11-28 11:21:24,969 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-11-28 11:21:24,969 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-11-28 11:21:24,969 INFO L444 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~p_dw_pc~0 1))) (let ((.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (= 1 |old(~q_req_up~0)|)) (.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse10 (< ~q_write_ev~0 2)) (.cse8 (not .cse13)) (.cse11 (< ~p_num_write~0 .cse18)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not .cse17)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse15 (< .cse18 ~p_num_write~0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~p_dw_st~0 2)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 (or .cse11 (or .cse0 .cse1 .cse12 .cse13) .cse2 .cse14 .cse15 .cse3 .cse6)) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse16 .cse17 (< |old(~q_free~0)| 1) .cse3 (not (= ~p_dw_st~0 0)) .cse13 .cse7 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse14 .cse3 .cse5 .cse7) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse16) (or .cse10 .cse8 (or .cse11 (or .cse0 .cse1 (or .cse12 .cse4)) .cse2 .cse15 .cse3 .cse6))))) [2018-11-28 11:21:24,970 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-11-28 11:21:24,970 INFO L444 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)) (.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~c_num_read~0)| 1)) (.cse11 (= ~p_dw_pc~0 1))) (let ((.cse14 (not .cse11)) (.cse6 (< ~q_write_ev~0 2)) (.cse15 (< ~p_num_write~0 .cse26)) (.cse16 (not .cse5)) (.cse17 (< .cse26 ~p_num_write~0)) (.cse13 (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)))) (.cse4 (< 0 |old(~q_req_up~0)|)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse9 (and .cse21 .cse20 .cse22 .cse24 .cse23)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse7 (not (= |old(~q_free~0)| 0))) (.cse19 (= 1 |old(~q_req_up~0)|)) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse10 (not (= 1 ~p_num_write~0))) (.cse12 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 .cse13 .cse14 (or .cse15 (or .cse0 .cse1 (or .cse16 .cse2)) .cse7 .cse17 .cse8 .cse3)) (or (or .cse5 .cse0 .cse1 .cse7 .cse8 .cse2 .cse10 .cse3 .cse12) .cse9 .cse14 .cse18) (or .cse6 (or .cse15 (or .cse0 .cse1 .cse16 .cse11) .cse7 .cse19 .cse17 .cse8 .cse3) .cse13) (or .cse1 .cse0 .cse2 (not (= 0 ~p_num_write~0)) .cse18 (and .cse20 (<= 1 ~q_free~0) .cse21 .cse22 .cse23 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0)) .cse4 .cse5 (< |old(~q_free~0)| 1) .cse8 (not (= ~p_dw_st~0 0)) .cse11 .cse12 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse9 .cse2 .cse3 .cse18 .cse5 .cse7 .cse19 .cse8 .cse10 .cse12)))) [2018-11-28 11:21:24,970 INFO L448 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-11-28 11:21:24,970 INFO L444 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse24 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~c_num_read~0)| 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse16 (= 2 ~c_dr_st~0)) (.cse19 (= 1 ~c_dr_pc~0)) (.cse17 (= ~c_num_read~0 1)) (.cse18 (<= 1 ~q_free~0)) (.cse20 (<= ~q_free~0 1)) (.cse21 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse22 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse23 (< 0 |old(~q_req_up~0)|)) (.cse13 (not (= 1 ~p_num_write~0))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse25 (and .cse16 .cse19 .cse17 .cse18 .cse20 .cse21)) (.cse0 (< ~q_write_ev~0 2)) (.cse15 (not .cse5)) (.cse11 (and (<= ~p_num_write~0 ~c_num_read~0) .cse16 .cse19 .cse18 (<= ~c_num_read~0 ~p_num_write~0) .cse20 .cse21)) (.cse1 (< ~p_num_write~0 .cse26)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse24)) (.cse12 (not (= ~q_read_ev~0 2))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse8 (< .cse26 ~p_num_write~0)) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse10 (not (= ~p_dw_st~0 2)))) (and (or .cse0 (or .cse1 (or .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or (or .cse2 .cse3 .cse6 .cse9 .cse12 .cse13 .cse10 .cse14) .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22) (or .cse3 .cse2 (and .cse16 .cse18 .cse19 (= ~c_num_read~0 0) (= |old(~q_req_up~0)| ~q_req_up~0) .cse20 .cse21) .cse12 (not (= 0 ~p_num_write~0)) .cse22 .cse23 .cse24 (< |old(~q_free~0)| 1) .cse9 (not (= ~p_dw_st~0 0)) .cse5 .cse14 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse3 .cse2 .cse12 .cse10 .cse22 .cse6 .cse7 .cse9 .cse25 .cse13 .cse14) (or .cse2 .cse3 .cse12 .cse10 .cse23 .cse0 .cse6 .cse9 .cse13 .cse5 .cse14 .cse25) (or .cse0 .cse15 .cse11 (or .cse1 (or .cse2 .cse3 (or .cse4 .cse12)) .cse6 .cse8 .cse9 .cse10))))) [2018-11-28 11:21:24,972 INFO L444 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~p_dw_pc~0 1))) (let ((.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (= 1 |old(~q_req_up~0)|)) (.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (< 0 |old(~q_req_up~0)|)) (.cse10 (< ~q_write_ev~0 2)) (.cse8 (not .cse13)) (.cse11 (< ~p_num_write~0 .cse18)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not .cse17)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse15 (< .cse18 ~p_num_write~0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= ~p_dw_st~0 2)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 (or .cse11 (or .cse0 .cse1 .cse12 .cse13) .cse2 .cse14 .cse15 .cse3 .cse6)) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse16 .cse17 (< |old(~q_free~0)| 1) .cse3 (not (= ~p_dw_st~0 0)) .cse13 .cse7 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse14 .cse3 .cse5 .cse7) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse16) (or .cse10 .cse8 (or .cse11 (or .cse0 .cse1 (or .cse12 .cse4)) .cse2 .cse15 .cse3 .cse6))))) [2018-11-28 11:21:24,972 INFO L444 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse22 (= 1 |old(~c_dr_pc~0)|)) (.cse27 (+ |old(~c_num_read~0)| 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse17 (<= 1 ~q_free~0)) (.cse20 (<= ~q_free~0 1)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= 0 ~c_dr_st~0))) (.cse18 (= ~c_num_read~0 0)) (.cse19 (= |old(~q_req_up~0)| ~q_req_up~0))) (let ((.cse6 (and .cse16 .cse18 (= ~q_free~0 0) .cse19)) (.cse2 (and .cse16 (= ~c_num_read~0 1) .cse17 .cse20 .cse21)) (.cse10 (not (= 1 ~p_num_write~0))) (.cse14 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (< 0 |old(~q_req_up~0)|)) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (= 1 |old(~q_req_up~0)|)) (.cse7 (< ~q_write_ev~0 2)) (.cse26 (and (<= ~p_num_write~0 ~c_num_read~0) .cse16 .cse17 (<= ~c_num_read~0 ~p_num_write~0) .cse20 .cse21)) (.cse13 (not .cse11)) (.cse23 (< ~p_num_write~0 .cse27)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse24 (not .cse22)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse25 (< .cse27 ~p_num_write~0)) (.cse9 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~p_dw_st~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse2 (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse4 .cse12) .cse6 .cse13 .cse14) (or .cse6 .cse1 .cse0 .cse3 .cse4 .cse14 .cse8 .cse2 .cse15 .cse9 .cse10 .cse12) (or .cse1 .cse0 .cse3 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (not (= 0 ~p_num_write~0)) .cse14 .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 (or .cse23 (or .cse0 .cse1 .cse24 .cse11) .cse8 .cse15 .cse25 .cse9 .cse4) .cse26) (or .cse7 .cse26 .cse13 (or .cse23 (or .cse0 .cse1 (or .cse24 .cse3)) .cse8 .cse25 .cse9 .cse4))))) [2018-11-28 11:21:24,974 INFO L444 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse18 (= ~p_dw_pc~0 1)) (.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse20 (+ |old(~c_num_read~0)| 1))) (let ((.cse14 (< ~p_num_write~0 .cse20)) (.cse15 (not .cse5)) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse16 (< .cse20 ~p_num_write~0)) (.cse12 (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)))) (.cse13 (not .cse18)) (.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)|))) (.cse17 (< 0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 (or .cse14 (or .cse1 .cse0 (or .cse15 .cse2)) .cse6 .cse16 .cse8 .cse3)) (or .cse0 .cse1 .cse2 (not (= 0 ~p_num_write~0)) .cse4 .cse17 .cse5 (< |old(~q_free~0)| 1) .cse8 (not (= ~p_dw_st~0 0)) .cse18 .cse10 (< 1 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse11 (or .cse14 (or .cse1 .cse0 .cse15 .cse18) .cse6 .cse7 .cse16 .cse8 .cse3) .cse12) (or (or .cse5 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse3 .cse10) .cse13 .cse4) (or .cse5 .cse11 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse18 .cse3 .cse10 .cse17)))) [2018-11-28 11:21:24,974 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-11-28 11:21:24,974 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-11-28 11:21:24,974 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (< 0 ~q_req_up~0)) [2018-11-28 11:21:25,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:21:25 BoogieIcfgContainer [2018-11-28 11:21:25,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:21:25,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:21:25,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:21:25,049 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:21:25,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:00" (3/4) ... [2018-11-28 11:21:25,053 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-28 11:21:25,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-28 11:21:25,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-28 11:21:25,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-28 11:21:25,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-28 11:21:25,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-28 11:21:25,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-28 11:21:25,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-28 11:21:25,068 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-28 11:21:25,069 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 11:21:25,096 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(p_dw_i == 1) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_dw_pc == 1) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || ((((((((((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)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && 2 == p_dw_st) && !(0 == c_dr_st)) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && !(q_req_up == 1)) && p_last_write == q_buf_0)) || ((((((((p_last_write == q_buf_0 && 2 == q_read_ev) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(p_dw_pc == 1)) && 1 == p_num_write) && !(q_req_up == 1)) && q_read_ev == q_write_ev)) || ((((((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 == p_dw_st) && 2 <= q_write_ev) && !(q_req_up == 1))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_read_ev) == \old(q_write_ev))) || (((((((!(0 == c_dr_st) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && !(p_dw_pc == 1)) && !(q_req_up == 1))) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write)) || \old(q_free) < 1) || (p_dw_pc == 1 && ((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && 0 == p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && q_free == 0) && !(p_dw_pc == 1)) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev)) || ((((((((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-28 11:21:25,096 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((((((((((((((((((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)) || (p_dw_pc == 1 && (((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((((((tmp___1 == 1 && 2 == c_dr_st) && 1 <= q_free) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || ((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write) && 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_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write) || !(\old(p_dw_pc) == 1)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || ((((((((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(p_dw_pc) == 1) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || (((((((((((!(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) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && p_dw_pc == 1))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && ((((((((((((\old(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)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) [2018-11-28 11:21:25,097 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((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_dw_pc) == 1)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write)) && ((((((((q_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))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_pc == 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_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((((((!(p_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)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((p_dw_pc == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || 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)) || (((((((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && p_dw_pc == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && ((((((((((((\old(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)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) [2018-11-28 11:21:25,097 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && 1 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == \old(p_num_write))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((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)) || 0 < \old(q_req_up)) || \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))) && ((((((((((((((!(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))) && (((((((((((((1 == p_num_write || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || c_last_read == p_last_write) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && p_last_write == q_buf_0)) || (((((q_free == 0 && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((((((\old(p_dw_st) == 0 || (((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1) [2018-11-28 11:21:25,098 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) || ((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || ((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || \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)) || !(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) || ((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || !(1 == \old(p_dw_pc)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0)) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) [2018-11-28 11:21:25,098 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(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) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((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) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || (((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((q_free == 0 && 1 == \old(p_dw_pc)) && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || ((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && (p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) [2018-11-28 11:21:25,098 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 < \old(q_req_up)) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && ((((((((!(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))) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(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)))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || (((((!(0 == c_dr_st) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && (((q_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_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) [2018-11-28 11:21:25,098 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) && ((((((((((!(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)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(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))) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) [2018-11-28 11:21:25,098 WARN L221 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 || (((((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_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && ((((((((((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-28 11:21:25,134 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59a9615f-1797-4e2e-ae30-557f9ffa4937/bin-2019/uautomizer/witness.graphml [2018-11-28 11:21:25,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:21:25,135 INFO L168 Benchmark]: Toolchain (without parser) took 85232.10 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 956.0 MB in the beginning and 1.4 GB in the end (delta: -478.9 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-11-28 11:21:25,135 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:21:25,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.73 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:25,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.36 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:21:25,135 INFO L168 Benchmark]: Boogie Preprocessor took 60.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:25,136 INFO L168 Benchmark]: RCFGBuilder took 339.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:25,136 INFO L168 Benchmark]: TraceAbstraction took 84533.78 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.7 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-11-28 11:21:25,136 INFO L168 Benchmark]: Witness Printer took 84.95 ms. Allocated memory is still 4.3 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:21:25,137 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 195.73 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.36 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 339.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84533.78 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.7 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 84.95 ms. Allocated memory is still 4.3 GB. Free memory is still 1.4 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 || (((((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_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((c_num_read + 1 <= p_num_write && !(0 == c_dr_st)) && 1 == c_dr_pc) && q_free == 0) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && ((((((((((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: (((((((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) || ((q_free == 0 && 1 == p_num_write) && p_last_write == q_buf_0)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || ((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || \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)) || !(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) || ((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || !(1 == \old(p_dw_pc)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((q_free == 0 && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0)) || ((((((((q_free == 0 && !(c_dr_pc == 1)) && 1 == \old(p_dw_pc)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_i == 1) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || 2 == c_dr_st) && ((((((((((((((((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))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((((((((((((((((((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)) || (p_dw_pc == 1 && (((((2 == c_dr_st && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && 1 == p_num_write)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((((((tmp___1 == 1 && 2 == c_dr_st) && 1 <= q_free) && p_dw_pc == \old(p_dw_pc)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || ((((((((((2 == c_dr_st && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && 1 == p_num_write) && c_last_read == p_last_write) && 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_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && !(0 == tmp___1)) && c_last_read == p_last_write) || !(\old(p_dw_pc) == 1)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || ((((((((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(p_dw_pc) == 1) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || (((((((((((!(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) && q_free == 0) && 2 == p_dw_st) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && p_dw_pc == 1))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && ((((((((((((\old(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)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || 0 == __retres1) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < q_req_up) || 1 == c_dr_pc) || q_free < 1) || 0 == __retres1) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(c_last_read == p_last_write))) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(p_dw_st == 2)) || 0 == __retres1) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && ((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(q_free == 0)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || 0 < q_req_up)) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || 0 == __retres1) || (1 == p_dw_pc && !(0 == q_read_ev)))) && (((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || !(q_read_ev == 2)) || 0 == __retres1)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || p_num_write < c_num_read) || q_write_ev < 2) || q_free < 1) || 1 == q_req_up) || 0 == c_dr_st) || 0 == __retres1) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((((((0 == __retres1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || p_dw_pc == 1)) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2))) && ((((((((((p_num_write < c_num_read + 1 || q_write_ev < 2) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || c_num_read + 1 < p_num_write) || p_dw_pc == 1) || !(p_dw_st == 2))) && (((((((((((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)) && ((q_read_ev == 1 || 0 == __retres1) || ((((((((((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) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) && ((((((((((!(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)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(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))) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || ((((((p_num_write <= c_num_read && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(p_dw_i == 1) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_dw_pc == 1) && 2 == c_dr_st) && !(0 == q_write_ev)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1)) || ((((((((((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)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || ((((((q_free == 0 && 2 == p_dw_st) && !(0 == c_dr_st)) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && !(q_req_up == 1)) && p_last_write == q_buf_0)) || ((((((((p_last_write == q_buf_0 && 2 == q_read_ev) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && !(p_dw_pc == 1)) && 1 == p_num_write) && !(q_req_up == 1)) && q_read_ev == q_write_ev)) || ((((((q_free == 0 && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 == p_dw_st) && 2 <= q_write_ev) && !(q_req_up == 1))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && !(p_dw_pc == 1)) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_read_ev) == \old(q_write_ev))) || (((((((!(0 == c_dr_st) && 2 <= q_write_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && !(p_dw_pc == 1)) && !(q_req_up == 1))) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || (((((((((((1 <= q_free && !(c_dr_pc == 1)) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write)) || \old(q_free) < 1) || (p_dw_pc == 1 && ((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && 0 == p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || (((2 == p_dw_st && 2 <= q_write_ev) && !(q_req_up == 1)) && ((((q_free == 0 && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((((((((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 2 <= q_write_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1))) || ((((((((c_num_read == 0 && q_free == 0) && !(p_dw_pc == 1)) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up <= 0) && 2 == p_dw_st) && 2 <= q_write_ev)) || ((((((((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: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(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) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((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) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(q_free) < 1) || (((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((q_free == 0 && 1 == \old(p_dw_pc)) && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((\old(p_dw_st) == 0 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || ((!(0 == p_dw_st) && \old(q_req_up) == q_req_up) && (p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || !(0 == \old(p_num_write))) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((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_dw_pc) == 1)) || ((((((((\old(p_num_write) < \old(c_num_read) + 1 || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write)) && ((((((((q_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))) && ((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st)) && ((((((((((((q_write_ev < 2 || \old(p_num_write) < \old(c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write))) || 0 < \old(q_req_up)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((c_num_read + 1 <= p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_pc == 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_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == c_dr_st)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || \old(p_num_write) < \old(c_num_read)) || q_write_ev < 2) || \old(q_free) < 1) || 2 == c_dr_st) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 1 < \old(q_free)) || \old(c_num_read) < \old(p_num_write)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && 1 == p_num_write)) || !(\old(p_dw_st) == 2)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((p_dw_pc == \old(p_dw_pc) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || (((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && (((((((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st))) && ((((((((((((((((!(p_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)) || ((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_free == 0) && q_read_ev == q_write_ev) && p_dw_i == 1)) || 0 < \old(q_req_up)) || ((((((p_dw_pc == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 2 == p_dw_st) && 1 == p_num_write)) || 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)) || (((((((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && p_dw_pc == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((q_free == 0 && !(c_dr_pc == 1)) && !(0 == c_dr_st)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || (((((((((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2))) && ((((((((((((\old(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)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up) && p_num_write <= c_num_read + 1))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || ((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && 2 == p_dw_st) && \old(q_req_up) == q_req_up)) || 0 == \old(c_dr_st)) || (((((((p_num_write == \old(p_num_write) && !(0 == c_dr_st)) && p_dw_pc == \old(p_dw_pc)) && p_dw_st == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free == 0) && 1 == p_num_write) || 0 == c_dr_st) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(q_free) < 1) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == c_num_read)) || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && 0 == p_num_write)) || !(0 == \old(p_num_write))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 1 < \old(q_free)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((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)) || 0 < \old(q_req_up)) || \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))) && ((((((((((((((!(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))) && (((((((((((((1 == p_num_write || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || c_last_read == p_last_write) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || \old(q_free) < 1) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || 1 < \old(q_free)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((((q_free == 0 && p_num_write == \old(p_num_write)) && p_dw_pc == \old(p_dw_pc)) && !(p_dw_pc == 1)) && p_last_write == q_buf_0)) || (((((q_free == 0 && 1 == \old(p_dw_pc)) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((p_dw_pc == 1 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && q_free == 0) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (\old(p_num_write) < c_num_read || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || c_num_read < \old(p_num_write))) && ((((((((((\old(p_dw_st) == 0 || (((((p_num_write == \old(p_num_write) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0) && !(0 == p_dw_st)) && \old(q_req_up) == q_req_up)) || q_write_ev < 2) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) && (((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 1 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 < q_free) || !(0 == p_num_write)) || !(c_last_read == p_last_write))) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || 1 == __retres1) || p_dw_pc == 1)) && (((((((((((((!(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))) && (((__retres1 == 1 || !(0 == c_dr_st)) || !(p_dw_pc == 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_st == 2))) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || __retres1 == 1) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(0 == c_dr_st)) || 1 == c_dr_pc) || !(q_free == 0)) || !(1 == p_num_write)) || !(0 == c_num_read))) && ((1 == __retres1 || !(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)) - 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 == 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))) || (((!(0 == c_dr_st) && c_num_read == 0) && q_free == 0) && \old(q_req_up) == q_req_up)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && ((((((((((((((!(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)))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || (((((!(0 == c_dr_st) && 1 <= q_free) && c_num_read == 0) && \old(q_req_up) == q_req_up) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 < \old(q_req_up)) || 1 == \old(c_dr_pc)) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write))) && ((q_write_ev < 2 || (((((p_num_write < \old(c_num_read) + 1 || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && !(0 == c_dr_st)) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write))) && (((q_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_dw_pc == 1)) || ((((p_num_write < \old(c_num_read) + 1 || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) - 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) && ((((((((((((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) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) || 1 == q_write_ev)) && (((((((((((!(q_buf_0 == p_last_write) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 0 == __retres1) || 1 < q_free) || !(0 == p_num_write)) || 1 == c_dr_pc) || !(c_last_read == p_last_write))) && (0 == __retres1 || (q_write_ev < 2 || ((((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || !(2 == c_dr_st)) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || !(p_dw_st == 2)) || 0 < q_req_up)) && (((((((((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))) && (((((0 == __retres1 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || 1 == c_dr_pc)) && ((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) || !(p_dw_st == 2))) && ((0 == __retres1 || (q_write_ev < 2 || 1 == q_req_up) || ((((((((p_num_write < c_num_read || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(1 == c_dr_pc)) || 1 < q_free) || c_num_read < p_num_write) || !(c_last_read == p_last_write)) || !(p_dw_st == 2)) || !(q_read_ev == 1))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 130 locations, 1 error locations. SAFE Result, 84.4s OverallTime, 21 OverallIterations, 8 TraceHistogramMax, 15.7s AutomataDifference, 0.0s DeadEndRemovalTime, 57.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4212 SDtfs, 8369 SDslu, 5619 SDs, 0 SdLazy, 8753 SolverSat, 2939 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2005 GetRequests, 1817 SyntacticMatches, 16 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25958occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 11055 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 49238 PreInvPairs, 56728 NumberOfFragments, 25342 HoareAnnotationTreeSize, 49238 FomulaSimplifications, 386041 FormulaSimplificationTreeSizeReduction, 8.2s HoareSimplificationTime, 56 FomulaSimplificationsInter, 409259 FormulaSimplificationTreeSizeReductionInter, 48.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 4510 NumberOfCodeBlocks, 4510 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4481 ConstructedInterpolants, 0 QuantifiedInterpolants, 1252094 SizeOfPredicates, 13 NumberOfNonLiveVariables, 8190 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 3075/3177 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...