./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d321e3b1b642bcfc9c94c4888bd187898cb1af58 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:23:14,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:23:14,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:23:14,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:23:14,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:23:14,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:23:14,599 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:23:14,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:23:14,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:23:14,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:23:14,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:23:14,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:23:14,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:23:14,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:23:14,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:23:14,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:23:14,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:23:14,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:23:14,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:23:14,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:23:14,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:23:14,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:23:14,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:23:14,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:23:14,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:23:14,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:23:14,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:23:14,615 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:23:14,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:23:14,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:23:14,616 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:23:14,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:23:14,617 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:23:14,617 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:23:14,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:23:14,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:23:14,618 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:23:14,625 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:23:14,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:23:14,626 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:23:14,626 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:23:14,626 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:23:14,626 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:23:14,626 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:23:14,626 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:23:14,626 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:23:14,626 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:23:14,626 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:23:14,627 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:23:14,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:23:14,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:23:14,628 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:23:14,628 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:23:14,629 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:23:14,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:23:14,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:23:14,629 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:23:14,629 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d321e3b1b642bcfc9c94c4888bd187898cb1af58 [2018-12-09 12:23:14,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:23:14,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:23:14,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:23:14,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:23:14,655 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:23:14,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-09 12:23:14,691 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/data/a6143341b/23625ac301e44beba5cd5c36d83f7b8f/FLAG7defbe350 [2018-12-09 12:23:15,148 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:23:15,149 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-09 12:23:15,153 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/data/a6143341b/23625ac301e44beba5cd5c36d83f7b8f/FLAG7defbe350 [2018-12-09 12:23:15,162 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/data/a6143341b/23625ac301e44beba5cd5c36d83f7b8f [2018-12-09 12:23:15,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:23:15,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:23:15,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:23:15,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:23:15,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:23:15,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ed00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15, skipping insertion in model container [2018-12-09 12:23:15,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:23:15,188 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:23:15,288 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:23:15,291 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:23:15,312 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:23:15,322 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:23:15,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15 WrapperNode [2018-12-09 12:23:15,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:23:15,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:23:15,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:23:15,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:23:15,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:23:15,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:23:15,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:23:15,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:23:15,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... [2018-12-09 12:23:15,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:23:15,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:23:15,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:23:15,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:23:15,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:23:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-09 12:23:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-09 12:23:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-09 12:23:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-09 12:23:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-12-09 12:23:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-12-09 12:23:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-09 12:23:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-09 12:23:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-09 12:23:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-09 12:23:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:23:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:23:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-12-09 12:23:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-12-09 12:23:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-09 12:23:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-09 12:23:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:23:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:23:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-09 12:23:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-09 12:23:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-09 12:23:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-09 12:23:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-12-09 12:23:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-12-09 12:23:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-09 12:23:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-09 12:23:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-09 12:23:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-09 12:23:15,423 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-09 12:23:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-09 12:23:15,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:23:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:23:15,423 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-12-09 12:23:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-12-09 12:23:15,423 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-12-09 12:23:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-12-09 12:23:15,423 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-09 12:23:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-09 12:23:15,639 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:23:15,639 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 12:23:15,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:23:15 BoogieIcfgContainer [2018-12-09 12:23:15,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:23:15,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:23:15,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:23:15,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:23:15,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:23:15" (1/3) ... [2018-12-09 12:23:15,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b8240d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:23:15, skipping insertion in model container [2018-12-09 12:23:15,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:15" (2/3) ... [2018-12-09 12:23:15,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b8240d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:23:15, skipping insertion in model container [2018-12-09 12:23:15,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:23:15" (3/3) ... [2018-12-09 12:23:15,644 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-12-09 12:23:15,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:23:15,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 12:23:15,664 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 12:23:15,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:23:15,683 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:23:15,683 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:23:15,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:23:15,683 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:23:15,683 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:23:15,683 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:23:15,683 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:23:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-12-09 12:23:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:23:15,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:15,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:15,701 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:15,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash 11439179, now seen corresponding path program 1 times [2018-12-09 12:23:15,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:15,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:15,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:15,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:23:15,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:15,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:23:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:23:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:23:15,872 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 5 states. [2018-12-09 12:23:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:16,186 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-12-09 12:23:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:23:16,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 12:23:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:16,195 INFO L225 Difference]: With dead ends: 379 [2018-12-09 12:23:16,196 INFO L226 Difference]: Without dead ends: 252 [2018-12-09 12:23:16,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:23:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-09 12:23:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2018-12-09 12:23:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-09 12:23:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2018-12-09 12:23:16,245 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2018-12-09 12:23:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:16,245 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2018-12-09 12:23:16,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:23:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2018-12-09 12:23:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:23:16,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:16,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:16,248 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:16,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1438317323, now seen corresponding path program 1 times [2018-12-09 12:23:16,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:16,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:16,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:16,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:16,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:16,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:16,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:23:16,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:16,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:23:16,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:23:16,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:23:16,313 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2018-12-09 12:23:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:16,742 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2018-12-09 12:23:16,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:23:16,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:23:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:16,745 INFO L225 Difference]: With dead ends: 628 [2018-12-09 12:23:16,745 INFO L226 Difference]: Without dead ends: 422 [2018-12-09 12:23:16,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:23:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-12-09 12:23:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2018-12-09 12:23:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-09 12:23:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-12-09 12:23:16,772 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2018-12-09 12:23:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:16,773 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-12-09 12:23:16,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:23:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-12-09 12:23:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:23:16,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:16,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:16,775 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:16,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1469864563, now seen corresponding path program 1 times [2018-12-09 12:23:16,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:16,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:16,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:16,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:16,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:16,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:16,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:23:16,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:16,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:23:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:23:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:23:16,810 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2018-12-09 12:23:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:16,847 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2018-12-09 12:23:16,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:23:16,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:23:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:16,849 INFO L225 Difference]: With dead ends: 685 [2018-12-09 12:23:16,849 INFO L226 Difference]: Without dead ends: 369 [2018-12-09 12:23:16,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:23:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-09 12:23:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2018-12-09 12:23:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-09 12:23:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2018-12-09 12:23:16,866 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2018-12-09 12:23:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:16,866 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2018-12-09 12:23:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:23:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2018-12-09 12:23:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:23:16,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:16,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:16,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:16,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1221718069, now seen corresponding path program 1 times [2018-12-09 12:23:16,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:16,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:16,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:16,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:16,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:23:16,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:16,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:23:16,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:23:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:23:16,916 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2018-12-09 12:23:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:17,026 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2018-12-09 12:23:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:23:17,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 12:23:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:17,029 INFO L225 Difference]: With dead ends: 991 [2018-12-09 12:23:17,029 INFO L226 Difference]: Without dead ends: 670 [2018-12-09 12:23:17,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:23:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-09 12:23:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-12-09 12:23:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-12-09 12:23:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2018-12-09 12:23:17,061 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2018-12-09 12:23:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:17,062 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2018-12-09 12:23:17,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:23:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2018-12-09 12:23:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:23:17,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:17,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:17,063 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:17,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2116320844, now seen corresponding path program 1 times [2018-12-09 12:23:17,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:17,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:17,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:17,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:17,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:23:17,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:17,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:23:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:23:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:23:17,128 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2018-12-09 12:23:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:17,178 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2018-12-09 12:23:17,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:23:17,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:23:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:17,180 INFO L225 Difference]: With dead ends: 1280 [2018-12-09 12:23:17,180 INFO L226 Difference]: Without dead ends: 672 [2018-12-09 12:23:17,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:23:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-12-09 12:23:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2018-12-09 12:23:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-12-09 12:23:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2018-12-09 12:23:17,202 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2018-12-09 12:23:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:17,202 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2018-12-09 12:23:17,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:23:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2018-12-09 12:23:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:23:17,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:17,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:17,203 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:17,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934286, now seen corresponding path program 1 times [2018-12-09 12:23:17,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:17,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:17,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:17,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:17,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:23:17,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:17,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:23:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:23:17,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:23:17,250 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2018-12-09 12:23:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:17,683 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2018-12-09 12:23:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:23:17,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 12:23:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:17,686 INFO L225 Difference]: With dead ends: 1359 [2018-12-09 12:23:17,686 INFO L226 Difference]: Without dead ends: 831 [2018-12-09 12:23:17,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:23:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-09 12:23:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2018-12-09 12:23:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-12-09 12:23:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2018-12-09 12:23:17,709 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2018-12-09 12:23:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:17,709 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2018-12-09 12:23:17,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:23:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2018-12-09 12:23:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:23:17,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:17,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:17,710 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:17,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1534461196, now seen corresponding path program 1 times [2018-12-09 12:23:17,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:17,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:17,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:17,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:17,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:23:17,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:17,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:23:17,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:23:17,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:23:17,733 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2018-12-09 12:23:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:17,780 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2018-12-09 12:23:17,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:23:17,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-09 12:23:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:17,784 INFO L225 Difference]: With dead ends: 1887 [2018-12-09 12:23:17,784 INFO L226 Difference]: Without dead ends: 1276 [2018-12-09 12:23:17,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:23:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-12-09 12:23:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2018-12-09 12:23:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-09 12:23:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2018-12-09 12:23:17,824 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2018-12-09 12:23:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:17,824 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2018-12-09 12:23:17,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:23:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2018-12-09 12:23:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 12:23:17,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:17,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:17,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:17,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash -578263435, now seen corresponding path program 1 times [2018-12-09 12:23:17,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:17,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:17,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:17,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:23:17,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:17,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:23:17,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:23:17,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:23:17,887 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2018-12-09 12:23:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:18,018 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2018-12-09 12:23:18,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:23:18,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-09 12:23:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:18,024 INFO L225 Difference]: With dead ends: 3564 [2018-12-09 12:23:18,024 INFO L226 Difference]: Without dead ends: 2309 [2018-12-09 12:23:18,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:23:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-12-09 12:23:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2018-12-09 12:23:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-12-09 12:23:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2018-12-09 12:23:18,108 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2018-12-09 12:23:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:18,108 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2018-12-09 12:23:18,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:23:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2018-12-09 12:23:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 12:23:18,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:18,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:18,110 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:18,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1713093210, now seen corresponding path program 1 times [2018-12-09 12:23:18,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:18,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:18,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:18,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:18,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:23:18,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:18,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:23:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:23:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:23:18,143 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2018-12-09 12:23:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:18,666 INFO L93 Difference]: Finished difference Result 6956 states and 9741 transitions. [2018-12-09 12:23:18,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:23:18,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-12-09 12:23:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:18,683 INFO L225 Difference]: With dead ends: 6956 [2018-12-09 12:23:18,683 INFO L226 Difference]: Without dead ends: 4830 [2018-12-09 12:23:18,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:23:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-12-09 12:23:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2018-12-09 12:23:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2018-12-09 12:23:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2018-12-09 12:23:18,875 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2018-12-09 12:23:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:18,876 INFO L480 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2018-12-09 12:23:18,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:23:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2018-12-09 12:23:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 12:23:18,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:18,877 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:18,878 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:18,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1838635891, now seen corresponding path program 1 times [2018-12-09 12:23:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:18,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:18,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 12:23:18,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:18,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:23:18,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:18,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:23:18,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:23:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:23:18,906 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2018-12-09 12:23:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:19,123 INFO L93 Difference]: Finished difference Result 9202 states and 12339 transitions. [2018-12-09 12:23:19,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:23:19,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-09 12:23:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:19,137 INFO L225 Difference]: With dead ends: 9202 [2018-12-09 12:23:19,137 INFO L226 Difference]: Without dead ends: 4574 [2018-12-09 12:23:19,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:23:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2018-12-09 12:23:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2018-12-09 12:23:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2018-12-09 12:23:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6130 transitions. [2018-12-09 12:23:19,298 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6130 transitions. Word has length 88 [2018-12-09 12:23:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:19,298 INFO L480 AbstractCegarLoop]: Abstraction has 4574 states and 6130 transitions. [2018-12-09 12:23:19,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:23:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6130 transitions. [2018-12-09 12:23:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 12:23:19,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:19,299 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:19,299 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:19,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1488980751, now seen corresponding path program 1 times [2018-12-09 12:23:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:19,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:19,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:19,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:19,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:19,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:19,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:23:19,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:19,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:23:19,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:23:19,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:23:19,329 INFO L87 Difference]: Start difference. First operand 4574 states and 6130 transitions. Second operand 4 states. [2018-12-09 12:23:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:19,641 INFO L93 Difference]: Finished difference Result 6044 states and 8116 transitions. [2018-12-09 12:23:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:23:19,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-09 12:23:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:19,656 INFO L225 Difference]: With dead ends: 6044 [2018-12-09 12:23:19,656 INFO L226 Difference]: Without dead ends: 6041 [2018-12-09 12:23:19,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:23:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2018-12-09 12:23:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5872. [2018-12-09 12:23:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2018-12-09 12:23:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2018-12-09 12:23:19,850 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 88 [2018-12-09 12:23:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:19,851 INFO L480 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2018-12-09 12:23:19,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:23:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2018-12-09 12:23:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 12:23:19,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:19,852 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:19,852 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:19,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1085920016, now seen corresponding path program 1 times [2018-12-09 12:23:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:19,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:19,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:23:19,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:19,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:19,921 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-12-09 12:23:19,923 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [125], [134], [137], [140], [146], [149], [159], [162], [174], [184], [186], [188], [189], [190], [204], [206], [229], [235], [237], [243], [245], [249], [259], [261], [263], [264], [265], [268], [284], [292], [294], [297], [302], [313], [314], [315], [316], [317], [318], [319], [320], [321], [325], [326], [327], [328], [329], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [355], [356], [357], [359] [2018-12-09 12:23:19,952 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:19,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:20,097 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 12:23:20,098 INFO L272 AbstractInterpreter]: Visited 86 different actions 89 times. Merged at 2 different actions 2 times. Never widened. Performed 700 root evaluator evaluations with a maximum evaluation depth of 3. Performed 700 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2018-12-09 12:23:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:20,103 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 12:23:20,210 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 78.88% of their original sizes. [2018-12-09 12:23:20,210 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 12:23:20,483 INFO L418 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2018-12-09 12:23:20,483 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 12:23:20,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 12:23:20,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2018-12-09 12:23:20,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:20,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 12:23:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 12:23:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-12-09 12:23:20,484 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 30 states. [2018-12-09 12:23:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:26,970 INFO L93 Difference]: Finished difference Result 17394 states and 23832 transitions. [2018-12-09 12:23:26,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 12:23:26,970 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-12-09 12:23:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:27,007 INFO L225 Difference]: With dead ends: 17394 [2018-12-09 12:23:27,008 INFO L226 Difference]: Without dead ends: 11541 [2018-12-09 12:23:27,019 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=434, Invalid=2016, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 12:23:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11541 states. [2018-12-09 12:23:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11541 to 10667. [2018-12-09 12:23:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2018-12-09 12:23:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 14383 transitions. [2018-12-09 12:23:27,445 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 14383 transitions. Word has length 89 [2018-12-09 12:23:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:27,445 INFO L480 AbstractCegarLoop]: Abstraction has 10667 states and 14383 transitions. [2018-12-09 12:23:27,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 12:23:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 14383 transitions. [2018-12-09 12:23:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 12:23:27,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:27,446 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:27,446 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:27,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash -131765010, now seen corresponding path program 1 times [2018-12-09 12:23:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:27,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:27,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 12:23:27,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:27,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:23:27,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:27,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:23:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:23:27,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:23:27,484 INFO L87 Difference]: Start difference. First operand 10667 states and 14383 transitions. Second operand 7 states. [2018-12-09 12:23:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:28,875 INFO L93 Difference]: Finished difference Result 33769 states and 50119 transitions. [2018-12-09 12:23:28,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 12:23:28,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 12:23:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:28,932 INFO L225 Difference]: With dead ends: 33769 [2018-12-09 12:23:28,932 INFO L226 Difference]: Without dead ends: 21075 [2018-12-09 12:23:28,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-12-09 12:23:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2018-12-09 12:23:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 19665. [2018-12-09 12:23:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19665 states. [2018-12-09 12:23:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 25847 transitions. [2018-12-09 12:23:29,752 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 25847 transitions. Word has length 100 [2018-12-09 12:23:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:29,753 INFO L480 AbstractCegarLoop]: Abstraction has 19665 states and 25847 transitions. [2018-12-09 12:23:29,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:23:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 25847 transitions. [2018-12-09 12:23:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 12:23:29,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:29,754 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:29,754 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:29,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash 193904721, now seen corresponding path program 1 times [2018-12-09 12:23:29,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:29,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:29,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 12:23:29,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:29,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:29,800 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-12-09 12:23:29,800 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [81], [84], [95], [99], [102], [104], [108], [109], [112], [113], [125], [134], [137], [140], [146], [149], [159], [162], [165], [174], [184], [186], [188], [189], [190], [204], [206], [229], [235], [237], [243], [245], [249], [259], [261], [263], [264], [265], [268], [284], [292], [294], [297], [302], [313], [314], [315], [316], [317], [318], [319], [320], [321], [325], [326], [327], [328], [329], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [355], [356], [357], [359] [2018-12-09 12:23:29,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:29,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:29,845 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 12:23:29,845 INFO L272 AbstractInterpreter]: Visited 88 different actions 98 times. Merged at 4 different actions 4 times. Never widened. Performed 848 root evaluator evaluations with a maximum evaluation depth of 3. Performed 848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 40 variables. [2018-12-09 12:23:29,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:29,849 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 12:23:29,925 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 79.69% of their original sizes. [2018-12-09 12:23:29,925 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 12:23:30,229 INFO L418 sIntCurrentIteration]: We unified 109 AI predicates to 109 [2018-12-09 12:23:30,229 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 12:23:30,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 12:23:30,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [8] total 45 [2018-12-09 12:23:30,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-09 12:23:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-09 12:23:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 12:23:30,230 INFO L87 Difference]: Start difference. First operand 19665 states and 25847 transitions. Second operand 39 states. [2018-12-09 12:23:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:34,141 INFO L93 Difference]: Finished difference Result 34683 states and 45484 transitions. [2018-12-09 12:23:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 12:23:34,141 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2018-12-09 12:23:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:34,194 INFO L225 Difference]: With dead ends: 34683 [2018-12-09 12:23:34,194 INFO L226 Difference]: Without dead ends: 15167 [2018-12-09 12:23:34,228 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=622, Invalid=2918, Unknown=0, NotChecked=0, Total=3540 [2018-12-09 12:23:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15167 states. [2018-12-09 12:23:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15167 to 11151. [2018-12-09 12:23:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11151 states. [2018-12-09 12:23:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11151 states to 11151 states and 14463 transitions. [2018-12-09 12:23:34,755 INFO L78 Accepts]: Start accepts. Automaton has 11151 states and 14463 transitions. Word has length 110 [2018-12-09 12:23:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:34,755 INFO L480 AbstractCegarLoop]: Abstraction has 11151 states and 14463 transitions. [2018-12-09 12:23:34,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-09 12:23:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 11151 states and 14463 transitions. [2018-12-09 12:23:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-09 12:23:34,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:34,764 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:34,764 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:34,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -185069534, now seen corresponding path program 1 times [2018-12-09 12:23:34,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:34,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:34,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 12:23:34,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:34,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:34,843 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-12-09 12:23:34,843 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [30], [31], [36], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [159], [162], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-09 12:23:34,846 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:34,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:34,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:23:34,954 INFO L272 AbstractInterpreter]: Visited 104 different actions 261 times. Merged at 23 different actions 66 times. Never widened. Performed 2878 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 9 different actions. Largest state had 40 variables. [2018-12-09 12:23:34,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:34,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:23:34,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:34,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:23:34,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:34,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:23:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:35,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:23:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 12:23:35,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:23:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 12:23:35,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:23:35,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 10 [2018-12-09 12:23:35,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:35,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:23:35,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:23:35,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:23:35,220 INFO L87 Difference]: Start difference. First operand 11151 states and 14463 transitions. Second operand 3 states. [2018-12-09 12:23:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:35,552 INFO L93 Difference]: Finished difference Result 20011 states and 26260 transitions. [2018-12-09 12:23:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:23:35,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-12-09 12:23:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:35,570 INFO L225 Difference]: With dead ends: 20011 [2018-12-09 12:23:35,570 INFO L226 Difference]: Without dead ends: 9694 [2018-12-09 12:23:35,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:23:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2018-12-09 12:23:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 9691. [2018-12-09 12:23:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9691 states. [2018-12-09 12:23:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9691 states to 9691 states and 11686 transitions. [2018-12-09 12:23:35,909 INFO L78 Accepts]: Start accepts. Automaton has 9691 states and 11686 transitions. Word has length 188 [2018-12-09 12:23:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:35,909 INFO L480 AbstractCegarLoop]: Abstraction has 9691 states and 11686 transitions. [2018-12-09 12:23:35,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:23:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9691 states and 11686 transitions. [2018-12-09 12:23:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-09 12:23:35,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:35,913 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:35,914 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:35,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash 745588165, now seen corresponding path program 1 times [2018-12-09 12:23:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:35,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 12:23:35,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:35,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:35,992 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-09 12:23:35,992 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [36], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [159], [162], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [252], [255], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-09 12:23:35,994 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:35,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:36,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:23:36,613 INFO L272 AbstractInterpreter]: Visited 139 different actions 1838 times. Merged at 63 different actions 598 times. Widened at 1 different actions 1 times. Performed 18344 root evaluator evaluations with a maximum evaluation depth of 3. Performed 18344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 156 fixpoints after 16 different actions. Largest state had 40 variables. [2018-12-09 12:23:36,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:36,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:23:36,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:36,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:23:36,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:36,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:23:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:36,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:23:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 12:23:36,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:23:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-09 12:23:36,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 12:23:36,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-09 12:23:36,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 12:23:36,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:23:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:23:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:23:36,941 INFO L87 Difference]: Start difference. First operand 9691 states and 11686 transitions. Second operand 11 states. [2018-12-09 12:23:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:38,102 INFO L93 Difference]: Finished difference Result 28937 states and 36125 transitions. [2018-12-09 12:23:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 12:23:38,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-12-09 12:23:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:38,137 INFO L225 Difference]: With dead ends: 28937 [2018-12-09 12:23:38,137 INFO L226 Difference]: Without dead ends: 18240 [2018-12-09 12:23:38,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 384 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-12-09 12:23:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18240 states. [2018-12-09 12:23:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18240 to 17124. [2018-12-09 12:23:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17124 states. [2018-12-09 12:23:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 20263 transitions. [2018-12-09 12:23:38,808 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 20263 transitions. Word has length 189 [2018-12-09 12:23:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:38,808 INFO L480 AbstractCegarLoop]: Abstraction has 17124 states and 20263 transitions. [2018-12-09 12:23:38,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:23:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 20263 transitions. [2018-12-09 12:23:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 12:23:38,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:38,812 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:38,813 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:38,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:38,813 INFO L82 PathProgramCache]: Analyzing trace with hash 480424814, now seen corresponding path program 1 times [2018-12-09 12:23:38,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:38,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:38,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:38,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:38,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 12:23:38,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:38,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:38,899 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-12-09 12:23:38,899 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [34], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [159], [162], [168], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [252], [255], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [294], [297], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-09 12:23:38,901 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:38,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:39,125 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:23:39,125 INFO L272 AbstractInterpreter]: Visited 135 different actions 842 times. Merged at 37 different actions 157 times. Never widened. Performed 9177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 9177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 52 fixpoints after 8 different actions. Largest state had 40 variables. [2018-12-09 12:23:39,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:39,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:23:39,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:39,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:23:39,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:39,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:23:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:39,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:23:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 12:23:39,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:23:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 12:23:39,334 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 12:23:39,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [9] total 11 [2018-12-09 12:23:39,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:39,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:23:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:23:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:23:39,335 INFO L87 Difference]: Start difference. First operand 17124 states and 20263 transitions. Second operand 3 states. [2018-12-09 12:23:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:39,980 INFO L93 Difference]: Finished difference Result 32734 states and 39004 transitions. [2018-12-09 12:23:39,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:23:39,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-12-09 12:23:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:40,011 INFO L225 Difference]: With dead ends: 32734 [2018-12-09 12:23:40,011 INFO L226 Difference]: Without dead ends: 16835 [2018-12-09 12:23:40,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 388 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:23:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16835 states. [2018-12-09 12:23:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16835 to 16702. [2018-12-09 12:23:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16702 states. [2018-12-09 12:23:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16702 states to 16702 states and 19684 transitions. [2018-12-09 12:23:40,605 INFO L78 Accepts]: Start accepts. Automaton has 16702 states and 19684 transitions. Word has length 196 [2018-12-09 12:23:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:40,606 INFO L480 AbstractCegarLoop]: Abstraction has 16702 states and 19684 transitions. [2018-12-09 12:23:40,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:23:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 16702 states and 19684 transitions. [2018-12-09 12:23:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-09 12:23:40,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:40,607 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:40,608 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:40,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1558206204, now seen corresponding path program 1 times [2018-12-09 12:23:40,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:40,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:40,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:40,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:40,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 12:23:40,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:40,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:23:40,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:40,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:23:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:23:40,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:23:40,657 INFO L87 Difference]: Start difference. First operand 16702 states and 19684 transitions. Second operand 4 states. [2018-12-09 12:23:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:41,140 INFO L93 Difference]: Finished difference Result 25087 states and 29825 transitions. [2018-12-09 12:23:41,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:23:41,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-09 12:23:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:41,156 INFO L225 Difference]: With dead ends: 25087 [2018-12-09 12:23:41,156 INFO L226 Difference]: Without dead ends: 9300 [2018-12-09 12:23:41,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:23:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9300 states. [2018-12-09 12:23:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9300 to 9234. [2018-12-09 12:23:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2018-12-09 12:23:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 10544 transitions. [2018-12-09 12:23:41,492 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 10544 transitions. Word has length 197 [2018-12-09 12:23:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:41,492 INFO L480 AbstractCegarLoop]: Abstraction has 9234 states and 10544 transitions. [2018-12-09 12:23:41,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:23:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 10544 transitions. [2018-12-09 12:23:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-09 12:23:41,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:41,494 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:41,494 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:41,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 918395428, now seen corresponding path program 1 times [2018-12-09 12:23:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:41,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-09 12:23:41,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:41,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:41,614 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-12-09 12:23:41,614 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [155], [159], [162], [168], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [229], [233], [235], [237], [240], [243], [245], [249], [252], [257], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [294], [297], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-09 12:23:41,615 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:41,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:41,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:23:41,943 INFO L272 AbstractInterpreter]: Visited 137 different actions 1069 times. Merged at 55 different actions 285 times. Never widened. Performed 11206 root evaluator evaluations with a maximum evaluation depth of 3. Performed 11206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 92 fixpoints after 17 different actions. Largest state had 40 variables. [2018-12-09 12:23:41,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:41,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:23:41,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:41,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:23:41,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:41,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:23:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:42,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:23:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 66 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 12:23:42,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:23:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-09 12:23:42,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 12:23:42,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2018-12-09 12:23:42,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 12:23:42,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 12:23:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 12:23:42,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-12-09 12:23:42,274 INFO L87 Difference]: Start difference. First operand 9234 states and 10544 transitions. Second operand 13 states. [2018-12-09 12:23:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:43,920 INFO L93 Difference]: Finished difference Result 18498 states and 21470 transitions. [2018-12-09 12:23:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 12:23:43,921 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 198 [2018-12-09 12:23:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:43,948 INFO L225 Difference]: With dead ends: 18498 [2018-12-09 12:23:43,948 INFO L226 Difference]: Without dead ends: 18495 [2018-12-09 12:23:43,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 386 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-12-09 12:23:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18495 states. [2018-12-09 12:23:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18495 to 17979. [2018-12-09 12:23:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17979 states. [2018-12-09 12:23:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17979 states to 17979 states and 20794 transitions. [2018-12-09 12:23:44,668 INFO L78 Accepts]: Start accepts. Automaton has 17979 states and 20794 transitions. Word has length 198 [2018-12-09 12:23:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:44,668 INFO L480 AbstractCegarLoop]: Abstraction has 17979 states and 20794 transitions. [2018-12-09 12:23:44,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 12:23:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 17979 states and 20794 transitions. [2018-12-09 12:23:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 12:23:44,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:44,671 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:44,671 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:44,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1414839607, now seen corresponding path program 2 times [2018-12-09 12:23:44,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:44,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:44,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-09 12:23:44,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:23:44,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:23:44,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:44,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:23:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:23:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:23:44,716 INFO L87 Difference]: Start difference. First operand 17979 states and 20794 transitions. Second operand 3 states. [2018-12-09 12:23:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:45,397 INFO L93 Difference]: Finished difference Result 30606 states and 35586 transitions. [2018-12-09 12:23:45,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:23:45,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-12-09 12:23:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:45,424 INFO L225 Difference]: With dead ends: 30606 [2018-12-09 12:23:45,424 INFO L226 Difference]: Without dead ends: 17570 [2018-12-09 12:23:45,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:23:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17570 states. [2018-12-09 12:23:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17570 to 17253. [2018-12-09 12:23:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17253 states. [2018-12-09 12:23:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17253 states to 17253 states and 19687 transitions. [2018-12-09 12:23:46,127 INFO L78 Accepts]: Start accepts. Automaton has 17253 states and 19687 transitions. Word has length 201 [2018-12-09 12:23:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:46,127 INFO L480 AbstractCegarLoop]: Abstraction has 17253 states and 19687 transitions. [2018-12-09 12:23:46,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:23:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17253 states and 19687 transitions. [2018-12-09 12:23:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-09 12:23:46,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:46,133 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 12:23:46,133 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:46,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash -138167773, now seen corresponding path program 1 times [2018-12-09 12:23:46,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:46,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:46,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:23:46,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:46,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-12-09 12:23:46,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:46,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:46,207 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-12-09 12:23:46,208 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [155], [159], [162], [165], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [229], [233], [235], [237], [240], [243], [245], [249], [252], [257], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-09 12:23:46,208 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:46,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:46,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:23:46,580 INFO L272 AbstractInterpreter]: Visited 138 different actions 1231 times. Merged at 57 different actions 389 times. Widened at 1 different actions 1 times. Performed 11227 root evaluator evaluations with a maximum evaluation depth of 3. Performed 11227 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 134 fixpoints after 21 different actions. Largest state had 40 variables. [2018-12-09 12:23:46,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:46,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:23:46,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:46,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:23:46,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:46,587 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:23:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:46,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:23:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-09 12:23:46,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:23:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 12:23:46,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:23:46,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2018-12-09 12:23:46,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:46,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:23:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:23:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:23:46,821 INFO L87 Difference]: Start difference. First operand 17253 states and 19687 transitions. Second operand 6 states. [2018-12-09 12:23:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:47,301 INFO L93 Difference]: Finished difference Result 27933 states and 32481 transitions. [2018-12-09 12:23:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:23:47,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2018-12-09 12:23:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:47,322 INFO L225 Difference]: With dead ends: 27933 [2018-12-09 12:23:47,322 INFO L226 Difference]: Without dead ends: 10782 [2018-12-09 12:23:47,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 544 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:23:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10782 states. [2018-12-09 12:23:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10782 to 8449. [2018-12-09 12:23:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8449 states. [2018-12-09 12:23:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8449 states to 8449 states and 9643 transitions. [2018-12-09 12:23:47,728 INFO L78 Accepts]: Start accepts. Automaton has 8449 states and 9643 transitions. Word has length 275 [2018-12-09 12:23:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:47,728 INFO L480 AbstractCegarLoop]: Abstraction has 8449 states and 9643 transitions. [2018-12-09 12:23:47,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:23:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8449 states and 9643 transitions. [2018-12-09 12:23:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-09 12:23:47,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:47,731 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:47,731 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:47,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 823377233, now seen corresponding path program 1 times [2018-12-09 12:23:47,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:47,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:47,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:47,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:47,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-12-09 12:23:47,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:47,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:47,786 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2018-12-09 12:23:47,786 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [34], [36], [40], [42], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [81], [84], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [159], [162], [168], [173], [174], [177], [180], [182], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [227], [229], [233], [235], [237], [240], [243], [245], [249], [252], [255], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [292], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-09 12:23:47,787 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:47,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:48,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:23:48,547 INFO L272 AbstractInterpreter]: Visited 144 different actions 2732 times. Merged at 78 different actions 966 times. Widened at 1 different actions 4 times. Performed 25688 root evaluator evaluations with a maximum evaluation depth of 3. Performed 25688 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 273 fixpoints after 24 different actions. Largest state had 40 variables. [2018-12-09 12:23:48,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:48,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:23:48,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:48,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:23:48,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:48,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:23:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:48,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:23:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 12:23:48,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:23:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 75 proven. 7 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-12-09 12:23:48,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 12:23:48,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 12:23:48,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 12:23:48,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:23:48,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:23:48,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:23:48,832 INFO L87 Difference]: Start difference. First operand 8449 states and 9643 transitions. Second operand 8 states. [2018-12-09 12:23:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:49,422 INFO L93 Difference]: Finished difference Result 13290 states and 15318 transitions. [2018-12-09 12:23:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:23:49,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2018-12-09 12:23:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:49,430 INFO L225 Difference]: With dead ends: 13290 [2018-12-09 12:23:49,430 INFO L226 Difference]: Without dead ends: 5355 [2018-12-09 12:23:49,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 581 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:23:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2018-12-09 12:23:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 5197. [2018-12-09 12:23:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5197 states. [2018-12-09 12:23:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 5921 transitions. [2018-12-09 12:23:49,681 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 5921 transitions. Word has length 293 [2018-12-09 12:23:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:49,681 INFO L480 AbstractCegarLoop]: Abstraction has 5197 states and 5921 transitions. [2018-12-09 12:23:49,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:23:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 5921 transitions. [2018-12-09 12:23:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-09 12:23:49,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:23:49,683 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:23:49,683 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:23:49,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:49,684 INFO L82 PathProgramCache]: Analyzing trace with hash 585639202, now seen corresponding path program 1 times [2018-12-09 12:23:49,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:23:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:49,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:23:49,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:23:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-09 12:23:49,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:49,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:23:49,751 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-12-09 12:23:49,751 INFO L205 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [112], [113], [114], [116], [119], [123], [124], [125], [134], [137], [140], [142], [146], [149], [152], [155], [159], [162], [168], [173], [174], [177], [180], [184], [186], [188], [189], [190], [204], [206], [208], [210], [215], [220], [229], [233], [235], [237], [240], [243], [245], [249], [252], [257], [259], [261], [263], [264], [265], [268], [270], [273], [284], [288], [290], [294], [297], [300], [302], [312], [313], [314], [315], [316], [317], [318], [319], [320], [321], [323], [324], [325], [326], [327], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [359] [2018-12-09 12:23:49,752 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:23:49,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:23:50,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:23:50,213 INFO L272 AbstractInterpreter]: Visited 138 different actions 1786 times. Merged at 64 different actions 589 times. Widened at 1 different actions 1 times. Performed 18687 root evaluator evaluations with a maximum evaluation depth of 3. Performed 18687 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 172 fixpoints after 21 different actions. Largest state had 40 variables. [2018-12-09 12:23:50,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:23:50,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:23:50,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:23:50,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:23:50,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:23:50,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:23:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:23:50,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:23:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-12-09 12:23:50,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:23:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-09 12:23:50,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:23:50,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2018-12-09 12:23:50,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:23:50,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:23:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:23:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:23:50,443 INFO L87 Difference]: Start difference. First operand 5197 states and 5921 transitions. Second operand 5 states. [2018-12-09 12:23:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:23:50,698 INFO L93 Difference]: Finished difference Result 6061 states and 6874 transitions. [2018-12-09 12:23:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:23:50,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2018-12-09 12:23:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:23:50,699 INFO L225 Difference]: With dead ends: 6061 [2018-12-09 12:23:50,699 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 12:23:50,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 585 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:23:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 12:23:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 12:23:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 12:23:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 12:23:50,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2018-12-09 12:23:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:23:50,705 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:23:50,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:23:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 12:23:50,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 12:23:50,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 12:23:50,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:50,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:50,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:50,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:50,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:50,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:50,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:50,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,011 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 182 [2018-12-09 12:23:51,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:51,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,495 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 185 [2018-12-09 12:23:52,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:52,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:53,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,904 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 200 [2018-12-09 12:23:54,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:54,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,656 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 200 [2018-12-09 12:23:55,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:55,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 12:23:56,327 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 82 [2018-12-09 12:23:57,131 WARN L180 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 109 [2018-12-09 12:23:57,786 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 101 [2018-12-09 12:23:59,849 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 355 DAG size of output: 169 [2018-12-09 12:24:02,113 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 340 DAG size of output: 108 [2018-12-09 12:24:02,416 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-12-09 12:24:03,543 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 305 DAG size of output: 125 [2018-12-09 12:24:06,524 WARN L180 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 383 DAG size of output: 101 [2018-12-09 12:24:06,881 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2018-12-09 12:24:07,618 WARN L180 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 111 [2018-12-09 12:24:07,917 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-12-09 12:24:08,514 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-12-09 12:24:09,780 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 322 DAG size of output: 99 [2018-12-09 12:24:10,705 WARN L180 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 91 [2018-12-09 12:24:10,917 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 1 [2018-12-09 12:24:11,542 WARN L180 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 107 [2018-12-09 12:24:11,803 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 63 [2018-12-09 12:24:13,605 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 238 DAG size of output: 107 [2018-12-09 12:24:15,653 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 213 DAG size of output: 100 [2018-12-09 12:24:17,582 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 209 DAG size of output: 98 [2018-12-09 12:24:17,852 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2018-12-09 12:24:18,101 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-09 12:24:19,210 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 322 DAG size of output: 99 [2018-12-09 12:24:21,373 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 322 DAG size of output: 154 [2018-12-09 12:24:21,930 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 100 [2018-12-09 12:24:22,788 WARN L180 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 89 [2018-12-09 12:24:25,279 WARN L180 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 364 DAG size of output: 110 [2018-12-09 12:24:29,346 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 355 DAG size of output: 169 [2018-12-09 12:24:29,797 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 357 DAG size of output: 1 [2018-12-09 12:24:31,156 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 246 DAG size of output: 117 [2018-12-09 12:24:32,194 WARN L180 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 1 [2018-12-09 12:24:36,805 WARN L180 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 367 DAG size of output: 158 [2018-12-09 12:24:38,761 WARN L180 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 255 DAG size of output: 91 [2018-12-09 12:24:39,116 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2018-12-09 12:24:41,557 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 353 DAG size of output: 92 [2018-12-09 12:24:41,861 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 91 [2018-12-09 12:24:42,756 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 117 [2018-12-09 12:24:46,479 WARN L180 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 304 DAG size of output: 132 [2018-12-09 12:24:47,201 WARN L180 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 99 [2018-12-09 12:24:47,536 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 93 [2018-12-09 12:24:48,433 WARN L180 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 99 [2018-12-09 12:24:48,571 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2018-12-09 12:24:48,901 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 94 [2018-12-09 12:24:49,014 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 78 [2018-12-09 12:24:49,017 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-12-09 12:24:49,017 INFO L448 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-12-09 12:24:49,017 INFO L448 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-12-09 12:24:49,017 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-12-09 12:24:49,018 INFO L444 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse11 (= 2 ~c_dr_st~0)) (.cse23 (not (= 0 ~c_dr_st~0))) (.cse25 (<= 2 ~p_dw_st~0)) (.cse16 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse15 (= ~p_dw_st~0 0)) (.cse17 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (not .cse12)) (.cse20 (not (= .cse16 ~p_num_write~0))) (.cse22 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (and .cse23 .cse25)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< ~q_free~0 1)) (.cse13 (< 1 ~q_free~0)) (.cse21 (and .cse25 .cse11)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not .cse18)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (= 0 ~q_req_up~0))) (.cse8 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse12 .cse13 .cse8 .cse14) (or .cse2 (and .cse15 (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse16 ~q_free~0) .cse14 (not .cse4) (< ~q_free~0 .cse16) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse17 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse18 .cse1 .cse2 .cse15 .cse4 .cse17) (or .cse1 .cse2 .cse3 .cse5 .cse19 .cse20 .cse21 .cse0 .cse22 .cse10 .cse8) (or .cse2 .cse1 .cse3 .cse5 .cse19 .cse20 (= 0 ~q_write_ev~0) .cse22 .cse10 .cse21 .cse6 .cse8) (or .cse18 .cse1 .cse2 .cse4 .cse23) (or .cse2 .cse1 .cse3 .cse5 .cse21 .cse0 .cse9 .cse10 .cse24 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse12 .cse6 .cse8) (or (or .cse0 .cse24 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse13 .cse6) .cse8) .cse21) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)))) [2018-12-09 12:24:49,018 INFO L444 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse11 (= 2 ~c_dr_st~0)) (.cse15 (= activate_threads_~tmp~1 0)) (.cse19 (+ ~c_num_read~0 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse26 (= 1 ~c_dr_pc~0)) (.cse21 (not (= 0 ~c_dr_st~0))) (.cse18 (<= 2 ~p_dw_st~0))) (let ((.cse7 (and .cse21 .cse18)) (.cse6 (not (= 0 ~q_req_up~0))) (.cse9 (< ~q_free~0 1)) (.cse16 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (< 1 ~q_free~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (not .cse26)) (.cse14 (not (= ~q_read_ev~0 2))) (.cse23 (not .cse5)) (.cse24 (not (= .cse19 ~p_num_write~0))) (.cse0 (< ~q_write_ev~0 2)) (.cse25 (not (= ~q_free~0 0))) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse22 (and .cse18 .cse11 .cse15)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse20 (not (= |old(~p_dw_st~0)| 0))) (.cse17 (= ~p_dw_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse8 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse5 .cse12 .cse8 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse4 .cse14 .cse5 .cse15 .cse12 .cse8 .cse13) (or (or .cse0 .cse16 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse12 .cse6) .cse8) (and (and .cse17 .cse11) (= ~q_read_ev~0 1)) (and .cse18 .cse11)) (or .cse2 (not (= 1 ~c_dr_i~0)) (and .cse17 (= ~c_dr_st~0 0) .cse15) (not (= 0 ~c_num_read~0)) (< .cse19 ~q_free~0) .cse13 (not .cse4) (< ~q_free~0 .cse19) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse20 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse14 .cse11 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 (and .cse21 .cse18 .cse15) .cse8) (or .cse22 .cse2 .cse1 .cse3 .cse14 .cse23 .cse24 (= 0 ~q_write_ev~0) .cse25 .cse10 .cse6 .cse8) (or .cse26 .cse1 .cse2 .cse4 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8) (or .cse2 .cse1 .cse3 .cse14 .cse0 .cse9 .cse22 .cse10 .cse16 .cse12 .cse8 .cse13) (or .cse26 .cse1 .cse2 .cse4 .cse14 .cse15) (or .cse2 .cse1 .cse3 .cse14 .cse23 .cse24 .cse0 .cse25 .cse10 .cse22 .cse8) (or .cse26 .cse1 .cse2 .cse4 .cse20 .cse17)))) [2018-12-09 12:24:49,019 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse11 (= 2 ~c_dr_st~0)) (.cse23 (not (= 0 ~c_dr_st~0))) (.cse25 (<= 2 ~p_dw_st~0)) (.cse16 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse15 (= ~p_dw_st~0 0)) (.cse17 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (not .cse12)) (.cse20 (not (= .cse16 ~p_num_write~0))) (.cse22 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse7 (and .cse23 .cse25)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< ~q_free~0 1)) (.cse13 (< 1 ~q_free~0)) (.cse21 (and .cse25 .cse11)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not .cse18)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (= 0 ~q_req_up~0))) (.cse8 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse12 .cse13 .cse8 .cse14) (or .cse2 (and .cse15 (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse16 ~q_free~0) .cse14 (not .cse4) (< ~q_free~0 .cse16) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse17 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse18 .cse1 .cse2 .cse15 .cse4 .cse17) (or .cse1 .cse2 .cse3 .cse5 .cse19 .cse20 .cse21 .cse0 .cse22 .cse10 .cse8) (or .cse2 .cse1 .cse3 .cse5 .cse19 .cse20 (= 0 ~q_write_ev~0) .cse22 .cse10 .cse21 .cse6 .cse8) (or .cse18 .cse1 .cse2 .cse4 .cse23) (or .cse2 .cse1 .cse3 .cse5 .cse21 .cse0 .cse9 .cse10 .cse24 .cse13 .cse8 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse12 .cse6 .cse8) (or (or .cse0 .cse24 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse13 .cse6) .cse8) .cse21) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)))) [2018-12-09 12:24:49,019 INFO L448 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-12-09 12:24:49,019 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-12-09 12:24:49,019 INFO L444 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse14 (+ ~c_num_read~0 1)) (.cse3 (= 0 ~c_dr_st~0))) (let ((.cse8 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse10 (not (= ~q_free~0 0))) (.cse13 (not .cse3)) (.cse15 (< ~q_write_ev~0 2)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse12 (not (= 0 ~c_dr_pc~0))) (.cse23 (< ~q_free~0 .cse14)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse6 (not (= ~q_read_ev~0 2))) (.cse5 (= 1 exists_runnable_thread_~__retres1~2)) (.cse24 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse17 (< ~q_free~0 1)) (.cse18 (not (= 2 ~c_dr_st~0))) (.cse4 (not (= ~p_dw_st~0 0))) (.cse20 (< 1 ~q_free~0)) (.cse16 (not (= 0 ~q_req_up~0))) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (< .cse14 ~q_free~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse2 .cse1 .cse6 .cse7 (not (= ~p_dw_st~0 2)) .cse8 .cse9 .cse10 (not (= 1 ~p_num_write~0)) .cse11 .cse12 .cse13) (or .cse8 .cse1 .cse2 (not .cse0) .cse6 .cse7 (not (= .cse14 ~p_num_write~0)) .cse15 .cse10 .cse16 (< ~p_dw_st~0 2) .cse13) (or .cse5 (let ((.cse19 (not (= ~c_num_read~0 ~p_num_write~0)))) (and (or .cse2 .cse1 .cse6 .cse7 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21) (or .cse15 .cse7 (or .cse1 .cse17 .cse2 .cse18 .cse6 .cse4 .cse20 .cse16) .cse19)))) (or .cse2 (not (= 1 ~c_dr_i~0)) .cse11 .cse22 .cse21 .cse23 .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) .cse24 .cse9 .cse4 .cse16 .cse12 .cse5) (or .cse23 .cse2 .cse1 .cse6 .cse5 .cse24 .cse9 .cse17 .cse18 .cse4 .cse20 .cse16 .cse21 .cse22)))) [2018-12-09 12:24:49,019 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-12-09 12:24:49,019 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-12-09 12:24:49,019 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-12-09 12:24:49,019 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-12-09 12:24:49,019 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-12-09 12:24:49,019 INFO L444 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse12 (= 1 ~c_dr_pc~0)) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse5 (= ~p_dw_pc~0 1)) (.cse9 (= 0 ~c_dr_st~0)) (.cse8 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse13)) (.cse7 (< |old(~q_write_ev~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse0 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse3 (not (= 2 ~c_dr_st~0))) (.cse10 (or (< ~q_free~0 1) (not .cse12) (< 1 ~q_free~0))) (.cse4 (not (= |old(~q_read_ev~0)| 2))) (.cse6 (< ~p_dw_st~0 2)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse0) (or .cse1 .cse2 (not (= ~q_free~0 0)) .cse3 .cse4 (not .cse5) (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= 0 |old(~q_write_ev~0)|) .cse6)) (or .cse7 .cse1 .cse2 .cse8 .cse9 .cse10 .cse5 .cse6 .cse11) (or .cse12 .cse1 .cse2 .cse9 .cse8) (or .cse7 .cse1 .cse2 (and .cse13 .cse0) .cse3 .cse10 .cse4 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse11)))) [2018-12-09 12:24:49,019 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse24 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse25 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse16 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse19 (+ ~c_num_read~0 1)) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (= ~p_dw_st~0 0))) (.cse15 (= 1 ~c_dr_pc~0)) (.cse3 (not .cse18)) (.cse4 (not (= .cse19 ~p_num_write~0))) (.cse7 (not (= ~q_free~0 0))) (.cse23 (= ~q_read_ev~0 1)) (.cse22 (not (= |old(~q_read_ev~0)| 1))) (.cse17 (= 0 ~c_dr_st~0)) (.cse13 (not (= 0 ~q_req_up~0))) (.cse14 (and .cse25 .cse16)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (and .cse16 .cse24)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse11 (< ~q_free~0 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse10 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (< 1 ~q_free~0)) (.cse9 (< ~p_dw_st~0 2)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (or .cse6 .cse10 (or .cse0 .cse1 .cse11 .cse8 .cse12 .cse13) .cse9) .cse14) (or .cse1 .cse0 (not .cse15) .cse2 .cse3 .cse4 .cse7 (and .cse16 (= 1 ~q_write_ev~0)) (not (= 1 |old(~q_write_ev~0)|)) .cse13 .cse9) (or .cse6 .cse0 .cse1 .cse14 .cse17 .cse18 .cse13 .cse9) (or .cse1 (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_read_ev~0 ~q_write_ev~0)) (not (= 0 ~c_num_read~0)) (< .cse19 ~q_free~0) .cse20 (< ~q_free~0 .cse19) .cse0 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse21 .cse13 (not (= 0 ~c_dr_pc~0)) (or .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (or (and (or .cse22 (or .cse6 (or .cse0 .cse1 .cse11 .cse8 .cse21 .cse12 .cse13) .cse3 .cse10)) (or .cse6 .cse0 .cse11 .cse1 .cse8 .cse22 .cse3 .cse21 .cse10 .cse12 .cse20)) (and .cse23 .cse24)) (or .cse6 .cse0 .cse11 .cse1 .cse14 .cse17 .cse18 .cse12 .cse9 .cse20) (or .cse15 .cse0 .cse1 .cse17 .cse14) (or .cse1 .cse0 .cse2 .cse3 .cse4 (= 0 |old(~q_write_ev~0)|) .cse7 .cse8 .cse5 .cse13 .cse9) (or .cse6 (and .cse25 .cse23) .cse22 (or .cse0 .cse1 .cse11 .cse17 .cse12 .cse13) .cse10 .cse9) (or .cse6 .cse0 .cse1 .cse17 .cse2 .cse13 .cse14 .cse9) (or .cse1 .cse0 .cse2 .cse5 .cse6 .cse11 .cse8 .cse10 .cse12 .cse9 .cse20)))) [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 223 240) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0)) (not (= 0 ~c_num_read~0)) (< .cse0 ~q_free~0) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 |old(~c_dr_st~0)|)) (< ~q_free~0 .cse0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 ~q_req_up~0)) (not (= 0 ~c_dr_pc~0)))) [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-12-09 12:24:49,020 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-12-09 12:24:49,021 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-09 12:24:49,021 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-09 12:24:49,021 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-12-09 12:24:49,021 INFO L444 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-09 12:24:49,021 INFO L444 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0))) [2018-12-09 12:24:49,021 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-12-09 12:24:49,021 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1)) (.cse16 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= 1 ~c_dr_pc~0))) (let ((.cse14 (= |old(~p_dw_pc~0)| 1)) (.cse1 (not (= 2 ~c_dr_st~0))) (.cse5 (not .cse21)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse11 (and .cse16 .cse18)) (.cse15 (< .cse23 |old(~q_free~0)|)) (.cse0 (< |old(~q_free~0)| .cse23)) (.cse12 (<= .cse23 ~q_free~0)) (.cse13 (= 0 ~p_num_write~0)) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse10 (= ~q_req_up~0 0)) (.cse17 (<= ~q_free~0 1)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse3 (< |old(~q_free~0)| 1)) (.cse22 (= 0 ~c_dr_st~0)) (.cse20 (< 1 |old(~q_free~0)|)) (.cse7 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 (or .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse8 .cse9 (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and (and .cse10 .cse11) .cse12 (<= ~q_free~0 (+ ~p_num_write~0 1)) .cse13) .cse14 .cse15) (or (and (= ~c_num_read~0 ~p_num_write~0) (or (and .cse16 .cse17 .cse18) (and .cse16 .cse10 .cse18))) (or (or (not .cse14) (let ((.cse19 (< ~q_write_ev~0 2))) (and (or .cse19 .cse2 .cse4 .cse5 .cse1 .cse6 .cse7) (or .cse19 (or .cse1 (or .cse2 .cse4 .cse5 .cse6 .cse20)))))) (not (= ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse21 .cse2 .cse4 .cse22 .cse11) (or .cse4 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse22) .cse0 .cse2 (and .cse16 .cse10 .cse18 .cse12 .cse17 (= ~c_last_read~0 ~p_last_write~0) .cse13) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse8 .cse9 .cse7 (not (= 0 ~c_dr_pc~0))) (or .cse21 .cse2 .cse4 .cse10 .cse22 .cse7) (or .cse21 (and .cse17 (<= 1 ~q_free~0)) .cse2 .cse4 .cse3 .cse22 .cse20 .cse7)))) [2018-12-09 12:24:49,022 INFO L444 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse18 (+ ~c_num_read~0 1)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse1 (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse17)) (.cse14 (= |old(~p_dw_pc~0)| 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse9 (not .cse0)) (.cse10 (not (= ~q_read_ev~0 2))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse6 (<= .cse18 ~q_free~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse15 (< .cse18 |old(~q_free~0)|)) (.cse4 (= 0 ~c_dr_st~0)) (.cse5 (< |old(~q_free~0)| .cse18)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse11 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 (and .cse1 .cse6 (<= ~q_free~0 (+ ~p_num_write~0 1)) .cse7) (or .cse8 (or .cse2 (< |old(~q_free~0)| 1) .cse3 .cse9 .cse10) .cse11) .cse12 .cse13 (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) .cse14 .cse15) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse1) (or (or (not .cse14) (let ((.cse16 (< ~q_write_ev~0 2))) (and (or .cse16 .cse2 .cse3 .cse9 .cse8 .cse10 .cse11) (or .cse16 (or .cse8 (or .cse2 .cse3 .cse9 .cse10 (< 1 |old(~q_free~0)|))))))) (not (= ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse3 (not (= 1 ~c_dr_i~0)) (and .cse17 (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) .cse6 (<= ~q_free~0 .cse18) .cse7) (not (= 0 ~c_num_read~0)) .cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse4) .cse5 .cse2 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse12 .cse13 .cse11 (not (= 0 ~c_dr_pc~0)))))) [2018-12-09 12:24:49,022 INFO L444 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 1 ~c_dr_pc~0)) (.cse2 (+ ~c_num_read~0 1))) (let ((.cse11 (= 0 ~c_dr_st~0)) (.cse12 (< |old(~q_free~0)| .cse2)) (.cse1 (= ~q_free~0 0)) (.cse7 (not (= 2 ~c_dr_st~0))) (.cse4 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse5 (not (= ~p_dw_i~0 1))) (.cse6 (not .cse19)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse18 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse14 (= ~q_req_up~0 0)) (.cse20 (and .cse13 .cse0)) (.cse15 (<= .cse2 ~q_free~0)) (.cse16 (= 0 ~p_num_write~0)) (.cse10 (< .cse2 |old(~q_free~0)|))) (and (or (and (= ~p_dw_pc~0 1) .cse0 .cse1 (= .cse2 ~p_num_write~0)) (or (or (not (= |old(~p_dw_pc~0)| 1)) (let ((.cse3 (< ~q_write_ev~0 2))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 (or .cse7 (or .cse4 .cse5 .cse6 .cse8 (< 1 |old(~q_free~0)|))))))) (not (= ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse5 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse11) .cse12 .cse4 (and .cse13 .cse14 .cse0 .cse15 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) .cse16) (not (= 2 ~q_write_ev~0)) (and (= ~p_num_write~0 1) .cse13 .cse0 .cse1) (not (= |old(~p_dw_pc~0)| 0)) .cse17 .cse18 .cse9 (not (= 0 ~c_dr_pc~0))) (or .cse19 .cse4 .cse5 .cse20 .cse11) (let ((.cse21 (+ |old(~p_num_write~0)| 1))) (or .cse12 (and (<= .cse21 ~p_num_write~0) (<= ~p_num_write~0 1) .cse13 .cse0 .cse1) (or .cse7 (or .cse4 (< |old(~q_free~0)| 1) .cse5 .cse6 .cse8) .cse9) .cse17 .cse18 (< .cse21 |old(~q_free~0)|) (and (and .cse14 .cse20) .cse15 (<= ~q_free~0 (+ ~p_num_write~0 1)) .cse16) .cse10))))) [2018-12-09 12:24:49,022 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-12-09 12:24:49,022 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-12-09 12:24:49,022 INFO L444 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse17 (= 1 ~c_dr_pc~0)) (.cse4 (+ ~c_num_read~0 1))) (let ((.cse14 (< |old(~q_free~0)| .cse4)) (.cse9 (not (= 2 ~c_dr_st~0))) (.cse8 (not .cse17)) (.cse10 (not (= ~q_read_ev~0 2))) (.cse11 (not (= 0 |old(~q_req_up~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (= ~p_dw_pc~0 1)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0)) (.cse12 (< .cse4 |old(~q_free~0)|)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse13 (= 0 ~c_dr_st~0))) (and (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ~p_num_write~0)) (or (or (not (= |old(~p_dw_pc~0)| 1)) (let ((.cse5 (< ~q_write_ev~0 2))) (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse5 (or .cse9 (or .cse6 .cse7 .cse8 .cse10 (< 1 |old(~q_free~0)|))))))) (not (= ~c_num_read~0 |old(~p_num_write~0)|)))) (or .cse7 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse13) .cse14 .cse6 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse15 .cse16 (and (= ~p_dw_st~0 2) (= ~p_num_write~0 1) .cse1 .cse2 .cse3) .cse11 (not (= 0 ~c_dr_pc~0))) (or .cse17 .cse6 .cse7 .cse13 .cse2) (let ((.cse18 (+ |old(~p_num_write~0)| 1))) (or .cse14 (or .cse9 (or .cse6 (< |old(~q_free~0)| 1) .cse7 .cse8 .cse10) .cse11) .cse15 .cse16 (and .cse0 (<= .cse18 ~p_num_write~0) (<= ~p_num_write~0 1) .cse1 .cse2 .cse3) (< .cse18 |old(~q_free~0)|) .cse12)) (or .cse17 .cse6 .cse7 .cse13 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= 1 |old(~p_dw_pc~0)|)))))) [2018-12-09 12:24:49,022 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-12-09 12:24:49,022 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= |old(~c_num_read~0)| ~c_num_read~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~p_num_write~0)| ~p_num_write~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L451 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L451 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-12-09 12:24:49,023 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-12-09 12:24:49,023 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-12-09 12:24:49,024 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse32 (= |old(~p_dw_pc~0)| 1)) (.cse24 (<= 1 ~q_free~0)) (.cse23 (<= ~q_free~0 1)) (.cse36 (+ ~c_num_read~0 1)) (.cse34 (+ |old(~c_num_read~0)| 1)) (.cse4 (not (= 0 ~c_dr_st~0))) (.cse13 (<= 2 ~p_dw_st~0)) (.cse5 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse14 (= ~q_req_up~0 0)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse33 (and .cse4 .cse13 .cse5 .cse14 .cse18 .cse6)) (.cse10 (not (= .cse34 |old(~p_num_write~0)|))) (.cse19 (= ~q_free~0 0)) (.cse20 (= .cse36 ~p_num_write~0)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse38 (and .cse24 .cse23)) (.cse15 (= ~p_dw_pc~0 1)) (.cse16 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse27 (= ~c_num_read~0 ~p_num_write~0)) (.cse35 (= ~p_dw_st~0 0)) (.cse17 (= 2 ~c_dr_st~0)) (.cse9 (not .cse32)) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (not (= ~q_read_ev~0 2))) (.cse37 (not (= |old(~p_dw_st~0)| 0))) (.cse21 (not (= 0 |old(~q_req_up~0)|))) (.cse30 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse29 (< ~q_write_ev~0 2)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~q_free~0)| 1)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse7 (not .cse0)) (.cse28 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse26 (< 1 |old(~q_free~0)|)) (.cse22 (< |old(~p_dw_st~0)| 2)) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_dr_pc~0 1)) .cse4 .cse5 .cse6)) (or .cse2 .cse1 .cse7 .cse8 .cse9 .cse10 (= 0 ~q_write_ev~0) .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse6 .cse19 .cse20) .cse21 .cse22) (or .cse0 (and .cse23 .cse24) .cse1 .cse2 .cse25 .cse3 .cse26 .cse21) (or .cse2 .cse1 .cse7 .cse8 .cse9 (and .cse13 .cse15 .cse16 .cse27 .cse17 .cse18 .cse6 .cse24 .cse23 .cse28) .cse29 .cse25 .cse12 .cse30 .cse26 .cse22 .cse31) (or .cse29 .cse1 .cse25 .cse2 .cse7 .cse12 .cse17 .cse32 .cse26 .cse22 .cse31) (or .cse29 .cse1 .cse2 .cse7 .cse33 .cse3 .cse32 .cse21 .cse22) (or .cse29 .cse1 .cse2 .cse7 .cse3 .cse8 .cse21 .cse33 .cse22) (or .cse1 .cse2 .cse7 .cse8 .cse9 .cse10 .cse29 .cse11 .cse21 .cse22 (and .cse13 .cse14 .cse15 .cse16 .cse18 .cse6 .cse19 .cse20)) (or .cse1 .cse2 .cse7 .cse8 .cse9 .cse10 (and .cse13 .cse15 .cse16 .cse17 .cse18 .cse6 .cse19 .cse20) .cse29 .cse11 .cse12 .cse22) (or .cse0 .cse1 .cse2 .cse14 .cse3 .cse21) (or .cse29 .cse1 .cse2 .cse7 .cse12 .cse17 .cse32 .cse21 .cse22) (or .cse2 .cse1 .cse7 .cse8 (and (= ~c_num_read~0 1) (= ~p_num_write~0 1)) .cse29 .cse25 .cse3 (not (= 1 |old(~p_num_write~0)|)) .cse32 (not (= 1 |old(~c_num_read~0)|)) .cse26 .cse22 .cse31) (or .cse29 .cse17 .cse1 .cse2 .cse7 .cse12 .cse8 .cse21 .cse22) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse34 |old(~q_free~0)|) .cse31 (not .cse3) (< |old(~q_free~0)| .cse34) .cse1 (and .cse35 (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) .cse5 .cse14 .cse6 (= ~c_num_read~0 0) (<= .cse36 ~q_free~0) .cse23 .cse28 (= 0 ~p_num_write~0)) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse37 .cse21 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse0 .cse1 .cse2 .cse35 .cse3 .cse37) (or (or .cse29 .cse9 .cse30 (or .cse1 .cse2 .cse25 .cse7 .cse12 .cse26 .cse21) .cse22) (and .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse6 .cse24 .cse23)) (or .cse29 .cse38 (or .cse1 .cse2 .cse25 .cse3 .cse32 .cse26 .cse21) .cse22) (or (or .cse1 .cse25 .cse2 .cse3 .cse8 .cse26 .cse21) .cse38 .cse29 .cse22) (or (or (and .cse15 .cse16 .cse27 .cse35 .cse17 .cse18 .cse6 .cse24 .cse23 .cse28) (and .cse15 .cse14 .cse16 .cse27 .cse35 .cse17 .cse18 .cse6 .cse24 .cse23)) (and (or .cse2 .cse1 .cse7 .cse8 .cse9 .cse29 .cse25 .cse12 .cse37 .cse30 .cse26 .cse31) (or .cse29 .cse9 (or .cse1 .cse25 .cse2 .cse7 .cse12 .cse8 .cse37 .cse26 .cse21) .cse30))) (or .cse29 .cse1 .cse25 .cse2 .cse7 (and .cse4 .cse13 .cse5 .cse18 .cse6 .cse24 .cse23 .cse28) .cse3 .cse32 .cse26 .cse22 .cse31)))) [2018-12-09 12:24:49,024 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-12-09 12:24:49,024 INFO L448 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-12-09 12:24:49,024 INFO L444 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse37 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (+ |old(~p_num_write~0)| 1)) (.cse31 (<= 1 ~q_free~0)) (.cse32 (<= ~q_free~0 1)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse34 (not (= 0 ~c_dr_st~0))) (.cse16 (<= 2 ~p_dw_st~0)) (.cse35 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse42 (= ~p_dw_i~0 1)) (.cse41 (+ |old(~c_num_read~0)| 1))) (let ((.cse13 (not (= .cse41 |old(~p_num_write~0)|))) (.cse24 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse36 (and .cse34 .cse16 .cse35 (<= 2 ~q_write_ev~0) .cse17 .cse21 .cse22 (= 2 ~q_read_ev~0) .cse42)) (.cse12 (not .cse7)) (.cse28 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse19 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse30 (= ~c_num_read~0 ~p_num_write~0)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse1 (and .cse31 .cse32)) (.cse39 (= ~c_num_read~0 1)) (.cse40 (= ~p_num_write~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse25 (<= .cse26 ~p_num_write~0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse23 (= ~q_free~0 0)) (.cse38 (and (not (= ~c_dr_pc~0 1)) .cse34 .cse22)) (.cse27 (not (= |old(~p_dw_st~0)| 0))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (< |old(~q_free~0)| 1)) (.cse3 (not .cse42)) (.cse5 (not .cse37)) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse8 (< 1 |old(~q_free~0)|)) (.cse10 (< |old(~p_dw_st~0)| 2)) (.cse29 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse13 (= 0 ~q_write_ev~0) .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (or (and .cse16 .cse18 .cse20 .cse21 .cse22 .cse25 (<= ~p_num_write~0 .cse26) .cse23 .cse24) (and (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse0 .cse4 .cse15 .cse27 .cse28 .cse8 .cse29) (or .cse0 .cse12 (or .cse2 .cse4 .cse3 .cse5 .cse15 .cse11 .cse27 .cse8 .cse9) .cse28))) (or .cse3 .cse2 .cse5 .cse11 .cse12 (and .cse16 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse31 .cse32 .cse33) .cse0 .cse4 .cse15 .cse28 .cse8 .cse10 .cse29) (or .cse0 .cse2 .cse4 .cse3 .cse5 .cse15 .cse20 .cse7 .cse8 .cse10 .cse29) (or .cse0 .cse2 .cse3 .cse5 (and .cse34 .cse16 .cse35 .cse17 .cse21 .cse22) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 .cse36 .cse0 .cse14 .cse9 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse16 .cse18 .cse30 .cse20 .cse21 .cse22 .cse31 .cse32 .cse33) .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse0 .cse14 .cse15 .cse10) (or .cse37 .cse2 .cse3 .cse6 .cse38) (or .cse0 .cse2 .cse3 .cse5 .cse15 .cse20 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse11 .cse9 .cse36 .cse10) (or .cse3 .cse2 .cse5 .cse11 (and .cse39 .cse40) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse29) (or .cse0 .cse20 .cse2 .cse3 .cse5 .cse15 .cse11 .cse9 .cse10) (or (or .cse0 .cse12 .cse28 (or .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9) .cse10) (and .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse31 .cse32)) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse11 .cse8 .cse9) .cse1 .cse0 .cse10) (or .cse3 (and .cse16 .cse20 .cse39 .cse31 .cse40 .cse18 .cse22 .cse32 .cse33) (not (= 1 ~c_dr_i~0)) (and .cse16 .cse20 .cse25 (<= ~p_num_write~0 1) .cse18 .cse22 (= ~c_num_read~0 0) .cse23) (not (= 0 |old(~c_num_read~0)|)) (< .cse41 |old(~q_free~0)|) .cse29 (< |old(~q_free~0)| .cse41) .cse2 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse38 .cse27 .cse9 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse34 .cse16 .cse35 .cse21 .cse22 .cse31 .cse32 .cse33) .cse6 .cse7 .cse8 .cse10 .cse29)))) [2018-12-09 12:24:49,024 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-12-09 12:24:49,025 INFO L444 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse47 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse42 (+ ~c_num_read~0 1)) (.cse48 (+ |old(~p_num_write~0)| 1)) (.cse26 (<= 1 ~q_free~0)) (.cse28 (<= ~q_free~0 1)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse32 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse49 (= ~p_dw_i~0 1)) (.cse45 (not (= 0 ~c_dr_st~0))) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (+ |old(~c_num_read~0)| 1))) (let ((.cse13 (not (= .cse36 |old(~p_num_write~0)|))) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse40 (and (not (= ~c_dr_pc~0 1)) .cse45 .cse22)) (.cse46 (and .cse45 .cse16 .cse32 (<= 2 ~q_write_ev~0) .cse17 .cse21 .cse22 (= 2 ~q_read_ev~0) .cse49)) (.cse25 (= ~c_num_read~0 1)) (.cse27 (= ~p_num_write~0 1)) (.cse1 (and .cse26 .cse28)) (.cse19 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse43 (= ~c_num_read~0 ~p_num_write~0)) (.cse30 (= ~p_dw_st~0 0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse39 (<= .cse48 ~p_num_write~0)) (.cse23 (= ~q_free~0 0)) (.cse24 (= .cse42 ~p_num_write~0)) (.cse12 (not .cse7)) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= ~q_read_ev~0 2))) (.cse41 (not (= |old(~p_dw_st~0)| 0))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse44 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (< |old(~q_free~0)| 1)) (.cse3 (not .cse49)) (.cse5 (not .cse47)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse8 (< 1 |old(~q_free~0)|)) (.cse10 (< |old(~p_dw_st~0)| 2)) (.cse37 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse13 (= 0 ~q_write_ev~0) .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (let ((.cse31 (= ~c_dr_pc~0 0)) (.cse33 (= ~c_num_read~0 0)) (.cse34 (<= .cse42 ~q_free~0)) (.cse38 (<= 1 eval_~tmp___1~0)) (.cse35 (= 0 ~p_num_write~0))) (or .cse3 (and .cse16 .cse20 .cse25 .cse26 .cse27 .cse18 .cse22 .cse28 .cse29) (not (= 1 ~c_dr_i~0)) (and .cse30 .cse31 .cse32 .cse17 .cse22 .cse33 .cse34 .cse28 .cse29 .cse35) (not (= 0 |old(~c_num_read~0)|)) (< .cse36 |old(~q_free~0)|) .cse37 (< |old(~q_free~0)| .cse36) .cse2 (and (= ~p_dw_st~0 2) .cse27 .cse31 .cse18 .cse22 .cse33 .cse23 .cse38) (and .cse16 .cse20 .cse39 (<= ~p_num_write~0 1) .cse18 .cse22 .cse33 .cse23) (and .cse30 .cse20 .cse32 (= |old(~c_num_read~0)| ~c_num_read~0) .cse17 .cse22 .cse34 .cse28 .cse38 .cse29 .cse35) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse40 .cse41 .cse9 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse3 .cse2 .cse5 .cse11 .cse12 (and .cse16 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse0 .cse4 .cse15 .cse44 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse4 .cse3 .cse5 .cse15 .cse20 .cse7 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse17 .cse21 .cse22) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse16 .cse18 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse11 .cse12 .cse13 .cse46 .cse0 .cse14 (and .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse0 .cse14 .cse15 .cse10) (or .cse47 .cse2 .cse3 .cse6 .cse40) (or .cse0 .cse2 .cse3 .cse5 .cse15 .cse20 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse11 .cse9 .cse46 .cse10) (or .cse3 .cse2 .cse5 .cse11 (and .cse25 .cse27) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse37) (or .cse0 .cse20 .cse2 .cse3 .cse5 .cse15 .cse11 .cse9 .cse10) (or (or .cse0 .cse12 .cse44 (or .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9) .cse10) (and .cse16 .cse17 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28)) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse11 .cse8 .cse9) .cse1 .cse0 .cse10) (or (or (and .cse18 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) (and .cse18 .cse17 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28)) (and .cse16 .cse18 .cse20 .cse21 .cse22 .cse39 (<= ~p_num_write~0 .cse48) .cse23 .cse24) (and (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse0 .cse4 .cse15 .cse41 .cse44 .cse8 .cse37) (or .cse0 .cse12 (or .cse2 .cse4 .cse3 .cse5 .cse15 .cse11 .cse41 .cse8 .cse9) .cse44))) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse21 .cse22 .cse26 .cse28 .cse29) .cse6 .cse7 .cse8 .cse10 .cse37)))) [2018-12-09 12:24:49,025 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-12-09 12:24:49,025 INFO L444 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse23 (= 1 |old(~c_dr_pc~0)|)) (.cse30 (+ |old(~c_num_read~0)| 1)) (.cse31 (= |old(~p_dw_pc~0)| 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (= 2 ~c_dr_st~0)) (.cse25 (and (not (= ~c_dr_pc~0 1)) (not (= 0 ~c_dr_st~0)) .cse4)) (.cse0 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse5 (= ~q_req_up~0 0)) (.cse1 (<= ~q_free~0 1)) (.cse6 (<= 1 eval_~tmp___1~0)) (.cse15 (not (= |old(~p_dw_st~0)| 0))) (.cse16 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse14 (not (= 2 |old(~c_dr_st~0)|))) (.cse21 (not (= |old(~q_free~0)| 0))) (.cse11 (not .cse31)) (.cse20 (not (= .cse30 |old(~p_num_write~0)|))) (.cse13 (< |old(~q_free~0)| 1)) (.cse17 (< 1 |old(~q_free~0)|)) (.cse18 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse12 (< ~q_write_ev~0 2)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse9 (not .cse23)) (.cse24 (= 0 |old(~c_dr_st~0)|)) (.cse10 (not (= ~q_read_ev~0 2))) (.cse19 (not (= 0 |old(~q_req_up~0)|))) (.cse22 (< |old(~p_dw_st~0)| 2))) (and (or (and (and (= |old(~p_num_write~0)| ~p_num_write~0) (= ~c_num_read~0 ~p_num_write~0) (let ((.cse3 (= 1 ~c_dr_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4)))) .cse6) (and (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse12 .cse11 (or .cse8 .cse13 .cse7 .cse9 .cse14 .cse10 .cse15 .cse17 .cse19) .cse16))) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 (= 0 ~q_write_ev~0) .cse21 .cse14 .cse19 .cse22) (or .cse23 .cse8 .cse7 .cse24 .cse25) (or .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22 .cse18) (let ((.cse28 (+ ~c_num_read~0 1))) (let ((.cse27 (<= .cse28 ~q_free~0)) (.cse29 (= 0 ~p_num_write~0))) (or .cse7 (not (= 1 ~c_dr_i~0)) (let ((.cse26 (+ ~p_num_write~0 1))) (and (and .cse5 .cse2 (and .cse0 .cse4)) (<= .cse26 ~q_free~0) .cse27 (<= ~q_free~0 .cse28) .cse6 (<= ~q_free~0 .cse26) .cse29)) (not (= 0 |old(~c_num_read~0)|)) (< .cse30 |old(~q_free~0)|) .cse18 (< |old(~q_free~0)| .cse30) .cse8 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse25 (and (= ~c_dr_pc~0 0) .cse0 .cse5 .cse4 (= ~c_num_read~0 0) .cse27 .cse1 .cse6 (= ~c_last_read~0 ~p_last_write~0) .cse29) .cse15 .cse19 (not (= 0 |old(~c_dr_pc~0)|))))) (or .cse12 .cse16 (or .cse8 .cse7 .cse13 .cse9 .cse14 .cse17 .cse19) .cse22) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse21 .cse14 .cse22) (or .cse12 .cse8 .cse7 .cse9 .cse21 .cse10 .cse11 .cse20 .cse19 .cse22) (or .cse12 .cse8 .cse13 .cse7 .cse9 .cse24 .cse31 .cse17 .cse22 .cse18) (or .cse12 .cse8 .cse7 .cse9 .cse24 .cse31 .cse19 .cse22) (or .cse12 .cse8 .cse7 .cse9 .cse24 .cse10 .cse19 .cse22)))) [2018-12-09 12:24:49,025 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-12-09 12:24:49,026 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-12-09 12:24:49,026 INFO L448 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-12-09 12:24:49,026 INFO L444 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse47 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse42 (+ ~c_num_read~0 1)) (.cse48 (+ |old(~p_num_write~0)| 1)) (.cse26 (<= 1 ~q_free~0)) (.cse28 (<= ~q_free~0 1)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse32 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse49 (= ~p_dw_i~0 1)) (.cse45 (not (= 0 ~c_dr_st~0))) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (+ |old(~c_num_read~0)| 1))) (let ((.cse13 (not (= .cse36 |old(~p_num_write~0)|))) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse40 (and (not (= ~c_dr_pc~0 1)) .cse45 .cse22)) (.cse46 (and .cse45 .cse16 .cse32 (<= 2 ~q_write_ev~0) .cse17 .cse21 .cse22 (= 2 ~q_read_ev~0) .cse49)) (.cse25 (= ~c_num_read~0 1)) (.cse27 (= ~p_num_write~0 1)) (.cse1 (and .cse26 .cse28)) (.cse19 (= |old(~p_num_write~0)| ~p_num_write~0)) (.cse43 (= ~c_num_read~0 ~p_num_write~0)) (.cse30 (= ~p_dw_st~0 0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse20 (= 2 ~c_dr_st~0)) (.cse39 (<= .cse48 ~p_num_write~0)) (.cse23 (= ~q_free~0 0)) (.cse24 (= .cse42 ~p_num_write~0)) (.cse12 (not .cse7)) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= ~q_read_ev~0 2))) (.cse41 (not (= |old(~p_dw_st~0)| 0))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse44 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse0 (< ~q_write_ev~0 2)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (< |old(~q_free~0)| 1)) (.cse3 (not .cse49)) (.cse5 (not .cse47)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse8 (< 1 |old(~q_free~0)|)) (.cse10 (< |old(~p_dw_st~0)| 2)) (.cse37 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse13 (= 0 ~q_write_ev~0) .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (let ((.cse31 (= ~c_dr_pc~0 0)) (.cse33 (= ~c_num_read~0 0)) (.cse34 (<= .cse42 ~q_free~0)) (.cse38 (<= 1 eval_~tmp___1~0)) (.cse35 (= 0 ~p_num_write~0))) (or .cse3 (and .cse16 .cse20 .cse25 .cse26 .cse27 .cse18 .cse22 .cse28 .cse29) (not (= 1 ~c_dr_i~0)) (and .cse30 .cse31 .cse32 .cse17 .cse22 .cse33 .cse34 .cse28 .cse29 .cse35) (not (= 0 |old(~c_num_read~0)|)) (< .cse36 |old(~q_free~0)|) .cse37 (< |old(~q_free~0)| .cse36) .cse2 (and (= ~p_dw_st~0 2) .cse27 .cse31 .cse18 .cse22 .cse33 .cse23 .cse38) (and .cse16 .cse20 .cse39 (<= ~p_num_write~0 1) .cse18 .cse22 .cse33 .cse23) (and .cse30 .cse20 .cse32 (= |old(~c_num_read~0)| ~c_num_read~0) .cse17 .cse22 .cse34 .cse28 .cse38 .cse29 .cse35) (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse40 .cse41 .cse9 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse3 .cse2 .cse5 .cse11 .cse12 (and .cse16 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse0 .cse4 .cse15 .cse44 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse4 .cse3 .cse5 .cse15 .cse20 .cse7 .cse8 .cse10 .cse37) (or .cse0 .cse2 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse17 .cse21 .cse22) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse16 .cse18 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) .cse11 .cse12 .cse13 .cse46 .cse0 .cse14 (and .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) .cse9 .cse10) (or .cse2 .cse3 .cse5 .cse11 .cse12 .cse13 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse0 .cse14 .cse15 .cse10) (or .cse47 .cse2 .cse3 .cse6 .cse40) (or .cse0 .cse2 .cse3 .cse5 .cse15 .cse20 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse11 .cse9 .cse46 .cse10) (or .cse3 .cse2 .cse5 .cse11 (and .cse25 .cse27) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse37) (or .cse0 .cse20 .cse2 .cse3 .cse5 .cse15 .cse11 .cse9 .cse10) (or (or .cse0 .cse12 .cse44 (or .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9) .cse10) (and .cse16 .cse17 .cse18 .cse19 .cse43 .cse20 .cse21 .cse22 .cse26 .cse28)) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse11 .cse8 .cse9) .cse1 .cse0 .cse10) (or (or (and .cse18 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28 .cse29) (and .cse18 .cse17 .cse19 .cse43 .cse30 .cse20 .cse21 .cse22 .cse26 .cse28)) (and .cse16 .cse18 .cse20 .cse21 .cse22 .cse39 (<= ~p_num_write~0 .cse48) .cse23 .cse24) (and (or .cse3 .cse2 .cse5 .cse11 .cse12 .cse0 .cse4 .cse15 .cse41 .cse44 .cse8 .cse37) (or .cse0 .cse12 (or .cse2 .cse4 .cse3 .cse5 .cse15 .cse11 .cse41 .cse8 .cse9) .cse44))) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse45 .cse16 .cse32 .cse21 .cse22 .cse26 .cse28 .cse29) .cse6 .cse7 .cse8 .cse10 .cse37)))) [2018-12-09 12:24:49,026 INFO L444 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse9 (+ |old(~c_num_read~0)| 1))) (let ((.cse21 (= 0 |old(~c_dr_st~0)|)) (.cse20 (= 1 |old(~c_dr_pc~0)|)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 eval_~tmp___1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (not (= 0 ~c_dr_st~0))) (.cse8 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= .cse9 |old(~p_num_write~0)|))) (.cse17 (not (= |old(~q_free~0)| 0))) (.cse19 (< |old(~p_dw_st~0)| 2)) (.cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse22 (< ~q_write_ev~0 2)) (.cse15 (not .cse26)) (.cse11 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse24 (< |old(~q_free~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse18 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= ~q_read_ev~0 2))) (.cse12 (not (= |old(~p_dw_st~0)| 0))) (.cse25 (< 1 |old(~q_free~0)|)) (.cse13 (not (= 0 |old(~q_req_up~0)|))) (.cse23 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)))) (and (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse5 (= ~c_num_read~0 0))) (or .cse0 (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (= ~p_num_write~0 1) .cse3 (= ~p_dw_pc~0 1) .cse4 .cse5 .cse6 .cse7) (and .cse1 (= ~p_dw_st~0 0) .cse3 .cse8 (= ~q_req_up~0 0) .cse4 .cse5 (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) .cse7 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse9 |old(~q_free~0)|) .cse10 (< |old(~q_free~0)| .cse9) .cse11 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~q_read_ev~0 ~q_write_ev~0)) .cse12 .cse13 (not (= 0 |old(~c_dr_pc~0)|)))) (or .cse0 .cse11 .cse14 .cse15 .cse16 (= 0 ~q_write_ev~0) .cse17 .cse18 .cse13 .cse19) (or .cse20 .cse11 .cse0 .cse21) (or .cse22 .cse23 (or .cse11 .cse0 .cse24 .cse18 .cse25 .cse13) .cse19) (or .cse22 .cse11 .cse24 .cse0 .cse21 .cse26 .cse25 .cse19 .cse10) (or .cse0 .cse11 .cse14 .cse15 .cse22 .cse24 .cse18 .cse12 .cse23 .cse25 .cse10) (or .cse22 .cse11 .cse0 .cse21 .cse26 .cse13 .cse19) (or .cse22 .cse11 .cse0 .cse21 .cse14 .cse13 .cse19) (or .cse11 .cse0 (not .cse20) (and .cse6 (= |old(~c_num_read~0)| ~c_num_read~0) .cse7 (= |old(~p_num_write~0)| ~p_num_write~0) (and .cse2 (and .cse1 (and .cse8 (= 1 ~c_dr_pc~0) .cse4)))) .cse14 .cse15 .cse16 .cse22 .cse17 .cse13 .cse19) (or .cse0 .cse11 .cse14 .cse15 .cse16 .cse22 .cse17 .cse18 .cse19) (or .cse0 .cse11 .cse14 .cse22 .cse24 .cse18 .cse23 .cse25 .cse19 .cse10) (or .cse22 .cse15 (or .cse11 .cse24 .cse0 .cse18 .cse14 .cse12 .cse25 .cse13) .cse23)))) [2018-12-09 12:24:49,027 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-12-09 12:24:49,027 INFO L444 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse20 (= 1 ~c_dr_pc~0)) (.cse17 (+ ~c_num_read~0 1))) (let ((.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= .cse17 ~p_num_write~0))) (.cse13 (not (= 1 ~p_dw_pc~0))) (.cse14 (not (= ~q_free~0 0))) (.cse4 (or (not .cse20) (not (= ~q_read_ev~0 2)))) (.cse7 (< ~p_dw_st~0 2)) (.cse3 (= 0 ~c_dr_st~0)) (.cse0 (< ~q_write_ev~0 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse8 (< ~q_free~0 1)) (.cse15 (not (= 2 ~c_dr_st~0))) (.cse18 (not (= ~p_dw_st~0 0))) (.cse10 (< 1 ~q_free~0)) (.cse6 (not (= 0 ~q_req_up~0))) (.cse9 (= ~p_dw_pc~0 1)) (.cse16 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse19 (not (= ~q_read_ev~0 1))) (.cse5 (= 0 is_do_read_c_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse5 .cse3 .cse9 .cse10 .cse7 .cse11) (or .cse2 .cse1 (= 1 ~q_write_ev~0) .cse12 (= 0 ~q_write_ev~0) .cse5 .cse13 .cse14 .cse15 .cse4 .cse6 .cse7) (or (or .cse16 (or .cse0 (or (or .cse1 .cse2 .cse8 .cse15 .cse10) .cse6) .cse7)) .cse5) (or .cse2 .cse1 .cse0 .cse8 .cse15 .cse4 .cse5 .cse16 .cse10 .cse7 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse5 .cse7) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse17 ~q_free~0) .cse11 (< ~q_free~0 .cse17) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (= is_do_read_c_triggered_~__retres1~1 0) .cse18 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse2 .cse1 .cse12 .cse13 .cse0 .cse5 .cse14 .cse15 .cse4 .cse7) (or (or .cse0 (or (or .cse1 .cse2 .cse8 .cse3 .cse10) .cse6) .cse7) .cse19 .cse16 .cse5) (or .cse1 .cse2 .cse5 .cse3 .cse20) (or (or .cse0 (or .cse1 .cse2 .cse8 .cse15 .cse18 .cse10 .cse6) (not .cse9) .cse16) .cse19 .cse5)))) [2018-12-09 12:24:49,027 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-12-09 12:24:49,027 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-09 12:24:49,027 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-12-09 12:24:49,027 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-12-09 12:24:49,027 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-12-09 12:24:49,027 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~q_free~0 0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (and .cse5 .cse0 .cse6 .cse7)) (.cse10 (= ~q_req_up~0 0)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse17 (not .cse15)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (and .cse12 .cse13 .cse1 .cse14 .cse10 .cse15 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse12 .cse13 (and .cse1 .cse14 .cse2) .cse15) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse17 .cse10 .cse6) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-12-09 12:24:49,027 INFO L448 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-12-09 12:24:49,028 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1)) (.cse11 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse19 (+ ~c_num_read~0 1))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= .cse19 ~p_num_write~0)) (.cse15 (and .cse11 .cse0 .cse7 .cse8)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~p_dw_st~0)) (.cse18 (not .cse6)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse12 (<= 1 ~q_free~0)) (.cse17 (= ~p_dw_st~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 1 ~c_dr_pc~0) .cse7 .cse8)) (and .cse3 .cse4 (and .cse9 .cse10 .cse11 .cse7 .cse8 .cse12) .cse13) (and .cse13 (and .cse3 .cse4 .cse9 .cse5 .cse11 .cse7 .cse12)) (and .cse3 .cse4 (and .cse14 .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse4 .cse6 .cse13 (and .cse9 .cse10 .cse17 .cse11 .cse7 .cse8 .cse12)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse1 .cse2 (and .cse3 .cse15 .cse4) .cse6) (and (not (= ~c_dr_pc~0 1)) .cse14 .cse7) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse14 .cse3 .cse4 .cse18 .cse5 .cse7) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (and .cse6 .cse13 (and .cse4 (and .cse9 .cse5 .cse17 .cse11 .cse7 .cse8 .cse12))) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse14 .cse3 .cse18 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|)) (and .cse17 (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse5 .cse7 (= ~c_num_read~0 0) (<= .cse19 ~q_free~0) .cse9 .cse10 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0))))) [2018-12-09 12:24:49,028 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-09 12:24:49,030 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-12-09 12:24:49,031 INFO L444 ceAbstractionStarter]: At program point L409-1(lines 406 431) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1)) (.cse11 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 ~q_read_ev~0)) (.cse19 (+ ~c_num_read~0 1))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= .cse19 ~p_num_write~0)) (.cse15 (and .cse11 .cse0 .cse7 .cse8)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~p_dw_st~0)) (.cse18 (not .cse6)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse12 (<= 1 ~q_free~0)) (.cse17 (= ~p_dw_st~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 1 ~c_dr_pc~0) .cse7 .cse8)) (and .cse3 .cse4 (and .cse9 .cse10 .cse11 .cse7 .cse8 .cse12) .cse13) (and .cse13 (and .cse3 .cse4 .cse9 .cse5 .cse11 .cse7 .cse12)) (and .cse3 .cse4 (and .cse14 .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse4 .cse6 .cse13 (and .cse9 .cse10 .cse17 .cse11 .cse7 .cse8 .cse12)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse1 .cse2 (and .cse3 .cse15 .cse4) .cse6) (and (not (= ~c_dr_pc~0 1)) .cse14 .cse7) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse14 .cse3 .cse4 .cse18 .cse5 .cse7) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (and .cse6 .cse13 (and .cse4 (and .cse9 .cse5 .cse17 .cse11 .cse7 .cse8 .cse12))) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse14 .cse3 .cse18 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|)) (and .cse17 (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse5 .cse7 (= ~c_num_read~0 0) (<= .cse19 ~q_free~0) .cse9 .cse10 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0))))) [2018-12-09 12:24:49,031 INFO L444 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-09 12:24:49,031 INFO L444 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-09 12:24:49,036 INFO L451 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-12-09 12:24:49,036 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-12-09 12:24:49,037 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-09 12:24:49,037 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~q_read_ev~0 1)) (.cse14 (and .cse5 .cse0 .cse6 .cse7)) (.cse12 (= ~q_free~0 0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse10 (= ~q_req_up~0 0)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse19 (not .cse15)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (and .cse12 .cse13 .cse1 .cse14 .cse10 .cse15 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (and .cse2 .cse3 .cse10 .cse15 .cse9 .cse17 .cse5 .cse6 .cse8) .cse18) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse1 .cse2 .cse9 (and .cse11 .cse3 .cse10 .cse6 .cse8) .cse18) (and .cse2 .cse15 .cse9 .cse17 .cse5 .cse6 .cse8 .cse3 .cse4 .cse18) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse12 .cse13 (and .cse1 .cse14 .cse2) .cse15) (and .cse12 .cse13 .cse1 .cse10 .cse15 (and (= 1 ~c_dr_pc~0) .cse6 .cse7) (= 1 ~q_write_ev~0)) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse19 .cse10 .cse6) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-12-09 12:24:49,037 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 395 437) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-09 12:24:49,040 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-09 12:24:49,040 INFO L444 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-09 12:24:49,041 INFO L444 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-09 12:24:49,041 INFO L444 ceAbstractionStarter]: At program point L402-1(line 402) the Hoare annotation is: (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (= ~p_dw_i~0 1)) (not (= 1 ~c_dr_i~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_req_up~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 0) (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse0 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (< |old(~q_free~0)| .cse0) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-09 12:24:49,043 INFO L444 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1)) (.cse11 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 ~q_read_ev~0))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse15 (and .cse11 .cse0 .cse7 .cse8)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse13 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~q_req_up~0 0)) (.cse17 (= ~p_dw_st~0 0)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~p_dw_st~0)) (.cse18 (not .cse6)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= 1 ~c_dr_pc~0) .cse7 .cse8)) (and .cse3 .cse4 (and .cse9 .cse10 .cse11 .cse7 .cse8 .cse12) .cse13) (and .cse13 (and .cse3 .cse4 .cse9 .cse5 .cse11 .cse7 .cse12)) (and .cse3 .cse4 (and .cse14 .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse4 .cse6 .cse13 (and .cse9 .cse10 .cse17 .cse11 .cse7 .cse8 .cse12)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse1 .cse2 (and .cse3 .cse15 .cse4) .cse6) (and (not (= ~c_dr_pc~0 1)) .cse14 .cse7) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse14 .cse3 .cse4 .cse18 .cse5 .cse7) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (and .cse6 .cse13 (and .cse4 (and .cse9 .cse5 .cse17 .cse11 .cse7 .cse8 .cse12))) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse14 .cse3 .cse18 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|))))) [2018-12-09 12:24:49,043 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse16 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ~q_free~0 0)) (.cse14 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse15 (and .cse5 .cse0 .cse6 .cse7)) (.cse10 (= ~q_req_up~0 0)) (.cse12 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse17 (not .cse16)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (< .cse12 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse13 .cse14 (and .cse1 .cse15 .cse2) .cse16) (and .cse13 .cse14 .cse1 .cse15 .cse10 .cse16) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse17 .cse10 .cse6) (< |old(~q_free~0)| .cse12) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-12-09 12:24:49,047 INFO L444 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse15 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~c_dr_st~0)) (.cse0 (= ~p_dw_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~q_read_ev~0))) (let ((.cse9 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~q_free~0 0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (and .cse5 .cse0 .cse6 .cse7)) (.cse10 (= ~q_req_up~0 0)) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse11 (not (= 0 ~c_dr_st~0))) (.cse1 (<= 2 ~p_dw_st~0)) (.cse17 (not .cse15)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~q_free~0))) (or (not .cse0) (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse9 (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8)) (and .cse1 .cse2 (and .cse11 .cse10 .cse6 .cse7)) (and .cse12 .cse13 .cse1 .cse14 .cse10 .cse15 (not (= 0 ~q_write_ev~0))) (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (and .cse12 .cse13 (and .cse1 .cse14 .cse2) .cse15) (and (not (= ~c_dr_pc~0 1)) .cse11 .cse6) (< |old(~q_free~0)| 1) (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) (and .cse11 .cse1 .cse2 .cse17 .cse10 .cse6) (< |old(~q_free~0)| .cse16) (not (= 2 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (and .cse11 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse8) (not (= 0 |old(~q_req_up~0)|))))) [2018-12-09 12:24:49,047 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse18 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse3 (not .cse12)) (.cse4 (not (= .cse18 ~p_num_write~0))) (.cse7 (not (= ~q_free~0 0))) (.cse11 (= 0 ~c_dr_st~0)) (.cse13 (not (= 0 ~q_req_up~0))) (.cse10 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse19)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (and .cse19 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse15 (< ~q_free~0 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse14 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse16 (< 1 ~q_free~0)) (.cse9 (< ~p_dw_st~0 2)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse6 .cse0 .cse1 .cse10 .cse11 .cse12 .cse13 .cse9) (or (or .cse6 .cse14 (or .cse0 .cse1 .cse15 .cse8 .cse16 .cse13) .cse9) .cse5) (or .cse6 .cse0 .cse15 .cse1 .cse10 .cse11 .cse12 .cse16 .cse9 .cse17) (or (= 1 ~c_dr_pc~0) .cse0 .cse1 .cse11 .cse10) (or .cse1 (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_read_ev~0 ~q_write_ev~0)) (not (= 0 ~c_num_read~0)) (< .cse18 ~q_free~0) .cse17 (< ~q_free~0 .cse18) .cse0 (not (= 2 |old(~q_write_ev~0)|)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_dw_st~0 0)) .cse13 (not (= 0 ~c_dr_pc~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5 .cse13 .cse9) (or .cse6 .cse0 .cse1 .cse11 .cse2 .cse13 .cse10 .cse9) (or .cse1 .cse0 .cse2 .cse5 .cse6 .cse15 .cse8 .cse14 .cse16 .cse9 .cse17)))) [2018-12-09 12:24:49,052 INFO L448 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-12-09 12:24:49,052 INFO L448 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-12-09 12:24:49,052 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-12-09 12:24:49,052 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~q_req_up~0 0)) (.cse17 (+ ~c_num_read~0 1)) (.cse22 (= ~p_dw_pc~0 1)) (.cse24 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse15 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse19 (= 1 ~c_dr_pc~0)) (.cse21 (and .cse24 .cse15)) (.cse3 (not .cse22)) (.cse4 (not (= .cse17 ~p_num_write~0))) (.cse7 (not (= ~q_free~0 0))) (.cse20 (= 0 ~c_dr_st~0)) (.cse13 (not (= 0 |old(~q_req_up~0)|))) (.cse23 (and .cse24 .cse14 .cse15)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= |old(~q_read_ev~0)| 2))) (.cse5 (and .cse15 .cse16)) (.cse6 (< |old(~q_write_ev~0)| 2)) (.cse11 (< ~q_free~0 1)) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse10 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (< 1 ~q_free~0)) (.cse9 (< ~p_dw_st~0 2)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (or .cse6 .cse10 (or .cse0 .cse1 .cse11 .cse8 .cse12 .cse13) .cse9) (and (and .cse14 .cse15) .cse16)) (or .cse1 (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse14 (= ~q_read_ev~0 ~q_write_ev~0)) (not (= 0 ~c_num_read~0)) (< .cse17 ~q_free~0) .cse18 (< ~q_free~0 .cse17) .cse0 (not (= 2 |old(~q_write_ev~0)|)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_dw_st~0 0)) .cse13 (not (= 0 ~c_dr_pc~0))) (or .cse19 .cse0 .cse1 .cse14 .cse20 .cse13) (or .cse6 .cse0 .cse11 .cse1 .cse21 .cse20 .cse22 .cse12 .cse9 .cse18) (or .cse19 .cse0 .cse1 .cse20 .cse21) (or .cse6 .cse0 .cse1 .cse23 .cse20 .cse22 .cse13 .cse9) (or .cse1 .cse0 .cse2 .cse3 .cse4 (= 0 |old(~q_write_ev~0)|) .cse7 .cse8 (and .cse14 .cse15 .cse16) .cse13 .cse9) (or .cse6 .cse0 .cse1 .cse20 .cse2 .cse13 .cse23 .cse9) (or .cse1 .cse0 .cse2 .cse5 .cse6 .cse11 .cse8 .cse10 .cse12 .cse9 .cse18)))) [2018-12-09 12:24:49,053 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-12-09 12:24:49,054 INFO L444 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse20 (+ ~c_num_read~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse6 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse7 (< ~q_free~0 1)) (.cse9 (< 1 ~q_free~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse16 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse12)) (.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse5 (< |old(~q_write_ev~0)| 2)) (.cse3 (= 0 ~c_dr_st~0)) (.cse11 (not (= |old(~q_read_ev~0)| 2))) (.cse17 (not .cse15)) (.cse18 (not (= .cse20 ~p_num_write~0))) (.cse19 (not (= ~q_free~0 0))) (.cse8 (not (= 2 ~c_dr_st~0))) (.cse10 (< ~p_dw_st~0 2)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (or .cse1 .cse2 .cse7 .cse8 .cse9 .cse4) .cse10) (or .cse2 .cse1 .cse11 .cse5 .cse7 (and .cse12 .cse13) .cse8 .cse6 .cse9 .cse10 .cse14) (or .cse5 .cse1 .cse2 .cse3 .cse15 .cse4 .cse10) (or .cse5 .cse1 .cse7 .cse2 .cse16 .cse3 .cse15 .cse9 .cse10 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse16) (or .cse1 .cse2 (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse13) .cse11 .cse17 .cse18 .cse5 .cse19 .cse8 .cse10) (or .cse5 .cse1 .cse2 .cse3 .cse11 .cse4 .cse10) (or .cse2 .cse1 .cse11 .cse17 .cse18 (= 0 |old(~q_write_ev~0)|) .cse19 .cse8 .cse4 .cse10) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse20 ~q_free~0) .cse14 (< ~q_free~0 .cse20) .cse1 (not (= 2 |old(~q_write_ev~0)|)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_dw_st~0 0)) .cse4 (not (= 0 ~c_dr_pc~0)))))) [2018-12-09 12:24:49,054 INFO L448 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2018-12-09 12:24:49,055 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-12-09 12:24:49,055 INFO L444 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse11 (+ ~c_num_read~0 1)) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse7 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (= 1 ~c_dr_pc~0)) (.cse15 (not .cse18)) (.cse16 (not (= .cse11 ~p_num_write~0))) (.cse17 (not (= ~q_free~0 0))) (.cse5 (not (= 2 ~c_dr_st~0))) (.cse4 (< ~q_free~0 1)) (.cse8 (< 1 ~q_free~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (< ~q_write_ev~0 2)) (.cse6 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse14 (= 0 ~c_dr_st~0)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse12 (not (= 0 ~q_req_up~0))) (.cse9 (< ~p_dw_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (= is_do_write_p_triggered_~__retres1~0 0) (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse11 ~q_free~0) .cse10 (< ~q_free~0 .cse11) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (not (= ~p_dw_st~0 0)) .cse12 (not (= 0 ~c_dr_pc~0))) (or .cse13 .cse1 .cse0 .cse6 .cse14 .cse2) (or (or .cse3 .cse7 (or .cse1 .cse0 .cse4 (not .cse13) .cse5 .cse8 .cse12) .cse9) (= ~q_read_ev~0 1) .cse6) (or .cse13 .cse1 .cse0 (and (= 1 ~p_dw_pc~0) (not (= 0 ~q_read_ev~0))) .cse14 .cse6) (or .cse6 .cse0 .cse1 .cse2 .cse15 .cse16 .cse3 .cse17 .cse5 .cse9) (or .cse3 .cse1 .cse0 .cse14 .cse6 .cse18 .cse12 .cse9) (or .cse0 .cse1 .cse6 .cse2 .cse15 .cse16 (= 0 ~q_write_ev~0) .cse17 .cse5 .cse12 .cse9) (or .cse3 .cse1 .cse4 .cse0 .cse14 .cse6 .cse18 .cse8 .cse9 .cse10) (or .cse3 .cse6 .cse1 .cse0 .cse14 .cse2 .cse12 .cse9)))) [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-12-09 12:24:49,055 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-12-09 12:24:49,056 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-12-09 12:24:49,056 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-12-09 12:24:49,057 INFO L444 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse2 (+ |old(~c_num_read~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= ~q_read_ev~0 2))) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse8 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse6) (or (or (< ~q_write_ev~0 2) (or (or .cse3 .cse0 (not (= 1 |old(~c_dr_pc~0)|))) .cse5 .cse7) .cse8) .cse9 .cse10 (not (= .cse2 ~p_num_write~0))) (or .cse0 .cse3 .cse7 .cse10 .cse4 .cse9 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse6 .cse8))) [2018-12-09 12:24:49,057 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-12-09 12:24:49,057 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse6 (not (= ~q_read_ev~0 2))) (.cse13 (< ~p_dw_st~0 2)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse3 (= ~q_free~0 0)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= 0 ~c_dr_st~0))) (.cse1 (= ~c_dr_pc~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (not (= ~p_dw_i~0 1))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (+ |old(~c_num_read~0)| 1)) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse8 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse10 (= 0 |old(~c_dr_st~0)|)) (.cse12 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 1 ~p_num_write~0)) .cse11 .cse12 .cse13) (or (or (< ~q_write_ev~0 2) (or (or .cse5 .cse4 (not (= 1 |old(~c_dr_pc~0)|))) .cse10 .cse6) .cse13) .cse9 (and .cse3 (= |old(~c_num_read~0)| ~c_num_read~0) (and .cse0 (= 1 ~c_dr_pc~0))) .cse7 (not (= .cse14 ~p_num_write~0))) (or (and .cse0 .cse1 (= ~q_req_up~0 0) .cse2 (<= (+ ~c_num_read~0 1) ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0)) .cse4 (not (= 1 ~c_dr_i~0)) .cse11 (< .cse14 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse14) .cse5 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse8 .cse10 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse12))) [2018-12-09 12:24:49,057 INFO L448 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-12-09 12:24:49,057 INFO L444 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse14 (< ~p_dw_st~0 2)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse3 (not (= ~p_dw_pc~0 1))) (.cse7 (<= 1 ~q_free~0)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (+ |old(~c_num_read~0)| 1)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (= 2 ~c_dr_st~0)) (.cse8 (= 1 ~c_dr_pc~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse13 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 (= ~c_num_read~0 1) .cse7 .cse8 .cse9 .cse10) .cse11 (not (= 1 ~p_num_write~0)) .cse12 .cse13 .cse14) (or (or (< ~q_write_ev~0 2) (or (or .cse1 .cse0 (not (= 1 |old(~c_dr_pc~0)|))) .cse11 .cse2) .cse14) .cse5 .cse3 (not (= .cse15 ~p_num_write~0)) (and (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse8 .cse7 .cse9 .cse10)) (or .cse0 (not (= 1 ~c_dr_i~0)) .cse12 (< .cse15 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse15) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 (and .cse6 (= |old(~c_num_read~0)| ~c_num_read~0) (= ~q_req_up~0 0) .cse8 (<= (+ ~c_num_read~0 1) ~q_free~0) .cse9 .cse10) .cse11 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse13))) [2018-12-09 12:24:49,058 INFO L444 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse2 (+ |old(~c_num_read~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= ~q_read_ev~0 2))) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse8 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse6) (or (or (< ~q_write_ev~0 2) (or (or .cse3 .cse0 (not (= 1 |old(~c_dr_pc~0)|))) .cse5 .cse7) .cse8) .cse9 .cse10 (not (= .cse2 ~p_num_write~0))) (or .cse0 .cse3 .cse7 .cse10 .cse4 .cse9 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse6 .cse8))) [2018-12-09 12:24:49,058 INFO L444 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse2 (+ |old(~c_num_read~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~q_read_ev~0 2))) (.cse15 (not (= ~p_dw_pc~0 1))) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (not (= 0 ~c_dr_st~0))) (.cse16 (<= 1 ~q_free~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (= 0 |old(~c_dr_pc~0)|))) (.cse13 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (and .cse6 .cse7 (= ~q_req_up~0 0) .cse8 (<= (+ ~c_num_read~0 1) ~q_free~0) .cse9 .cse10) (not (= 0 |old(~q_req_up~0)|)) .cse11) (or (or (< ~q_write_ev~0 2) (or (or .cse3 .cse0 (not (= 1 |old(~c_dr_pc~0)|))) .cse5 .cse12) .cse13) .cse14 .cse15 (not (= .cse2 ~p_num_write~0)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) .cse16 .cse9 .cse10)) (or .cse0 .cse3 .cse12 .cse15 (and .cse6 .cse7 .cse8 (= ~q_free~0 0)) .cse4 (and .cse6 (= ~c_num_read~0 1) .cse16 .cse9 .cse10) .cse14 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse11 .cse13))) [2018-12-09 12:24:49,058 INFO L444 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse1 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (not (= 0 |old(~c_dr_pc~0)|))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse10 (< ~p_dw_st~0 2)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse2 (+ |old(~c_num_read~0)| 1))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) .cse1 (< .cse2 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse2) .cse3 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse5 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse6) (or .cse0 .cse3 .cse7 .cse8 .cse4 .cse9 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse6 .cse10) (or (or (< ~q_write_ev~0 2) (or (or .cse3 .cse0 (not (= 1 |old(~c_dr_pc~0)|))) .cse5 .cse7) .cse10) .cse9 (and (= ~q_free~0 0) (= |old(~c_num_read~0)| ~c_num_read~0) (and (not (= 0 ~c_dr_st~0)) (= 1 ~c_dr_pc~0))) .cse8 (not (= .cse2 ~p_num_write~0))))) [2018-12-09 12:24:49,059 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-12-09 12:24:49,059 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-12-09 12:24:49,059 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= ~q_buf_0~0 ~p_last_write~0)) (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= ~c_dr_pc~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 ~q_req_up~0)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 ~c_dr_st~0))) [2018-12-09 12:24:49,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:24:49 BoogieIcfgContainer [2018-12-09 12:24:49,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:24:49,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:24:49,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:24:49,090 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:24:49,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:23:15" (3/4) ... [2018-12-09 12:24:49,093 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 12:24:49,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-09 12:24:49,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-09 12:24:49,097 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-12-09 12:24:49,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-09 12:24:49,102 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-09 12:24:49,102 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 12:24:49,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || ((((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && q_req_up == 0) && p_dw_pc == 1) && (1 == c_dr_pc && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((2 <= p_dw_st && 2 <= q_write_ev) && ((((q_free <= 1 && c_last_read == p_last_write) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read == p_num_write)) || (c_num_read == p_num_write && (((((2 <= p_dw_st && 2 <= q_write_ev) && q_free <= 1) && q_req_up == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free)) || ((2 <= p_dw_st && 2 <= q_write_ev) && ((!(0 == c_dr_st) && q_req_up == 0) && p_last_write == q_buf_0) && 2 == q_read_ev)) || ((((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up == 0) && p_dw_pc == 1) && !(0 == q_write_ev))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_dw_pc) == 0)) || (((2 <= q_write_ev && p_dw_pc == 1) && c_num_read == p_num_write) && (((((q_free <= 1 && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(0 == \old(c_dr_pc))) || (((q_free == 0 && c_num_read + 1 == p_num_write) && (2 <= p_dw_st && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 <= q_write_ev) && p_dw_pc == 1)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || \old(q_free) < 1) || \old(p_num_write) + 1 < \old(q_free)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && q_req_up == 0) && p_last_write == q_buf_0)) || \old(q_free) < \old(c_num_read) + 1) || !(2 == \old(q_write_ev))) || ((p_dw_pc == 1 && c_num_read == p_num_write) && 2 <= q_write_ev && (((((q_free <= 1 && q_req_up == 0) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && !(p_dw_pc == 1)) && 2 <= q_write_ev) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free)) || !(0 == \old(q_req_up))) || (((((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write) [2018-12-09 12:24:49,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) && (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((((((((((!(p_dw_i == 1) || ((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == c_dr_i)) || (((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((p_dw_st == 2 && p_num_write == 1) && c_dr_pc == 0) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 1 <= tmp___1)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || ((((((((((p_dw_st == 0 && 2 == c_dr_st) && p_dw_pc == \old(p_dw_pc)) && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && 1 <= tmp___1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || (((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \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)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(1 == \old(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((p_dw_pc == 1 && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || (((((((((p_dw_pc == 1 && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1)) || ((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write)) || ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write)))))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) [2018-12-09 12:24:49,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) && (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write) || ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write)))))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \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)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(1 == \old(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((((((!(p_dw_i == 1) || ((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == c_dr_i)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) [2018-12-09 12:24:49,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write) || (!(\old(p_dw_pc) == 1) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)))) || !(c_num_read == \old(p_num_write))) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == q_write_ev)) || (((p_num_write == 1 && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && (((((((\old(q_free) < c_num_read + 1 || ((((\old(p_num_write) + 1 <= p_num_write && p_num_write <= 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || (!(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || ((((q_req_up == 0 && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= p_num_write + 1) && 0 == p_num_write)) || c_num_read + 1 < \old(q_free)) [2018-12-09 12:24:49,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write) || (!(\old(p_dw_pc) == 1) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)))) || !(c_num_read == \old(p_num_write))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((p_dw_st == 2 && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_last_write == q_buf_0)) && ((((((\old(q_free) < c_num_read + 1 || (!(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((2 <= p_dw_st && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || \old(p_num_write) + 1 < \old(q_free)) || c_num_read + 1 < \old(q_free))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_pc == \old(p_dw_pc)) || !(1 == \old(p_dw_pc))) [2018-12-09 12:24:49,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == c_dr_pc || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) && (((((((\old(q_free) < c_num_read + 1 || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= p_num_write + 1) && 0 == p_num_write)) || (!(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || \old(p_dw_pc) == 1) || c_num_read + 1 < \old(q_free))) && ((c_num_read == p_num_write && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) || (!(\old(p_dw_pc) == 1) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)))) || !(c_num_read == \old(p_num_write)))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || (((((p_last_write == q_buf_0 && p_dw_pc == 0) && q_req_up == 0) && c_num_read + 1 <= q_free) && q_free <= c_num_read + 1) && 0 == p_num_write)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) [2018-12-09 12:24:49,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || ((((((!(0 == c_dr_st) && c_dr_pc == 0) && q_req_up == 0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && ((((((q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || ((((!(0 == c_dr_st) && c_num_read == p_num_write) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_dr_pc == 0) && c_num_read == 0) && q_free == 0)) || !(q_read_ev == q_write_ev)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) [2018-12-09 12:24:49,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) && ((((((q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || (((((c_num_read == p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || ((((((2 == c_dr_st && \old(c_num_read) == c_num_read) && q_req_up == 0) && 1 == c_dr_pc) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) [2018-12-09 12:24:49,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2)) && ((((((q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || ((q_free == 0 && \old(c_num_read) == c_num_read) && !(0 == c_dr_st) && 1 == c_dr_pc)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) [2018-12-09 12:24:49,142 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c89bceb0-fe7c-4d54-bb75-39cb7c1e2329/bin-2019/utaipan/witness.graphml [2018-12-09 12:24:49,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:24:49,142 INFO L168 Benchmark]: Toolchain (without parser) took 93978.00 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 955.2 MB in the beginning and 981.6 MB in the end (delta: -26.4 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-09 12:24:49,143 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:24:49,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.76 ms. Allocated memory is still 1.0 GB. Free memory was 955.2 MB in the beginning and 939.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:24:49,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.68 ms. Allocated memory is still 1.0 GB. Free memory is still 939.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:24:49,143 INFO L168 Benchmark]: Boogie Preprocessor took 50.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:24:49,143 INFO L168 Benchmark]: RCFGBuilder took 252.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:24:49,143 INFO L168 Benchmark]: TraceAbstraction took 93449.62 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 981.6 MB in the end (delta: 91.1 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-09 12:24:49,143 INFO L168 Benchmark]: Witness Printer took 51.82 ms. Allocated memory is still 4.2 GB. Free memory is still 981.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:24:49,144 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.76 ms. Allocated memory is still 1.0 GB. Free memory was 955.2 MB in the beginning and 939.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.68 ms. Allocated memory is still 1.0 GB. Free memory is still 939.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93449.62 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 981.6 MB in the end (delta: 91.1 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 51.82 ms. Allocated memory is still 4.2 GB. Free memory is still 981.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2)) && ((((((q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || ((q_free == 0 && \old(c_num_read) == c_num_read) && !(0 == c_dr_st) && 1 == c_dr_pc)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write) || (!(\old(p_dw_pc) == 1) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)))) || !(c_num_read == \old(p_num_write))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((p_dw_st == 2 && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_last_write == q_buf_0)) && ((((((\old(q_free) < c_num_read + 1 || (!(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || (((((2 <= p_dw_st && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0)) || \old(p_num_write) + 1 < \old(q_free)) || c_num_read + 1 < \old(q_free))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_pc == \old(p_dw_pc)) || !(1 == \old(p_dw_pc))) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) && (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((((((((((!(p_dw_i == 1) || ((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == c_dr_i)) || (((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((p_dw_st == 2 && p_num_write == 1) && c_dr_pc == 0) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0) && 1 <= tmp___1)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || ((((((((((p_dw_st == 0 && 2 == c_dr_st) && p_dw_pc == \old(p_dw_pc)) && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && 1 <= tmp___1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || (((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \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)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(1 == \old(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((p_dw_pc == 1 && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) || (((((((((p_dw_pc == 1 && q_req_up == 0) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && p_dw_st == 0) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1)) || ((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write)) || ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write)))))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || 0 == __retres1) || !(c_num_read == p_num_write)) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write)) && ((((((((((((((!(p_dw_i == 1) || __retres1 == 0) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < q_free) || !(c_last_read == p_last_write)) || q_free < c_num_read + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(0 == c_dr_pc))) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || !(q_read_ev == 2))) && (((((q_write_ev < 2 || !(c_num_read == p_num_write)) || (((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || q_free < 1) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || q_read_ev == 1) || 0 == __retres1)) && (((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || (1 == p_dw_pc && !(0 == q_read_ev))) || 0 == c_dr_st) || 0 == __retres1)) && (((((((((0 == __retres1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(q_free == 0)) || !(2 == c_dr_st)) || p_dw_st < 2)) && (((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || 0 == __retres1) || p_dw_pc == 1) || !(0 == q_req_up)) || p_dw_st < 2)) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_num_read + 1 == p_num_write)) || 0 == q_write_ev) || !(q_free == 0)) || !(2 == c_dr_st)) || !(0 == q_req_up)) || p_dw_st < 2)) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == c_dr_st) || 0 == __retres1) || p_dw_pc == 1) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && (((((((q_write_ev < 2 || 0 == __retres1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(0 == q_req_up)) || p_dw_st < 2) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || (((((2 == c_dr_st && c_num_read == 1) && 1 <= q_free) && 1 == c_dr_pc) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) && ((((((q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || (((((c_num_read == p_num_write && 2 == c_dr_st) && 1 == c_dr_pc) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || ((((((2 == c_dr_st && \old(c_num_read) == c_num_read) && q_req_up == 0) && 1 == c_dr_pc) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || ((((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && q_req_up == 0) && p_dw_pc == 1) && (1 == c_dr_pc && p_last_write == q_buf_0) && 2 == q_read_ev)) || (((2 <= p_dw_st && 2 <= q_write_ev) && ((((q_free <= 1 && c_last_read == p_last_write) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free) && c_num_read == p_num_write)) || (c_num_read == p_num_write && (((((2 <= p_dw_st && 2 <= q_write_ev) && q_free <= 1) && q_req_up == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 1 <= q_free)) || ((2 <= p_dw_st && 2 <= q_write_ev) && ((!(0 == c_dr_st) && q_req_up == 0) && p_last_write == q_buf_0) && 2 == q_read_ev)) || ((((((q_free == 0 && c_num_read + 1 == p_num_write) && 2 <= p_dw_st) && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && q_req_up == 0) && p_dw_pc == 1) && !(0 == q_write_ev))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_dw_pc) == 0)) || (((2 <= q_write_ev && p_dw_pc == 1) && c_num_read == p_num_write) && (((((q_free <= 1 && c_last_read == p_last_write) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(0 == \old(c_dr_pc))) || (((q_free == 0 && c_num_read + 1 == p_num_write) && (2 <= p_dw_st && ((2 == c_dr_st && p_dw_i == 1) && p_last_write == q_buf_0) && 2 == q_read_ev) && 2 <= q_write_ev) && p_dw_pc == 1)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || \old(q_free) < 1) || \old(p_num_write) + 1 < \old(q_free)) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && 2 <= q_write_ev) && !(p_dw_pc == 1)) && q_req_up == 0) && p_last_write == q_buf_0)) || \old(q_free) < \old(c_num_read) + 1) || !(2 == \old(q_write_ev))) || ((p_dw_pc == 1 && c_num_read == p_num_write) && 2 <= q_write_ev && (((((q_free <= 1 && q_req_up == 0) && p_dw_st == 0) && 2 == c_dr_st) && p_last_write == q_buf_0) && 2 == q_read_ev) && 1 <= q_free)) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && !(p_dw_pc == 1)) && 2 <= q_write_ev) && q_free <= 1) && c_last_read == p_last_write) && p_last_write == q_buf_0) && 1 <= q_free)) || !(0 == \old(q_req_up))) || (((((((((((p_dw_st == 0 && c_dr_pc == 0) && p_dw_pc == \old(p_dw_pc)) && q_read_ev == \old(q_read_ev)) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && q_read_ev == q_write_ev) && 0 == p_num_write) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((1 == c_dr_pc || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == c_dr_st) && (((((((\old(q_free) < c_num_read + 1 || ((((p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= p_num_write + 1) && 0 == p_num_write)) || (!(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || \old(p_dw_pc) == 1) || c_num_read + 1 < \old(q_free))) && ((c_num_read == p_num_write && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) || (!(\old(p_dw_pc) == 1) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)))) || !(c_num_read == \old(p_num_write)))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || (((((p_last_write == q_buf_0 && p_dw_pc == 0) && q_req_up == 0) && c_num_read + 1 <= q_free) && q_free <= c_num_read + 1) && 0 == p_num_write)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_write_ev < 2 || (1 <= q_free && q_free <= 1)) || ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) && (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || ((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((2 <= p_dw_st && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1) && q_free == 0) && c_num_read + 1 == p_num_write) || ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) && (((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || (((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || !(\old(c_num_read) == \old(p_num_write)))))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || (((((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || q_write_ev < 2) || \old(q_free) < 1) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == \old(p_num_write))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(0 == \old(q_req_up))) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && p_dw_pc == 1) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((((2 <= p_dw_st && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || \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)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0))) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 2 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && ((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || ((((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 2 <= q_write_ev) && q_req_up == 0) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 2 == q_read_ev) && p_dw_i == 1)) || \old(p_dw_st) < 2)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || (c_num_read == 1 && p_num_write == 1)) || q_write_ev < 2) || \old(q_free) < 1) || 0 == \old(c_dr_st)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(1 == \old(c_num_read))) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((q_write_ev < 2 || 2 == c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2)) && (((((q_write_ev < 2 || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) == \old(p_num_write))) || (((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(q_free) < 1) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || \old(p_dw_st) < 2) || (((((((((2 <= p_dw_st && q_req_up == 0) && p_dw_pc == 1) && \old(p_num_write) == p_num_write) && c_num_read == p_num_write) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || 1 < \old(q_free)) || !(0 == \old(q_req_up))) || (1 <= q_free && q_free <= 1)) || q_write_ev < 2) || \old(p_dw_st) < 2)) && ((((((((((((((((!(p_dw_i == 1) || ((((((((2 <= p_dw_st && 2 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && p_num_write == 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free <= 1) && c_last_read == p_last_write)) || !(1 == c_dr_i)) || (((((((2 <= p_dw_st && 2 == c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= 1) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_num_read == 0) && q_free == 0)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == \old(p_last_write))) || \old(q_free) < \old(c_num_read) + 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == q_write_ev)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((!(c_dr_pc == 1) && !(0 == c_dr_st)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc)))) && ((((((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((!(0 == c_dr_st) && 2 <= p_dw_st) && p_dw_pc == \old(p_dw_pc)) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || 1 < \old(q_free)) || \old(p_dw_st) < 2) || !(\old(c_last_read) == \old(p_last_write))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write) || (!(\old(p_dw_pc) == 1) || (((((((q_write_ev < 2 || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) && (q_write_ev < 2 || !(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free)))) || !(c_num_read == \old(p_num_write))) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < \old(q_free)) || !(c_last_read == \old(p_last_write))) || !(0 == c_dr_st)) || \old(q_free) < c_num_read + 1) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && 0 == p_num_write)) || !(2 == q_write_ev)) || (((p_num_write == 1 && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(0 == \old(q_req_up))) || !(0 == c_dr_pc))) && ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && (((((((\old(q_free) < c_num_read + 1 || ((((\old(p_num_write) + 1 <= p_num_write && p_num_write <= 1) && p_dw_pc == \old(p_dw_pc)) && p_last_write == q_buf_0) && q_free == 0)) || (!(2 == c_dr_st) || (((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 1) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(0 == \old(q_req_up))) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || \old(p_num_write) + 1 < \old(q_free)) || ((((q_req_up == 0 && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && c_num_read + 1 <= q_free) && q_free <= p_num_write + 1) && 0 == p_num_write)) || c_num_read + 1 < \old(q_free)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(p_dw_st == 0)) || 1 == __retres1) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || 1 <= __retres1) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st))) && (((((((((((1 <= __retres1 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_num_read + 1 == p_num_write)) || q_write_ev < 2) || !(q_free == 0)) || !(0 == q_req_up)) || p_dw_st < 2) || !(0 == c_dr_st))) && (1 == __retres1 || (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(c_num_read == p_num_write)) || 1 < q_free) || !(c_last_read == p_last_write)) && (((q_write_ev < 2 || !(p_dw_pc == 1)) || ((((((!(q_buf_0 == p_last_write) || q_free < 1) || !(p_dw_i == 1)) || !(2 == c_dr_st)) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || 1 < q_free) || !(0 == q_req_up)) || !(c_num_read == p_num_write))))) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < q_free) || !(c_last_read == p_last_write)) || q_free < c_num_read + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(0 == c_dr_pc)) || 1 == __retres1)) && (((((((((((((q_free < c_num_read + 1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || 1 == __retres1) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || 1 < q_free) || !(0 == q_req_up)) || !(c_last_read == p_last_write)) || c_num_read + 1 < q_free) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || \old(c_num_read) + 1 < \old(q_free)) || !(\old(c_last_read) == p_last_write)) || \old(q_free) < \old(c_num_read) + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || ((((((!(0 == c_dr_st) && c_dr_pc == 0) && q_req_up == 0) && c_num_read == 0) && c_num_read + 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(0 == \old(c_dr_pc))) && ((((((q_write_ev < 2 || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || p_dw_st < 2) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(\old(c_num_read) + 1 == p_num_write)) || ((((!(0 == c_dr_st) && c_num_read == p_num_write) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write))) && ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || (((!(0 == c_dr_st) && c_dr_pc == 0) && c_num_read == 0) && q_free == 0)) || !(q_read_ev == q_write_ev)) || ((((!(0 == c_dr_st) && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) || !(0 == q_req_up)) || p_dw_st < 2) && (((((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || q_free < 1) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 1 == q_write_ev) || !(c_num_read + 1 == p_num_write)) || 0 == q_write_ev) || 0 == __retres1) || !(1 == p_dw_pc)) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || !(0 == q_req_up)) || p_dw_st < 2)) && ((!(c_num_read == p_num_write) || (q_write_ev < 2 || ((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || q_free < 1) || !(2 == c_dr_st)) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || 0 == __retres1)) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || q_write_ev < 2) || q_free < 1) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 0 == __retres1) || !(c_num_read == p_num_write)) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && (((((((q_write_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_pc == 1) || !(0 == q_req_up)) || 0 == __retres1) || p_dw_st < 2)) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || !(0 == c_num_read)) || c_num_read + 1 < q_free) || !(c_last_read == p_last_write)) || q_free < c_num_read + 1) || !(q_buf_0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || __retres1 == 0) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(0 == c_dr_pc))) && (((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(c_num_read + 1 == p_num_write)) || !(1 == p_dw_pc)) || q_write_ev < 2) || 0 == __retres1) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || p_dw_st < 2)) && (((((q_write_ev < 2 || ((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || q_free < 1) || 0 == c_dr_st) || 1 < q_free) || !(0 == q_req_up)) || p_dw_st < 2) || !(q_read_ev == 1)) || !(c_num_read == p_num_write)) || 0 == __retres1)) && ((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || 1 == c_dr_pc)) && (((((q_write_ev < 2 || (((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || q_free < 1) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || 1 < q_free) || !(0 == q_req_up)) || !(p_dw_pc == 1)) || !(c_num_read == p_num_write)) || !(q_read_ev == 1)) || 0 == __retres1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 130 locations, 1 error locations. SAFE Result, 93.3s OverallTime, 23 OverallIterations, 8 TraceHistogramMax, 21.3s AutomataDifference, 0.0s DeadEndRemovalTime, 58.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 5145 SDtfs, 8705 SDslu, 13373 SDs, 0 SdLazy, 12088 SolverSat, 3064 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3771 GetRequests, 3446 SyntacticMatches, 46 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19665occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 9 AbstIntIterations, 2 AbstIntStrong, 0.9829408920928772 AbsIntWeakeningRatio, 0.751269035532995 AbsIntAvgWeakeningVarsNumRemoved, 23.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 11614 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 47541 PreInvPairs, 51056 NumberOfFragments, 16967 HoareAnnotationTreeSize, 47541 FomulaSimplifications, 416372 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 56 FomulaSimplificationsInter, 350825 FormulaSimplificationTreeSizeReductionInter, 52.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 4851 NumberOfCodeBlocks, 4851 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 6447 ConstructedInterpolants, 0 QuantifiedInterpolants, 2162991 SizeOfPredicates, 10 NumberOfNonLiveVariables, 7630 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 4312/4591 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...