./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 aa63abe8d244d72d8b78f82e911235dbe511cfc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:55:08,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:55:08,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:55:08,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:55:08,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:55:08,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:55:08,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:55:08,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:55:08,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:55:08,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:55:08,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:55:08,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:55:08,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:55:08,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:55:08,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:55:08,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:55:08,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:55:08,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:55:08,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:55:08,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:55:08,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:55:08,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:55:08,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:55:08,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:55:08,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:55:08,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:55:08,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:55:08,276 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:55:08,277 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:55:08,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:55:08,279 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:55:08,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:55:08,280 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:55:08,280 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:55:08,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:55:08,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:55:08,283 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:55:08,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:55:08,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:55:08,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:55:08,300 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:55:08,301 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:55:08,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:55:08,301 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:55:08,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:55:08,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:55:08,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:55:08,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:55:08,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:55:08,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:55:08,303 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:55:08,303 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:55:08,303 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:55:08,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:55:08,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:55:08,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:55:08,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:55:08,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:55:08,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:55:08,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:55:08,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:55:08,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:55:08,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:55:08,307 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:55:08,307 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:55:08,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:55:08,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:55:08,307 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2018-11-28 18:55:08,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:55:08,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:55:08,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:55:08,368 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:55:08,369 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:55:08,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-28 18:55:08,444 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f4397cc/788a6bcb432d496197248e78a4c97936/FLAG418a41382 [2018-11-28 18:55:08,902 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:55:08,903 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-28 18:55:08,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f4397cc/788a6bcb432d496197248e78a4c97936/FLAG418a41382 [2018-11-28 18:55:09,250 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f4397cc/788a6bcb432d496197248e78a4c97936 [2018-11-28 18:55:09,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:55:09,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:55:09,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:55:09,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:55:09,259 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:55:09,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d20bde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09, skipping insertion in model container [2018-11-28 18:55:09,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:55:09,312 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:55:09,595 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:55:09,612 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:55:09,677 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:55:09,698 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:55:09,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09 WrapperNode [2018-11-28 18:55:09,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:55:09,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:55:09,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:55:09,700 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:55:09,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:55:09,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:55:09,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:55:09,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:55:09,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... [2018-11-28 18:55:09,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:55:09,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:55:09,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:55:09,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:55:09,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 18:55:09,935 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-28 18:55:09,936 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-28 18:55:09,936 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-28 18:55:09,936 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-28 18:55:09,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:55:09,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:55:09,937 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-28 18:55:09,937 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-28 18:55:09,937 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-28 18:55:09,937 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-28 18:55:09,937 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-11-28 18:55:09,937 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-11-28 18:55:09,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:55:09,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:55:09,938 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-28 18:55:09,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-28 18:55:09,938 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-28 18:55:09,938 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-28 18:55:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-28 18:55:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-28 18:55:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-28 18:55:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-28 18:55:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:55:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:55:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-28 18:55:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-28 18:55:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-28 18:55:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-28 18:55:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-28 18:55:09,943 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-28 18:55:10,708 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:55:10,709 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 18:55:10,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:55:10 BoogieIcfgContainer [2018-11-28 18:55:10,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:55:10,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:55:10,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:55:10,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:55:10,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:55:09" (1/3) ... [2018-11-28 18:55:10,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f98d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:55:10, skipping insertion in model container [2018-11-28 18:55:10,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:55:09" (2/3) ... [2018-11-28 18:55:10,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f98d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:55:10, skipping insertion in model container [2018-11-28 18:55:10,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:55:10" (3/3) ... [2018-11-28 18:55:10,720 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-28 18:55:10,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:55:10,741 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:55:10,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:55:10,800 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:55:10,800 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:55:10,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:55:10,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:55:10,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:55:10,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:55:10,801 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:55:10,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:55:10,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:55:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-11-28 18:55:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 18:55:10,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:10,837 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] [2018-11-28 18:55:10,840 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:10,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash 489843548, now seen corresponding path program 1 times [2018-11-28 18:55:10,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:10,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:10,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:11,178 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 18:55:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:11,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:55:11,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:55:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:55:11,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:55:11,205 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2018-11-28 18:55:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:11,398 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2018-11-28 18:55:11,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:55:11,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 18:55:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:11,416 INFO L225 Difference]: With dead ends: 279 [2018-11-28 18:55:11,417 INFO L226 Difference]: Without dead ends: 175 [2018-11-28 18:55:11,421 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 18:55:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-28 18:55:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-11-28 18:55:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-28 18:55:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-28 18:55:11,494 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2018-11-28 18:55:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:11,495 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-28 18:55:11,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:55:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-28 18:55:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 18:55:11,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:11,503 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] [2018-11-28 18:55:11,503 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:11,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash 343031424, now seen corresponding path program 1 times [2018-11-28 18:55:11,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:11,724 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 18:55:11,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:11,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:55:11,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:55:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:55:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:55:11,728 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2018-11-28 18:55:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:12,356 INFO L93 Difference]: Finished difference Result 469 states and 653 transitions. [2018-11-28 18:55:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:55:12,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 18:55:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:12,364 INFO L225 Difference]: With dead ends: 469 [2018-11-28 18:55:12,364 INFO L226 Difference]: Without dead ends: 318 [2018-11-28 18:55:12,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 18:55:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-28 18:55:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2018-11-28 18:55:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-28 18:55:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 411 transitions. [2018-11-28 18:55:12,445 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 411 transitions. Word has length 66 [2018-11-28 18:55:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:12,450 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 411 transitions. [2018-11-28 18:55:12,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:55:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 411 transitions. [2018-11-28 18:55:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 18:55:12,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:12,455 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] [2018-11-28 18:55:12,456 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:12,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash 229644767, now seen corresponding path program 1 times [2018-11-28 18:55:12,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:12,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:12,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:12,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:12,637 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 18:55:12,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:12,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:55:12,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:55:12,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:55:12,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:55:12,640 INFO L87 Difference]: Start difference. First operand 314 states and 411 transitions. Second operand 6 states. [2018-11-28 18:55:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:12,815 INFO L93 Difference]: Finished difference Result 575 states and 767 transitions. [2018-11-28 18:55:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:55:12,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 18:55:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:12,822 INFO L225 Difference]: With dead ends: 575 [2018-11-28 18:55:12,822 INFO L226 Difference]: Without dead ends: 324 [2018-11-28 18:55:12,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:55:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-28 18:55:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-11-28 18:55:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-28 18:55:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2018-11-28 18:55:12,872 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 66 [2018-11-28 18:55:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:12,872 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2018-11-28 18:55:12,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:55:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2018-11-28 18:55:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 18:55:12,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:12,880 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] [2018-11-28 18:55:12,880 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:12,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1490517977, now seen corresponding path program 1 times [2018-11-28 18:55:12,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:12,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:12,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:12,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:12,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:12,964 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 18:55:12,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:12,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:55:12,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:55:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:55:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:55:12,966 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand 4 states. [2018-11-28 18:55:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:13,418 INFO L93 Difference]: Finished difference Result 585 states and 748 transitions. [2018-11-28 18:55:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:55:13,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 18:55:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:13,423 INFO L225 Difference]: With dead ends: 585 [2018-11-28 18:55:13,423 INFO L226 Difference]: Without dead ends: 278 [2018-11-28 18:55:13,425 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 18:55:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-28 18:55:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-11-28 18:55:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-28 18:55:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 349 transitions. [2018-11-28 18:55:13,453 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 349 transitions. Word has length 66 [2018-11-28 18:55:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:13,453 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 349 transitions. [2018-11-28 18:55:13,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:55:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 349 transitions. [2018-11-28 18:55:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 18:55:13,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:13,457 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] [2018-11-28 18:55:13,457 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:13,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash -791423587, now seen corresponding path program 1 times [2018-11-28 18:55:13,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:13,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:13,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:13,667 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 18:55:13,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:13,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:55:13,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:55:13,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:55:13,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:55:13,669 INFO L87 Difference]: Start difference. First operand 278 states and 349 transitions. Second operand 6 states. [2018-11-28 18:55:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:16,006 INFO L93 Difference]: Finished difference Result 850 states and 1130 transitions. [2018-11-28 18:55:16,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:55:16,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 18:55:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:16,013 INFO L225 Difference]: With dead ends: 850 [2018-11-28 18:55:16,013 INFO L226 Difference]: Without dead ends: 589 [2018-11-28 18:55:16,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:55:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-11-28 18:55:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2018-11-28 18:55:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-28 18:55:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2018-11-28 18:55:16,060 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 66 [2018-11-28 18:55:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:16,060 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2018-11-28 18:55:16,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:55:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2018-11-28 18:55:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 18:55:16,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:16,064 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] [2018-11-28 18:55:16,064 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:16,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2070748322, now seen corresponding path program 1 times [2018-11-28 18:55:16,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:16,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:16,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:16,439 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 18:55:16,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:16,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:55:16,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:55:16,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:55:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:55:16,443 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand 6 states. [2018-11-28 18:55:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:16,669 INFO L93 Difference]: Finished difference Result 1140 states and 1459 transitions. [2018-11-28 18:55:16,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:55:16,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 18:55:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:16,676 INFO L225 Difference]: With dead ends: 1140 [2018-11-28 18:55:16,676 INFO L226 Difference]: Without dead ends: 616 [2018-11-28 18:55:16,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:55:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-11-28 18:55:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2018-11-28 18:55:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-28 18:55:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 735 transitions. [2018-11-28 18:55:16,726 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 735 transitions. Word has length 66 [2018-11-28 18:55:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:16,727 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 735 transitions. [2018-11-28 18:55:16,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:55:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 735 transitions. [2018-11-28 18:55:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 18:55:16,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:16,731 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] [2018-11-28 18:55:16,731 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:16,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash -295740960, now seen corresponding path program 1 times [2018-11-28 18:55:16,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:16,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:17,020 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 18:55:17,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:17,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:55:17,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:55:17,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:55:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:55:17,022 INFO L87 Difference]: Start difference. First operand 604 states and 735 transitions. Second operand 4 states. [2018-11-28 18:55:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:17,858 INFO L93 Difference]: Finished difference Result 842 states and 1059 transitions. [2018-11-28 18:55:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:55:17,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 18:55:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:17,866 INFO L225 Difference]: With dead ends: 842 [2018-11-28 18:55:17,867 INFO L226 Difference]: Without dead ends: 839 [2018-11-28 18:55:17,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:55:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-11-28 18:55:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 675. [2018-11-28 18:55:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-11-28 18:55:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2018-11-28 18:55:17,926 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 66 [2018-11-28 18:55:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:17,927 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2018-11-28 18:55:17,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:55:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2018-11-28 18:55:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 18:55:17,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:17,931 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] [2018-11-28 18:55:17,931 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:17,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash -578339491, now seen corresponding path program 1 times [2018-11-28 18:55:17,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:17,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:18,134 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 18:55:18,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:18,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:55:18,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:55:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:55:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:55:18,137 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand 3 states. [2018-11-28 18:55:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:18,330 INFO L93 Difference]: Finished difference Result 1249 states and 1576 transitions. [2018-11-28 18:55:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:55:18,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-28 18:55:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:18,338 INFO L225 Difference]: With dead ends: 1249 [2018-11-28 18:55:18,338 INFO L226 Difference]: Without dead ends: 655 [2018-11-28 18:55:18,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:55:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-11-28 18:55:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 567. [2018-11-28 18:55:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-11-28 18:55:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 677 transitions. [2018-11-28 18:55:18,395 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 677 transitions. Word has length 67 [2018-11-28 18:55:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:18,395 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 677 transitions. [2018-11-28 18:55:18,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:55:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 677 transitions. [2018-11-28 18:55:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 18:55:18,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:18,401 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] [2018-11-28 18:55:18,401 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:18,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:18,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1082734469, now seen corresponding path program 1 times [2018-11-28 18:55:18,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:18,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:18,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:18,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:18,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:18,647 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-28 18:55:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:55:18,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:55:18,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 18:55:18,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:19,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:55:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:55:19,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:55:19,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-28 18:55:19,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:55:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:55:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:55:19,322 INFO L87 Difference]: Start difference. First operand 567 states and 677 transitions. Second operand 7 states. [2018-11-28 18:55:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:23,330 INFO L93 Difference]: Finished difference Result 1850 states and 2333 transitions. [2018-11-28 18:55:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:55:23,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-11-28 18:55:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:23,341 INFO L225 Difference]: With dead ends: 1850 [2018-11-28 18:55:23,341 INFO L226 Difference]: Without dead ends: 930 [2018-11-28 18:55:23,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:55:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-11-28 18:55:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 759. [2018-11-28 18:55:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-28 18:55:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 948 transitions. [2018-11-28 18:55:23,425 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 948 transitions. Word has length 87 [2018-11-28 18:55:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:23,426 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 948 transitions. [2018-11-28 18:55:23,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:55:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 948 transitions. [2018-11-28 18:55:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 18:55:23,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:23,434 INFO L402 BasicCegarLoop]: trace histogram [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 18:55:23,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:23,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1369387122, now seen corresponding path program 1 times [2018-11-28 18:55:23,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:23,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 18:55:23,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:55:23,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 18:55:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:23,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:55:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:55:25,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:55:25,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-28 18:55:25,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:55:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:55:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:55:25,224 INFO L87 Difference]: Start difference. First operand 759 states and 948 transitions. Second operand 12 states. [2018-11-28 18:55:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:29,619 INFO L93 Difference]: Finished difference Result 2594 states and 4274 transitions. [2018-11-28 18:55:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 18:55:29,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-11-28 18:55:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:29,643 INFO L225 Difference]: With dead ends: 2594 [2018-11-28 18:55:29,643 INFO L226 Difference]: Without dead ends: 2591 [2018-11-28 18:55:29,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:55:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2018-11-28 18:55:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2512. [2018-11-28 18:55:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2018-11-28 18:55:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 4092 transitions. [2018-11-28 18:55:29,950 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 4092 transitions. Word has length 99 [2018-11-28 18:55:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:29,950 INFO L480 AbstractCegarLoop]: Abstraction has 2512 states and 4092 transitions. [2018-11-28 18:55:29,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:55:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 4092 transitions. [2018-11-28 18:55:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-28 18:55:29,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:29,959 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:29,959 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:29,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash 509314117, now seen corresponding path program 2 times [2018-11-28 18:55:29,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:29,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-28 18:55:30,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:55:30,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:55:30,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:55:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:55:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:55:30,069 INFO L87 Difference]: Start difference. First operand 2512 states and 4092 transitions. Second operand 3 states. [2018-11-28 18:55:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:30,400 INFO L93 Difference]: Finished difference Result 4236 states and 7499 transitions. [2018-11-28 18:55:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:55:30,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-28 18:55:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:30,423 INFO L225 Difference]: With dead ends: 4236 [2018-11-28 18:55:30,424 INFO L226 Difference]: Without dead ends: 2365 [2018-11-28 18:55:30,449 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 18:55:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-11-28 18:55:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2018-11-28 18:55:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-11-28 18:55:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3821 transitions. [2018-11-28 18:55:30,746 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3821 transitions. Word has length 125 [2018-11-28 18:55:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:30,747 INFO L480 AbstractCegarLoop]: Abstraction has 2365 states and 3821 transitions. [2018-11-28 18:55:30,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:55:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3821 transitions. [2018-11-28 18:55:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-28 18:55:30,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:55:30,757 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:30,757 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:55:30,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:55:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1972759988, now seen corresponding path program 1 times [2018-11-28 18:55:30,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:55:30,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:55:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:30,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:55:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:55:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:30,993 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-28 18:55:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 18:55:31,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:55:31,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 18:55:31,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:55:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:55:31,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:55:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 18:55:31,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:55:31,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-28 18:55:31,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:55:31,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:55:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:55:31,331 INFO L87 Difference]: Start difference. First operand 2365 states and 3821 transitions. Second operand 9 states. [2018-11-28 18:55:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:55:33,155 INFO L93 Difference]: Finished difference Result 3071 states and 5408 transitions. [2018-11-28 18:55:33,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:55:33,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-11-28 18:55:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:55:33,158 INFO L225 Difference]: With dead ends: 3071 [2018-11-28 18:55:33,158 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:55:33,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:55:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:55:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:55:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:55:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:55:33,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2018-11-28 18:55:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:55:33,190 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:55:33,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:55:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:55:33,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:55:33,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:55:33,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:33,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:34,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:35,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:36,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:55:38,647 WARN L180 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-28 18:55:40,092 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-11-28 18:55:40,293 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-28 18:55:41,004 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-11-28 18:55:41,299 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-11-28 18:55:41,437 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-11-28 18:55:42,227 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-11-28 18:55:42,364 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-28 18:55:43,387 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 130 DAG size of output: 86 [2018-11-28 18:55:44,179 WARN L180 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-11-28 18:55:44,894 WARN L180 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-11-28 18:55:45,230 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 37 [2018-11-28 18:55:45,745 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-11-28 18:55:48,343 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2018-11-28 18:55:48,524 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-11-28 18:55:49,119 WARN L180 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2018-11-28 18:55:49,745 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-11-28 18:55:49,908 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-28 18:55:50,026 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-28 18:55:52,351 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2018-11-28 18:55:53,492 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 143 DAG size of output: 112 [2018-11-28 18:55:54,543 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 134 DAG size of output: 96 [2018-11-28 18:55:55,406 WARN L180 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2018-11-28 18:55:55,567 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-11-28 18:55:56,114 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-28 18:55:58,463 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2018-11-28 18:55:58,572 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 1 [2018-11-28 18:55:58,845 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2018-11-28 18:55:59,259 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-11-28 18:55:59,698 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 43 [2018-11-28 18:56:01,129 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2018-11-28 18:56:02,039 WARN L180 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-11-28 18:56:02,591 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2018-11-28 18:56:02,595 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-11-28 18:56:02,595 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-28 18:56:02,595 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-11-28 18:56:02,596 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-11-28 18:56:02,596 INFO L451 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: true [2018-11-28 18:56:02,596 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-11-28 18:56:02,596 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-11-28 18:56:02,596 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-11-28 18:56:02,596 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~p_dw_i~0 1)) (= ~p_dw_pc~0 2) (not (= ~q_free~0 1)) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_st~0 0) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2018-11-28 18:56:02,596 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-11-28 18:56:02,597 INFO L444 ceAbstractionStarter]: At program point L354-1(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 1) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (= ~p_dw_i~0 1) (= ~p_last_write~0 ~q_buf_0~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)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 18:56:02,597 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= 1 ~c_dr_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) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (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(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 18:56:02,597 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-11-28 18:56:02,597 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-11-28 18:56:02,597 INFO L448 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-11-28 18:56:02,597 INFO L444 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= 1 ~c_dr_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) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (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(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 18:56:02,598 INFO L444 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse23 (= |old(~p_dw_pc~0)| 1)) (.cse25 (= ~p_dw_i~0 1))) (let ((.cse12 (= ~q_free~0 0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse25)) (.cse17 (not .cse23)) (.cse2 (not .cse18)) (.cse24 (not (= ~p_dw_st~0 1))) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= 1 ~p_dw_pc~0))) (let ((.cse19 (= 0 |old(~c_dr_st~0)|)) (.cse20 (and .cse2 .cse24 (not (= ~c_dr_st~0 0)) .cse25 .cse14 .cse16)) (.cse21 (or .cse18 .cse0 .cse1 .cse17)) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse22 (and .cse2 .cse24 (= 2 ~c_dr_st~0) .cse25 .cse14 .cse16)) (.cse3 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse5 (not (= 0 |old(~p_num_write~0)|))) (.cse6 (= |old(~p_dw_st~0)| 0)) (.cse9 (= |old(~p_dw_st~0)| 2)) (.cse10 (not (= 0 ~c_num_read~0))) (.cse8 (and .cse12 .cse13 (= 1 ~p_num_write~0) .cse14 .cse16)) (.cse11 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse6 (let ((.cse15 (+ |old(~p_num_write~0)| 1))) (and .cse12 .cse13 .cse14 (<= .cse15 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse15))) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse0 .cse1 .cse2 .cse17) .cse7 .cse9 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse18 .cse0 .cse1 .cse19 .cse4 .cse9 .cse20 .cse11) (or .cse21 .cse19 .cse9 .cse20) (or .cse21 .cse7 .cse9 .cse22) (or .cse18 .cse0 .cse1 .cse7 .cse4 .cse9 .cse22 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse18 .cse9 .cse23 .cse10 .cse8 .cse11))))) [2018-11-28 18:56:02,598 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_pc~0)| 1))) (let ((.cse7 (= 1 ~c_dr_pc~0)) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse8 (not .cse16))) (let ((.cse2 (= 2 ~c_dr_st~0)) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse0 (or .cse7 .cse5 .cse6 .cse8)) (.cse4 (= |old(~p_dw_st~0)| 0)) (.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (= 0 ~p_num_write~0)) (.cse17 (not (= 0 ~c_num_read~0))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse18 (= ~q_free~0 1)) (.cse9 (not (= ~p_dw_st~0 2))) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (not (= ~c_dr_st~0 0))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse3 (= |old(~p_dw_st~0)| 2)) (.cse21 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse5 .cse6 (not .cse7) .cse8) .cse1 .cse3 (< ~c_num_read~0 |old(~p_num_write~0)|)) (and (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse9 .cse2 .cse10) .cse11 .cse12)) (or .cse5 .cse6 .cse13 .cse14 .cse15 .cse4 .cse1 .cse3 .cse16 .cse17 (and .cse18 .cse2 .cse10 .cse11 .cse9 .cse19 .cse12 .cse20) .cse21) (or .cse7 .cse2 .cse5 .cse6 .cse1 .cse14 .cse3 .cse21) (or (and .cse9 .cse22 .cse10 (= 1 ~p_dw_pc~0)) .cse0 .cse23 .cse3) (or .cse4 .cse7 .cse5 .cse6 .cse13 .cse14 .cse3 (and .cse18 .cse10 .cse11 .cse9 .cse19 .cse12 .cse20) .cse16 .cse17 .cse15 .cse21) (or .cse7 .cse5 .cse6 .cse23 (and .cse18 .cse9 (not (= ~p_dw_pc~0 1)) .cse19 .cse22 .cse10) .cse14 .cse3 .cse16 .cse21))))) [2018-11-28 18:56:02,599 INFO L444 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_pc~0)| 1))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (not .cse16)) (.cse13 (= 1 ~c_dr_pc~0))) (let ((.cse3 (not .cse13)) (.cse19 (= |old(~p_dw_pc~0)| 2)) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse21 (= 1 ~p_num_write~0)) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse22 (not (= 0 ~c_num_read~0))) (.cse5 (not (= 2 |old(~c_dr_st~0)|))) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse7 (= 2 ~c_dr_st~0)) (.cse18 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (not (= ~p_dw_st~0 2))) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (or .cse13 .cse1 .cse2 .cse4)) (.cse14 (= 0 |old(~c_dr_st~0)|)) (.cse6 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (< ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse7 .cse8 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9 .cse10 .cse11 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse12)) (or .cse13 .cse1 .cse2 .cse14 .cse15 .cse6 .cse16 (and .cse11 (not (= ~p_dw_pc~0 1)) .cse17 .cse8) .cse18) (or .cse1 .cse2 .cse19 .cse15 .cse20 .cse0 .cse13 (and .cse9 .cse10 .cse11 .cse21 .cse12 .cse8) .cse6 .cse16 .cse22 .cse18) (or .cse1 .cse2 .cse3 .cse19 .cse15 .cse20 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12) .cse0 .cse5 .cse6 .cse22 .cse18) (or .cse23 .cse5 .cse7 .cse6) (or .cse13 .cse1 .cse2 .cse5 .cse15 .cse7 .cse6 .cse18) (or (and .cse11 .cse17 .cse8 (= 1 ~p_dw_pc~0)) .cse23 .cse14 .cse6))))) [2018-11-28 18:56:02,599 INFO L448 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-11-28 18:56:02,599 INFO L448 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-11-28 18:56:02,599 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-11-28 18:56:02,599 INFO L444 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse22 (not .cse6)) (.cse0 (= 1 ~c_dr_pc~0))) (let ((.cse21 (not .cse0)) (.cse14 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse17 (not (= ~p_dw_st~0 0))) (.cse13 (= 2 ~c_dr_st~0)) (.cse18 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse19 (= 0 ~p_num_write~0)) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (= |old(~p_dw_st~0)| 0)) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse20 (not (= 0 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_st~0 2))) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (or .cse0 .cse1 .cse2 .cse22)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (not (= ~p_dw_pc~0 1)) .cse8 .cse9) .cse10) (or .cse11 .cse12 .cse13 .cse5) (or .cse1 .cse2 .cse14 .cse4 .cse15 .cse16 .cse0 (and .cse17 .cse7 .cse18 .cse9 .cse19) .cse5 .cse6 .cse20 .cse10) (or .cse16 (and .cse17 (and (= ~p_num_write~0 |old(~p_num_write~0)|) (and .cse7 .cse13 .cse9)) .cse18) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse2 .cse21 .cse22) .cse12 .cse5 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse1 .cse2 .cse12 .cse4 .cse13 .cse5 .cse10) (or .cse1 .cse2 .cse21 .cse14 .cse4 (and .cse17 .cse7 .cse13 .cse18 .cse9 .cse19) .cse15 .cse16 .cse12 .cse5 .cse20 .cse10) (or (and .cse7 .cse8 .cse9 (= 1 ~p_dw_pc~0)) .cse11 .cse3 .cse5))))) [2018-11-28 18:56:02,600 INFO L444 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1))) (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse15 (not .cse6)) (.cse23 (not (= ~p_dw_st~0 0))) (.cse12 (= ~q_free~0 0)) (.cse7 (not (= ~p_dw_st~0 2))) (.cse25 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse18 (= 2 ~c_dr_st~0)) (.cse19 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (= |old(~p_dw_st~0)| 0)) (.cse27 (and .cse23 .cse12 .cse7 (= 1 ~p_num_write~0) .cse25 .cse9)) (.cse22 (= ~q_free~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= 0 ~p_num_write~0)) (.cse21 (not (= 0 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse8 (not (= ~c_dr_st~0 0))) (.cse13 (= 1 ~p_dw_pc~0)) (.cse17 (or .cse0 .cse1 .cse2 .cse15)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (not (= ~p_dw_pc~0 1)) .cse8 .cse9) .cse10) (or .cse11 (let ((.cse14 (+ |old(~p_num_write~0)| 1))) (and .cse12 (and .cse7 .cse9 .cse13) (<= .cse14 ~p_num_write~0) (<= ~p_num_write~0 .cse14))) (or (< |old(~p_num_write~0)| ~c_num_read~0) (or .cse1 .cse2 (not .cse0) .cse15) .cse16 .cse5 (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse17 .cse16 .cse18 .cse5) (or .cse1 .cse2 .cse19 .cse4 .cse20 .cse11 .cse16 .cse5 .cse6 .cse21 (and .cse22 .cse18 .cse9 .cse23 .cse7 .cse24 .cse25 .cse26) .cse10 .cse27) (or .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse10) (or .cse1 .cse2 .cse19 .cse4 .cse20 .cse11 .cse0 .cse27 .cse5 (and .cse22 .cse9 .cse23 .cse7 .cse24 .cse25 .cse26) .cse6 .cse21 .cse10) (or (and .cse7 .cse8 .cse9 .cse13) .cse17 .cse3 .cse5))))) [2018-11-28 18:56:02,600 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-11-28 18:56:02,600 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-28 18:56:02,601 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-28 18:56:02,601 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-28 18:56:02,601 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-28 18:56:02,601 INFO L444 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse14 (= ~p_dw_st~0 0))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse1 (= 1 ~c_dr_pc~0)) (.cse24 (= 2 ~c_dr_st~0)) (.cse6 (not .cse14)) (.cse7 (not (= ~p_dw_st~0 2)))) (let ((.cse4 (= ~p_dw_pc~0 2)) (.cse11 (not (= 0 ~c_num_read~0))) (.cse8 (not (= 1 ~p_num_write~0))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~q_free~0 0))) (.cse17 (and .cse24 .cse6 .cse7)) (.cse23 (not .cse1)) (.cse19 (and (<= 2 ~p_dw_st~0) .cse13)) (.cse15 (not .cse10)) (.cse18 (not (= ~q_free~0 1))) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse20 (< |old(~p_dw_st~0)| 2)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse12 .cse9 (and .cse7 .cse13)) (or .cse14 (or .cse1 .cse2 .cse3 .cse15) .cse12 (not .cse0)) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse8 .cse9 .cse10 .cse11 .cse17) (or .cse2 .cse3 .cse15 .cse18 .cse19 .cse12 .cse8 (not (= 1 ~c_num_read~0)) .cse20 .cse21) (let ((.cse22 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse22) (or .cse16 (or .cse2 .cse3 .cse23 .cse15) .cse9) .cse5 (< .cse22 ~p_num_write~0) .cse17)) (or .cse2 .cse3 .cse23 .cse19 .cse15 .cse18 (< ~p_num_write~0 ~c_num_read~0) .cse12 (< ~c_num_read~0 ~p_num_write~0) .cse20 .cse21) (or .cse1 .cse2 .cse3 .cse16 .cse24 .cse9))))) [2018-11-28 18:56:02,601 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-11-28 18:56:02,601 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-28 18:56:02,601 INFO L448 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-11-28 18:56:02,601 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-11-28 18:56:02,601 INFO L448 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-11-28 18:56:02,602 INFO L444 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse14 (= ~p_dw_st~0 0))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse1 (= 1 ~c_dr_pc~0)) (.cse24 (= 2 ~c_dr_st~0)) (.cse6 (not .cse14)) (.cse7 (not (= ~p_dw_st~0 2)))) (let ((.cse4 (= ~p_dw_pc~0 2)) (.cse11 (not (= 0 ~c_num_read~0))) (.cse8 (not (= 1 ~p_num_write~0))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~q_free~0 0))) (.cse17 (and .cse24 .cse6 .cse7)) (.cse23 (not .cse1)) (.cse19 (and (<= 2 ~p_dw_st~0) .cse13)) (.cse15 (not .cse10)) (.cse18 (not (= ~q_free~0 1))) (.cse12 (= 0 |old(~c_dr_st~0)|)) (.cse20 (< |old(~p_dw_st~0)| 2)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse12 .cse9 (and .cse7 .cse13)) (or .cse14 (or .cse1 .cse2 .cse3 .cse15) .cse12 (not .cse0)) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse8 .cse9 .cse10 .cse11 .cse17) (or .cse2 .cse3 .cse15 .cse18 .cse19 .cse12 .cse8 (not (= 1 ~c_num_read~0)) .cse20 .cse21) (let ((.cse22 (+ ~c_num_read~0 1))) (or .cse0 (< ~p_num_write~0 .cse22) (or .cse16 (or .cse2 .cse3 .cse23 .cse15) .cse9) .cse5 (< .cse22 ~p_num_write~0) .cse17)) (or .cse2 .cse3 .cse23 .cse19 .cse15 .cse18 (< ~p_num_write~0 ~c_num_read~0) .cse12 (< ~c_num_read~0 ~p_num_write~0) .cse20 .cse21) (or .cse1 .cse2 .cse3 .cse16 .cse24 .cse9))))) [2018-11-28 18:56:02,602 INFO L444 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse21 (= ~p_dw_pc~0 1))) (let ((.cse3 (= immediate_notify_threads_~tmp~0 0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse4 (= ~p_dw_st~0 0)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse7 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (not .cse21))) (let ((.cse0 (or .cse17 .cse7 .cse8 .cse9)) (.cse19 (= ~p_dw_pc~0 2)) (.cse18 (not .cse4)) (.cse13 (not (= 1 ~p_num_write~0))) (.cse22 (not (= 0 ~c_num_read~0))) (.cse16 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~p_dw_st~0 2))) (.cse24 (= 2 ~c_dr_st~0)) (.cse23 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (= |old(~p_dw_st~0)| 2)) (.cse20 (not (= ~q_free~0 0))) (.cse12 (and (<= 2 ~p_dw_st~0) .cse3 .cse6)) (.cse10 (not (= ~q_free~0 1))) (.cse1 (= 0 |old(~c_dr_st~0)|)) (.cse11 (and .cse4 .cse6)) (.cse14 (< |old(~p_dw_st~0)| 2)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 (and (or .cse3 .cse4) .cse5 .cse6)) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 (not (= 1 ~c_num_read~0)) .cse14 .cse15) (or .cse16 .cse17 (and .cse18 .cse3 .cse5) .cse7 .cse8 .cse19 .cse20 .cse13 .cse2 .cse21 .cse22) (or .cse17 .cse7 .cse8 .cse23 .cse2 .cse24) (or .cse4 .cse0 .cse1 (not .cse16)) (or .cse16 .cse7 .cse8 .cse19 .cse20 .cse23 (and .cse24 .cse18 .cse3 .cse5) .cse13 .cse2 .cse21 .cse22) (or (and .cse3 .cse5 .cse6) .cse17 .cse7 .cse8 .cse1 .cse2 .cse21) (let ((.cse25 (+ ~c_num_read~0 1))) (or .cse16 (< ~p_num_write~0 .cse25) (and (or .cse4 .cse3) .cse5 .cse24) (or .cse23 (or .cse7 .cse8 .cse9) .cse2) .cse20 (< .cse25 ~p_num_write~0))) (or .cse12 .cse7 .cse8 (not .cse17) .cse9 .cse10 (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse11 (< ~c_num_read~0 ~p_num_write~0) .cse14 .cse15))))) [2018-11-28 18:56:02,602 INFO L448 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-11-28 18:56:02,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:56:02,602 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(~p_dw_pc~0)| ~p_dw_pc~0)) [2018-11-28 18:56:02,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:56:02,603 INFO L448 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-11-28 18:56:02,603 INFO L451 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-11-28 18:56:02,603 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-11-28 18:56:02,603 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-11-28 18:56:02,603 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-11-28 18:56:02,603 INFO L451 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-11-28 18:56:02,603 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-11-28 18:56:02,604 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse22 (= |old(~p_dw_pc~0)| 1)) (.cse0 (= 1 |old(~c_dr_pc~0)|))) (let ((.cse32 (= 1 ~c_dr_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse34 (not .cse0)) (.cse5 (not .cse22)) (.cse40 (+ |old(~c_num_read~0)| 1))) (let ((.cse26 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse35 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse20 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse21 (= 0 ~p_num_write~0)) (.cse24 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (= ~c_num_read~0 0)) (.cse23 (not (= 0 |old(~c_num_read~0)|))) (.cse38 (= |old(~p_dw_st~0)| 1)) (.cse37 (= ~q_free~0 0)) (.cse30 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse36 (<= 2 ~p_dw_st~0)) (.cse33 (= 1 ~p_dw_pc~0)) (.cse7 (< |old(~p_num_write~0)| .cse40)) (.cse8 (or .cse1 .cse2 .cse34 .cse5)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse27 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (< .cse40 |old(~p_num_write~0)|)) (.cse31 (= 2 ~c_dr_st~0)) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse15 (not .cse32)) (.cse16 (= ~q_free~0 1)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse6 (and .cse15 .cse16 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25) (or .cse26 .cse27 (and .cse28 .cse29 .cse30 .cse3 .cse31 .cse32 .cse17 .cse33) (or .cse1 .cse2 .cse34 .cse5 .cse6) .cse35) (or .cse8 .cse26 .cse27 .cse35 .cse12 (and .cse28 .cse29 .cse30 .cse36 .cse31 .cse32 .cse17 .cse33)) (or .cse1 .cse2 .cse34 .cse13 .cse27 (and .cse16 .cse3 .cse31 .cse32 .cse17 .cse18 .cse19 .cse20 .cse21) .cse14 .cse6 .cse22 .cse23 .cse24 .cse25) (or (and .cse18 .cse15 .cse37 .cse36 (= 1 ~p_num_write~0) .cse17 .cse33) .cse0 .cse1 .cse2 .cse9 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse12) (or .cse0 .cse1 .cse2 .cse4 .cse5 (and .cse15 (not (= ~p_dw_st~0 1)) .cse10 .cse17 .cse33) .cse38) (or .cse31 .cse0 .cse1 .cse2 .cse27 .cse14 .cse6 .cse25) (or .cse0 .cse1 .cse2 .cse27 .cse5 .cse31 .cse38) (or .cse7 .cse8 .cse9 .cse11 (let ((.cse39 (+ ~c_num_read~0 1))) (and .cse37 (<= .cse39 ~p_num_write~0) .cse30 .cse36 (<= ~p_num_write~0 .cse39) .cse32 .cse17 .cse33)) .cse12) (or .cse7 .cse8 .cse9 .cse27 .cse11 .cse31 .cse12) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 (not (= ~p_dw_pc~0 1)) .cse19 .cse3 .cse10 .cse17) .cse4 .cse14 .cse6 .cse22 .cse25))))) [2018-11-28 18:56:02,604 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse22 (= 1 ~c_dr_pc~0)) (.cse32 (= |old(~p_dw_pc~0)| 1)) (.cse10 (= 1 |old(~c_dr_pc~0)|)) (.cse36 (= ~p_dw_i~0 1))) (let ((.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse36)) (.cse4 (not .cse10)) (.cse5 (not .cse32)) (.cse25 (not (= ~p_dw_st~0 0))) (.cse9 (= 2 ~c_dr_st~0)) (.cse38 (+ |old(~c_num_read~0)| 1)) (.cse37 (= 1 ~p_dw_pc~0)) (.cse31 (not .cse22)) (.cse21 (= ~q_free~0 1)) (.cse26 (not (= ~p_dw_st~0 2))) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse39 (not (= ~c_dr_st~0 0))) (.cse23 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse15 (= |old(~p_dw_st~0)| 1)) (.cse19 (= |old(~p_dw_pc~0)| 2)) (.cse30 (and .cse31 .cse21 .cse26 (not (= ~p_dw_pc~0 1)) .cse27 .cse39 .cse36 .cse23)) (.cse11 (not (= |old(~q_free~0)| 1))) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (and .cse31 .cse26 .cse39 .cse36 .cse23 .cse37)) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse24 (= ~c_num_read~0 0)) (.cse28 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse29 (= 0 ~p_num_write~0)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse14 (= 0 |old(~c_dr_st~0)|)) (.cse33 (< |old(~p_num_write~0)| .cse38)) (.cse16 (not (= |old(~q_free~0)| 0))) (.cse35 (< .cse38 |old(~p_num_write~0)|)) (.cse7 (and .cse25 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse26 .cse9 .cse36 .cse22 .cse23 .cse37))) (.cse34 (or .cse2 .cse3 .cse4 .cse5)) (.cse0 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse18 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8) (or .cse9 .cse10 .cse2 .cse3 .cse1 .cse11 .cse6 .cse12) (or .cse13 .cse10 .cse2 .cse3 .cse14 .cse5 .cse15) (or .cse10 .cse2 .cse3 .cse1 .cse9 .cse5 .cse15) (or .cse2 .cse3 .cse5 .cse7 .cse13 .cse16 (not (= 1 |old(~p_num_write~0)|)) .cse17 .cse18) (or .cse2 .cse3 .cse4 .cse19 .cse11 .cse7 .cse20 .cse1 .cse6 .cse17 (and .cse21 .cse9 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse12) (or .cse13 .cse10 .cse2 .cse3 .cse30 .cse14 .cse11 .cse6 .cse12) (or .cse2 .cse3 .cse19 .cse30 .cse11 .cse7 (and .cse21 .cse9 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse20 .cse13 .cse10 .cse6 (and .cse31 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse32 .cse17 .cse12) (or .cse33 .cse34 .cse16 .cse35 .cse14 .cse18) (or .cse33 .cse34 .cse16 .cse35 .cse7 .cse18) (or .cse34 .cse0 .cse1 .cse8 .cse18))))) [2018-11-28 18:56:02,604 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-11-28 18:56:02,604 INFO L448 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-11-28 18:56:02,604 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-28 18:56:02,605 INFO L444 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse35 (= 1 ~c_dr_pc~0)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse45 (= ~p_dw_i~0 1)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse47 ~p_num_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse46 (= ~q_free~0 0)) (.cse41 (<= ~c_num_read~0 ~p_num_write~0)) (.cse42 (<= ~p_num_write~0 ~c_num_read~0)) (.cse43 (<= 2 ~p_dw_st~0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse44 (= 1 ~p_dw_pc~0)) (.cse29 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (not .cse45)) (.cse34 (not .cse16)) (.cse37 (not .cse26)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse25 (not .cse35)) (.cse17 (= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse20 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse23 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse31 (not (= 0 |old(~p_num_write~0)|))) (.cse30 (and .cse25 .cse17 .cse22 .cse18 .cse10 .cse45 .cse20)) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse39 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse33 (not (= |old(~p_dw_st~0)| 0))) (.cse40 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse48)) (.cse1 (or .cse29 .cse12 .cse34 .cse37)) (.cse36 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (< .cse48 |old(~p_num_write~0)|)) (.cse3 (and .cse41 .cse42 .cse43 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse4 (and .cse41 .cse42 .cse18 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse14 (and .cse21 .cse46 .cse43 (= 1 ~p_num_write~0) .cse20 .cse44)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse6 (and .cse46 .cse8 .cse43 (<= ~p_num_write~0 .cse47) .cse45 .cse35 .cse20 .cse44)) (.cse27 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse32 (and .cse25 (not (= ~p_dw_st~0 1)) .cse10 .cse45 .cse20 .cse44)) (.cse38 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse5 (and .cse8 .cse9 .cse10) .cse2 .cse11 .cse7) (or .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) .cse6 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse3 .cse33) (or .cse12 .cse34 .cse13 (and .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse22 .cse23 .cse24) .cse15 .cse4 .cse36 .cse6 .cse27 .cse28 .cse29 .cse31 .cse3 .cse33) (or .cse19 .cse16 .cse29 .cse12 .cse36 .cse15 .cse33 .cse28) (or .cse16 .cse29 .cse12 .cse36 .cse37 .cse19 .cse38) (or .cse16 .cse29 .cse12 .cse30 .cse11 .cse15 .cse33 .cse32 .cse28) (or .cse1 .cse39 .cse36 .cse40 .cse7 (and .cse41 .cse42 .cse9 .cse43 .cse19 .cse35 .cse20 .cse44)) (or .cse39 .cse36 (or .cse29 .cse12 .cse34 .cse37 .cse33) .cse6 .cse40 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse36 .cse2 .cse19 .cse7) (or .cse29 .cse12 .cse37 .cse3 .cse32 .cse4 .cse14 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse27 .cse7) (or .cse16 .cse29 .cse12 .cse11 .cse37 .cse32 .cse38))))) [2018-11-28 18:56:02,605 INFO L444 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse19 (= |old(~p_dw_pc~0)| 1)) (.cse31 (= ~p_dw_i~0 1))) (let ((.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not .cse31)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse28 (not .cse19)) (.cse10 (= ~q_free~0 0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse17 (= 1 ~c_dr_pc~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= 1 ~p_dw_pc~0)) (.cse32 (+ |old(~c_num_read~0)| 1))) (let ((.cse8 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= |old(~q_free~0)| 1))) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse22 (< |old(~p_num_write~0)| .cse32)) (.cse25 (< .cse32 |old(~p_num_write~0)|)) (.cse5 (not (= |old(~p_dw_st~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse7 (let ((.cse30 (+ ~c_num_read~0 1))) (and .cse10 (<= .cse30 ~p_num_write~0) .cse11 (<= ~p_num_write~0 .cse30) .cse13 .cse31 .cse17 .cse14 .cse15))) (.cse24 (not (= |old(~q_free~0)| 0))) (.cse9 (= ~c_num_read~0 0)) (.cse12 (= 1 ~p_num_write~0)) (.cse18 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (not (= 0 |old(~c_num_read~0)|))) (.cse23 (or .cse1 .cse2 (not .cse0) .cse28)) (.cse27 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse21 (not (= 2 |old(~c_dr_st~0)|))) (.cse29 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse26 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse1 .cse2 .cse8 .cse4 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse0 (and (not .cse17) (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse14 .cse9 (= ~c_last_read~0 ~p_last_write~0) .cse13 .cse18 (= 0 ~p_num_write~0)) .cse5 .cse19 .cse20 .cse6) (or .cse7 .cse1 .cse2 .cse8 .cse4 .cse16 .cse21 .cse5 .cse20 .cse6) (or .cse22 .cse23 .cse7 .cse24 .cse25 .cse26) (or .cse22 .cse23 .cse24 .cse25 .cse3 .cse26) (or .cse7 .cse27 .cse21 (or .cse1 .cse2 .cse28 .cse5) .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse28 (= |old(~p_dw_st~0)| 1)) (or .cse7 .cse1 .cse2 .cse24 .cse28 (not (= 1 |old(~p_num_write~0)|)) (and .cse11 .cse14 .cse9 .cse10 .cse12 .cse13 .cse18) .cse20 .cse26) (or .cse23 .cse27 .cse21 .cse29 .cse26))))) [2018-11-28 18:56:02,606 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-11-28 18:56:02,606 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-11-28 18:56:02,606 INFO L448 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-11-28 18:56:02,606 INFO L444 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse35 (= 1 ~c_dr_pc~0)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse45 (= ~p_dw_i~0 1)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse47 ~p_num_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse46 (= ~q_free~0 0)) (.cse41 (<= ~c_num_read~0 ~p_num_write~0)) (.cse42 (<= ~p_num_write~0 ~c_num_read~0)) (.cse43 (<= 2 ~p_dw_st~0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse44 (= 1 ~p_dw_pc~0)) (.cse29 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (not .cse45)) (.cse34 (not .cse16)) (.cse37 (not .cse26)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse25 (not .cse35)) (.cse17 (= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse20 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse23 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse31 (not (= 0 |old(~p_num_write~0)|))) (.cse30 (and .cse25 .cse17 .cse22 .cse18 .cse10 .cse45 .cse20)) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse39 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse33 (not (= |old(~p_dw_st~0)| 0))) (.cse40 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse48)) (.cse1 (or .cse29 .cse12 .cse34 .cse37)) (.cse36 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (< .cse48 |old(~p_num_write~0)|)) (.cse3 (and .cse41 .cse42 .cse43 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse4 (and .cse41 .cse42 .cse18 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse14 (and .cse21 .cse46 .cse43 (= 1 ~p_num_write~0) .cse20 .cse44)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse6 (and .cse46 .cse8 .cse43 (<= ~p_num_write~0 .cse47) .cse45 .cse35 .cse20 .cse44)) (.cse27 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse32 (and .cse25 (not (= ~p_dw_st~0 1)) .cse10 .cse45 .cse20 .cse44)) (.cse38 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse5 (and .cse8 .cse9 .cse10) .cse2 .cse11 .cse7) (or .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) .cse6 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse3 .cse33) (or .cse12 .cse34 .cse13 (and .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse22 .cse23 .cse24) .cse15 .cse4 .cse36 .cse6 .cse27 .cse28 .cse29 .cse31 .cse3 .cse33) (or .cse19 .cse16 .cse29 .cse12 .cse36 .cse15 .cse33 .cse28) (or .cse16 .cse29 .cse12 .cse36 .cse37 .cse19 .cse38) (or .cse16 .cse29 .cse12 .cse30 .cse11 .cse15 .cse33 .cse32 .cse28) (or .cse1 .cse39 .cse36 .cse40 .cse7 (and .cse41 .cse42 .cse9 .cse43 .cse19 .cse35 .cse20 .cse44)) (or .cse39 .cse36 (or .cse29 .cse12 .cse34 .cse37 .cse33) .cse6 .cse40 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse36 .cse2 .cse19 .cse7) (or .cse29 .cse12 .cse37 .cse3 .cse32 .cse4 .cse14 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse27 .cse7) (or .cse16 .cse29 .cse12 .cse11 .cse37 .cse32 .cse38))))) [2018-11-28 18:56:02,606 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-11-28 18:56:02,607 INFO L444 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse35 (= 1 ~c_dr_pc~0)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= 1 |old(~c_dr_pc~0)|)) (.cse45 (= ~p_dw_i~0 1)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse47 ~p_num_write~0)) (.cse21 (= ~c_num_read~0 0)) (.cse46 (= ~q_free~0 0)) (.cse41 (<= ~c_num_read~0 ~p_num_write~0)) (.cse42 (<= ~p_num_write~0 ~c_num_read~0)) (.cse43 (<= 2 ~p_dw_st~0)) (.cse19 (= 2 ~c_dr_st~0)) (.cse44 (= 1 ~p_dw_pc~0)) (.cse29 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (not .cse45)) (.cse34 (not .cse16)) (.cse37 (not .cse26)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse25 (not .cse35)) (.cse17 (= ~q_free~0 1)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse20 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (= |old(~p_dw_pc~0)| 2)) (.cse23 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse24 (= 0 ~p_num_write~0)) (.cse31 (not (= 0 |old(~p_num_write~0)|))) (.cse30 (and .cse25 .cse17 .cse22 .cse18 .cse10 .cse45 .cse20)) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse39 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse33 (not (= |old(~p_dw_st~0)| 0))) (.cse40 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse0 (< |old(~p_num_write~0)| .cse48)) (.cse1 (or .cse29 .cse12 .cse34 .cse37)) (.cse36 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (< .cse48 |old(~p_num_write~0)|)) (.cse3 (and .cse41 .cse42 .cse43 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse4 (and .cse41 .cse42 .cse18 .cse19 .cse45 .cse35 .cse20 .cse44)) (.cse14 (and .cse21 .cse46 .cse43 (= 1 ~p_num_write~0) .cse20 .cse44)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse6 (and .cse46 .cse8 .cse43 (<= ~p_num_write~0 .cse47) .cse45 .cse35 .cse20 .cse44)) (.cse27 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse32 (and .cse25 (not (= ~p_dw_st~0 1)) .cse10 .cse45 .cse20 .cse44)) (.cse38 (= |old(~p_dw_st~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse5 (and .cse8 .cse9 .cse10) .cse2 .cse11 .cse7) (or .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) .cse6 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse3 .cse33) (or .cse12 .cse34 .cse13 (and .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse22 .cse23 .cse24) .cse15 .cse4 .cse36 .cse6 .cse27 .cse28 .cse29 .cse31 .cse3 .cse33) (or .cse19 .cse16 .cse29 .cse12 .cse36 .cse15 .cse33 .cse28) (or .cse16 .cse29 .cse12 .cse36 .cse37 .cse19 .cse38) (or .cse16 .cse29 .cse12 .cse30 .cse11 .cse15 .cse33 .cse32 .cse28) (or .cse1 .cse39 .cse36 .cse40 .cse7 (and .cse41 .cse42 .cse9 .cse43 .cse19 .cse35 .cse20 .cse44)) (or .cse39 .cse36 (or .cse29 .cse12 .cse34 .cse37 .cse33) .cse6 .cse40 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse36 .cse2 .cse19 .cse7) (or .cse29 .cse12 .cse37 .cse3 .cse32 .cse4 .cse14 .cse5 (not (= 1 |old(~p_num_write~0)|)) .cse6 .cse27 .cse7) (or .cse16 .cse29 .cse12 .cse11 .cse37 .cse32 .cse38))))) [2018-11-28 18:56:02,607 INFO L444 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse4 (= 0 ~c_dr_st~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse5 (= ~p_dw_st~0 2)) (.cse6 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse2 .cse3 .cse1 (not .cse6) (not (= ~q_free~0 1)) .cse0 .cse4 .cse7 (not (= 1 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0))) (or (= ~p_dw_st~0 0) .cse0 .cse1 .cse2 .cse3 (= ~p_dw_pc~0 2) (not (= ~q_free~0 0)) .cse7 .cse5 .cse6 (not (= 0 ~c_num_read~0))))) [2018-11-28 18:56:02,607 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-11-28 18:56:02,607 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-11-28 18:56:02,607 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-11-28 18:56:02,607 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-11-28 18:56:02,608 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-11-28 18:56:02,608 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-11-28 18:56:02,608 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 18:56:02,608 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-11-28 18:56:02,608 INFO L448 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-11-28 18:56:02,608 INFO L444 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse0 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse13 (not .cse15)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and .cse0 .cse1 .cse2 (= 1 ~p_num_write~0) .cse3 .cse4) (not (= |old(~q_free~0)| 1)) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse4) (= 1 |old(~c_dr_pc~0)|) (and .cse9 .cse7 .cse8 .cse3 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse7 .cse3 .cse0 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (<= .cse14 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse14) .cse15 .cse3 .cse4)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse13 .cse9 .cse10 .cse7 .cse16 .cse3) (not (= 0 |old(~p_num_write~0)|)) (and .cse13 (not (= ~p_dw_st~0 1)) .cse16 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 18:56:02,609 INFO L444 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse0 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse13 (not .cse15)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and .cse0 .cse1 .cse2 (= 1 ~p_num_write~0) .cse3 .cse4) (not (= |old(~q_free~0)| 1)) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse4) (= 1 |old(~c_dr_pc~0)|) (and .cse9 .cse7 .cse8 .cse3 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse7 .cse3 .cse0 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (<= .cse14 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse14) .cse15 .cse3 .cse4)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse13 .cse9 .cse10 .cse7 .cse16 .cse3) (not (= 0 |old(~p_num_write~0)|)) (and .cse13 (not (= ~p_dw_st~0 1)) .cse16 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 18:56:02,609 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-11-28 18:56:02,609 INFO L448 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-11-28 18:56:02,609 INFO L444 ceAbstractionStarter]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse0 (= ~c_num_read~0 0)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse13 (not .cse15)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (and .cse0 .cse1 .cse2 (= 1 ~p_num_write~0) .cse3 .cse4) (not (= |old(~q_free~0)| 1)) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse4) (= 1 |old(~c_dr_pc~0)|) (and .cse9 .cse7 .cse8 .cse3 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse7 .cse3 .cse0 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (<= .cse14 ~p_num_write~0) .cse2 (<= ~p_num_write~0 .cse14) .cse15 .cse3 .cse4)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse13 .cse9 .cse10 .cse7 .cse16 .cse3) (not (= 0 |old(~p_num_write~0)|)) (and .cse13 (not (= ~p_dw_st~0 1)) .cse16 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse4) (not (= |old(~p_dw_st~0)| 0))))) [2018-11-28 18:56:02,609 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2018-11-28 18:56:02,609 INFO L451 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-11-28 18:56:02,610 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:56:02,610 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (not (= 1 ~c_dr_pc~0)) (= ~q_free~0 0) (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)) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2018-11-28 18:56:02,610 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:56:02,610 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:56:02,610 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-28 18:56:02,610 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-11-28 18:56:02,610 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-11-28 18:56:02,610 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-11-28 18:56:02,610 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-11-28 18:56:02,611 INFO L444 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= ~p_dw_st~0 0)) (.cse4 (= ~p_dw_pc~0 2)) (.cse5 (not (= ~q_free~0 0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse6 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse1 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse8 (= ~p_dw_st~0 2)) (.cse9 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (= 2 ~c_dr_st~0)) .cse7 .cse8 .cse9 .cse10 .cse6) (or .cse6 .cse1 .cse2 .cse3 (= 0 ~c_dr_st~0) .cse8 .cse9))) [2018-11-28 18:56:02,611 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-11-28 18:56:02,611 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-11-28 18:56:02,611 INFO L444 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse18 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse18)) (.cse12 (not (= |old(~q_free~0)| 0))) (.cse13 (<= 2 ~p_dw_st~0)) (.cse15 (< |old(~p_dw_st~0)| 2)) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= 2 ~c_dr_st~0)) (.cse9 (= 1 ~c_dr_pc~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= 0 |old(~c_dr_st~0)|)) (.cse17 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (or .cse1 .cse2 (not .cse3) .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 (and .cse5 .cse6 .cse13 .cse8 .cse9 .cse10 .cse11) (< .cse0 ~p_num_write~0) .cse14 .cse15)) (let ((.cse16 (= ~c_num_read~0 1))) (or .cse1 .cse2 .cse4 (and .cse6 .cse7 .cse8 .cse9 .cse16 .cse11) .cse12 .cse14 (not (= 1 ~p_num_write~0)) (and .cse6 .cse13 .cse8 .cse9 .cse16 .cse11) .cse17 .cse15)) (or .cse3 .cse1 .cse2 (= ~p_dw_pc~0 2) (and .cse6 .cse7 .cse8 .cse9 (= ~c_num_read~0 0) .cse11) .cse14 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse18 .cse17 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-28 18:56:02,611 INFO L448 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-11-28 18:56:02,611 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse7) (or .cse0 .cse1 (not .cse8) .cse4) .cse2 (< .cse7 ~p_num_write~0) .cse3 .cse6)) (or .cse8 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse5 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-28 18:56:02,612 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse11 (= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse13 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (= ~c_num_read~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not .cse20)) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse5 (not .cse16)) (.cse2 (and .cse11 .cse12 .cse20 (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0))) (.cse3 (= 0 ~p_dw_st~0)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse10 (= 0 |old(~c_dr_st~0)|)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse14 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse4 (= ~c_num_read~0 1))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 (and (not (= 1 ~c_dr_pc~0)) .cse6 .cse7 (= ~q_free~0 0) .cse8) .cse9 .cse10 (and .cse11 .cse6 .cse12 .cse4) (not (= 1 ~p_num_write~0)) .cse13 .cse14)) (or .cse15 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse10 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse16 .cse13 (and .cse11 (= ~p_dw_st~0 0) .cse7 .cse12 .cse8) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse17 (+ |old(~c_num_read~0)| 1)) (.cse18 (<= ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse17) (or .cse0 .cse1 (not .cse15) .cse5) (and .cse18 .cse19 .cse2 .cse3) .cse9 (< .cse17 ~p_num_write~0) .cse10 (and .cse18 .cse19 .cse11 .cse6 .cse12) .cse14))))) [2018-11-28 18:56:02,612 INFO L444 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse10 (= ~p_dw_pc~0 1))) (let ((.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (not .cse10)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse9 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (or .cse1 .cse2 (not .cse3) .cse4) .cse5 (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) (<= 2 ~p_dw_st~0) (= 1 ~c_dr_pc~0) (= ~q_free~0 0) (<= ~p_num_write~0 .cse6) (not (= ~c_dr_st~0 0)))) (< .cse0 ~p_num_write~0) .cse7 .cse8)) (or .cse3 .cse1 .cse2 .cse5 .cse7 .cse4 (not (= 1 ~p_num_write~0)) .cse9 .cse8) (or .cse3 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse7 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse10 .cse9 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-28 18:56:02,612 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-11-28 18:56:02,612 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-11-28 18:56:02,613 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse8 (= 1 ~c_dr_pc~0)) (.cse16 (= ~p_dw_pc~0 1))) (let ((.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (not .cse16)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse9 (= ~q_free~0 0)) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse13 (not .cse8)) (.cse14 (= ~c_num_read~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse15 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) (or .cse1 .cse2 (not .cse3) .cse4) .cse5 (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse7 .cse8 .cse9 (<= ~p_num_write~0 .cse6) .cse10)) (< .cse0 ~p_num_write~0) .cse11 .cse12)) (or .cse3 .cse1 .cse2 .cse5 .cse11 .cse4 (not (= 1 ~p_num_write~0)) (and .cse13 .cse7 .cse14 .cse9 .cse10) .cse15 .cse12) (or .cse3 .cse1 .cse2 (and .cse13 (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse14 (= ~c_last_read~0 ~p_last_write~0) .cse10) (= ~p_dw_pc~0 2) .cse11 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse16 .cse15 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-28 18:56:02,613 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-11-28 18:56:02,613 INFO L444 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse7) (or .cse0 .cse1 (not .cse8) .cse4) .cse2 (< .cse7 ~p_num_write~0) .cse3 .cse6)) (or .cse8 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse5 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-28 18:56:02,613 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-11-28 18:56:02,613 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-11-28 18:56:02,613 INFO L444 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse5 (not .cse14)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse7 (= ~q_free~0 1)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse6 (= 1 ~c_dr_pc~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse11 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) (and (not .cse6) .cse7 .cse8 (= ~c_num_read~0 1) .cse9 .cse10) .cse11 .cse12) (let ((.cse13 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse13) (or .cse1 .cse2 (not .cse0) .cse5) .cse3 (< .cse13 ~p_num_write~0) .cse4 (and (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse9 .cse10) .cse12)) (or .cse0 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse4 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse14 .cse11 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-11-28 18:56:02,613 INFO L448 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-11-28 18:56:02,613 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-11-28 18:56:02,614 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-11-28 18:56:02,615 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= 1 ~c_dr_pc~0)) (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= ~q_free~0 0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (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 (= ~c_last_read~0 ~p_last_write~0))) [2018-11-28 18:56:02,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:56:02 BoogieIcfgContainer [2018-11-28 18:56:02,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:56:02,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:56:02,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:56:02,706 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:56:02,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:55:10" (3/4) ... [2018-11-28 18:56:02,710 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:56:02,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-28 18:56:02,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-28 18:56:02,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:56:02,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-28 18:56:02,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-28 18:56:02,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-11-28 18:56:02,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:56:02,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-28 18:56:02,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-28 18:56:02,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-28 18:56:02,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-28 18:56:02,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-28 18:56:02,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-28 18:56:02,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-28 18:56:02,744 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-28 18:56:02,745 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 18:56:02,787 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || ((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0) [2018-11-28 18:56:02,788 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\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)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) [2018-11-28 18:56:02,788 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\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)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) [2018-11-28 18:56:02,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((q_free == 0 && (!(p_dw_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || (((((((q_free == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(c_last_read == \old(p_last_write))) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || \old(p_dw_st) == 2) || ((((((q_free == 1 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) [2018-11-28 18:56:02,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write))) [2018-11-28 18:56:02,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || ((((!(p_dw_st == 0) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((\old(p_dw_st) == 0 || ((!(p_dw_st == 0) && p_num_write == \old(p_num_write) && (!(p_dw_st == 2) && 2 == c_dr_st) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((!(p_dw_st == 0) && !(p_dw_st == 2)) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) [2018-11-28 18:56:02,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st) && c_num_read == 1)) || !(p_dw_pc == 1)) || ((((!(1 == c_dr_pc) && 2 <= p_dw_st) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || (((q_free == 1 && 2 <= p_dw_st) && c_last_read == p_last_write) && c_num_read == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(0 == p_num_write)) || !(\old(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))) || !(p_dw_pc == 1)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write)) || \old(p_dw_st) < 2) [2018-11-28 18:56:02,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((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)) || ((((((p_num_write <= c_num_read && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || ((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || (((((q_free == 1 && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 0) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) [2018-11-28 18:56:02,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((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)) || (((((c_num_read + 1 <= p_num_write && 2 <= p_dw_st) && 1 == c_dr_pc) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && ((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) [2018-11-28 18:56:02,878 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:56:02,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:56:02,883 INFO L168 Benchmark]: Toolchain (without parser) took 53629.08 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 687.9 MB). Free memory was 946.0 MB in the beginning and 1.5 GB in the end (delta: -575.3 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:56:02,884 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:56:02,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.11 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:56:02,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.22 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:56:02,885 INFO L168 Benchmark]: Boogie Preprocessor took 70.77 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:56:02,885 INFO L168 Benchmark]: RCFGBuilder took 901.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:56:02,886 INFO L168 Benchmark]: TraceAbstraction took 51994.02 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 555.7 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -426.9 MB). Peak memory consumption was 774.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:56:02,886 INFO L168 Benchmark]: Witness Printer took 172.70 ms. Allocated memory is still 1.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:56:02,892 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.11 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.22 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.77 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 901.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51994.02 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 555.7 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -426.9 MB). Peak memory consumption was 774.4 MB. Max. memory is 11.5 GB. * Witness Printer took 172.70 ms. Allocated memory is still 1.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\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)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((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)) || (((((c_num_read + 1 <= p_num_write && 2 <= p_dw_st) && 1 == c_dr_pc) && q_free == 0) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && ((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((q_free == 0 && (!(p_dw_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || (((((((q_free == 1 && 2 == c_dr_st) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(c_last_read == \old(p_last_write))) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || (((((!(p_dw_st == 0) && q_free == 0) && !(p_dw_st == 2)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || \old(p_dw_st) == 2) || ((((((q_free == 1 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(p_dw_st == 2)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || ((((((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st) && c_num_read == 1)) || !(p_dw_pc == 1)) || ((((!(1 == c_dr_pc) && 2 <= p_dw_st) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || (((q_free == 1 && 2 <= p_dw_st) && c_last_read == p_last_write) && c_num_read == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || ((((q_free == 1 && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(0 == p_num_write)) || !(\old(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))) || !(p_dw_pc == 1)) || (((c_num_read <= p_num_write && p_num_write <= c_num_read) && (((q_free == 1 && c_last_read == p_last_write) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == p_dw_st)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write)) || \old(p_dw_st) < 2) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((p_dw_st == 0 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) && ((((((((((p_dw_st == 0 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) || 0 == __retres1)) && ((((((0 == __retres1 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_st == 2) || p_dw_pc == 1) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || ((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || \old(c_num_read) + 1 < \old(p_num_write)) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2)) && (((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((!(1 == c_dr_pc) && q_free == 1) && p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((((((((!(p_dw_i == 1) || !(1 == \old(c_dr_pc))) || \old(p_dw_pc) == 2) || ((((((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0))) && (((((((2 == c_dr_st || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\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)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 1)) && ((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || ((((((!(1 == c_dr_pc) && q_free == 1) && c_last_read == p_last_write) && p_dw_st == 0) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < \old(c_num_read)) || !(2 == \old(c_dr_st))) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) || !(2 == \old(c_dr_st))) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \old(c_num_read) + 1 < \old(p_num_write)) || 2 == c_dr_st) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_dw_st == 0) && 2 == c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((c_num_read == 0 && q_free == 0) && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 1) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((\old(p_dw_st) == 0 || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && !(c_dr_st == 0)) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((!(1 == c_dr_pc) && !(p_dw_st == 1)) && 2 == c_dr_st) && p_dw_i == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || ((((q_free == 0 && 2 <= p_dw_st) && 1 == p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((1 == c_dr_pc || 0 == __retres1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_st == 2) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || 0 == __retres1) || !(p_dw_pc == 1)) || !(q_free == 1)) || 1 == c_dr_pc) || 0 == c_dr_st) || !(1 == p_num_write)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && ((((((((((p_dw_st == 0 || 1 == c_dr_pc) || 0 == __retres1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((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)) || ((((((p_num_write <= c_num_read && q_free == 1) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || ((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || \old(c_num_read) + 1 < p_num_write) || 0 == \old(c_dr_st)) || \old(p_dw_st) < 2) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || (((((q_free == 1 && 2 <= p_dw_st) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(0 == \old(c_num_read))) || \old(p_dw_st) < 2)) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || (((((q_free == 1 && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && c_num_read == 0) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || (((!(p_dw_st == 2) && !(p_dw_pc == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_st) == 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || ((((!(p_dw_st == 0) && !(p_dw_st == 2)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((\old(p_dw_st) == 0 || ((!(p_dw_st == 0) && p_num_write == \old(p_num_write) && (!(p_dw_st == 2) && 2 == c_dr_st) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc)) || (((\old(p_num_write) < c_num_read || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || c_num_read < \old(p_num_write))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || 2 == c_dr_st) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((!(p_dw_st == 0) && !(p_dw_st == 2)) && 2 == c_dr_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((!(p_dw_st == 2) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. SAFE Result, 51.8s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 29.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2265 SDtfs, 3569 SDslu, 3229 SDs, 0 SdLazy, 2633 SolverSat, 1141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 373 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2512occurred in iteration=10, 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: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 534 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3323 PreInvPairs, 4585 NumberOfFragments, 10462 HoareAnnotationTreeSize, 3323 FomulaSimplifications, 76087 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 45 FomulaSimplificationsInter, 43384 FormulaSimplificationTreeSizeReductionInter, 25.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1296 ConstructedInterpolants, 0 QuantifiedInterpolants, 239106 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1919 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 279/320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...