./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-5842f4b [2018-11-18 08:49:13,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:49:13,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:49:13,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:49:13,109 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:49:13,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:49:13,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:49:13,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:49:13,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:49:13,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:49:13,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:49:13,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:49:13,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:49:13,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:49:13,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:49:13,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:49:13,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:49:13,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:49:13,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:49:13,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:49:13,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:49:13,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:49:13,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:49:13,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:49:13,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:49:13,124 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:49:13,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:49:13,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:49:13,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:49:13,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:49:13,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:49:13,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:49:13,128 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:49:13,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:49:13,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:49:13,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:49:13,129 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 08:49:13,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:49:13,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:49:13,139 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:49:13,139 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 08:49:13,140 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 08:49:13,140 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 08:49:13,140 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 08:49:13,140 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 08:49:13,140 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 08:49:13,140 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 08:49:13,140 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 08:49:13,140 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 08:49:13,141 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 08:49:13,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:49:13,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:49:13,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:49:13,141 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:49:13,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:49:13,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:49:13,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:49:13,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:49:13,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:49:13,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:49:13,142 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:49:13,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:49:13,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:49:13,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:49:13,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:49:13,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:49:13,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:49:13,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:49:13,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:49:13,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:49:13,144 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 08:49:13,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:49:13,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:49:13,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 08:49:13,144 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_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:13,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:49:13,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:49:13,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:49:13,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:49:13,181 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:49:13,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 08:49:13,213 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/data/eb592bc65/c6b1bf4bf3dc4df4baad89ce44fbacbb/FLAG4df4ea45a [2018-11-18 08:49:13,608 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:49:13,609 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 08:49:13,613 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/data/eb592bc65/c6b1bf4bf3dc4df4baad89ce44fbacbb/FLAG4df4ea45a [2018-11-18 08:49:13,621 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/data/eb592bc65/c6b1bf4bf3dc4df4baad89ce44fbacbb [2018-11-18 08:49:13,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:49:13,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:49:13,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:49:13,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:49:13,627 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:49:13,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af2b395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13, skipping insertion in model container [2018-11-18 08:49:13,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:49:13,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:49:13,776 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:49:13,779 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:49:13,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:49:13,809 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:49:13,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13 WrapperNode [2018-11-18 08:49:13,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:49:13,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:49:13,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:49:13,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:49:13,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:49:13,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:49:13,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:49:13,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:49:13,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... [2018-11-18 08:49:13,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:49:13,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:49:13,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:49:13,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:49:13,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 08:49:13,926 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 08:49:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 08:49:13,926 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 08:49:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-11-18 08:49:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-11-18 08:49:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 08:49:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 08:49:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 08:49:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 08:49:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:49:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:49:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-18 08:49:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-18 08:49:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 08:49:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 08:49:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:49:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:49:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 08:49:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 08:49:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 08:49:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 08:49:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-18 08:49:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-18 08:49:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 08:49:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 08:49:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 08:49:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 08:49:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 08:49:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 08:49:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:49:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:49:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-18 08:49:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-18 08:49:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-18 08:49:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-18 08:49:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 08:49:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 08:49:14,224 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:49:14,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:14 BoogieIcfgContainer [2018-11-18 08:49:14,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:49:14,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:49:14,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:49:14,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:49:14,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:49:13" (1/3) ... [2018-11-18 08:49:14,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fd500b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:14, skipping insertion in model container [2018-11-18 08:49:14,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:13" (2/3) ... [2018-11-18 08:49:14,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fd500b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:14, skipping insertion in model container [2018-11-18 08:49:14,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:14" (3/3) ... [2018-11-18 08:49:14,230 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 08:49:14,236 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:49:14,241 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:49:14,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:49:14,280 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:49:14,280 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:49:14,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:49:14,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:49:14,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:49:14,280 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:49:14,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:49:14,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:49:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2018-11-18 08:49:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:49:14,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:14,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:14,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:14,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1325003296, now seen corresponding path program 1 times [2018-11-18 08:49:14,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:14,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:14,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:14,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:14,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:14,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:14,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:14,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:14,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:14,532 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 5 states. [2018-11-18 08:49:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:15,034 INFO L93 Difference]: Finished difference Result 392 states and 558 transitions. [2018-11-18 08:49:15,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:15,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 08:49:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:15,045 INFO L225 Difference]: With dead ends: 392 [2018-11-18 08:49:15,046 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 08:49:15,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 08:49:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 241. [2018-11-18 08:49:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 08:49:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 313 transitions. [2018-11-18 08:49:15,107 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 313 transitions. Word has length 80 [2018-11-18 08:49:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:15,108 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 313 transitions. [2018-11-18 08:49:15,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 313 transitions. [2018-11-18 08:49:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:49:15,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:15,110 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:15,111 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:15,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1834635040, now seen corresponding path program 1 times [2018-11-18 08:49:15,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:15,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:15,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:49:15,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:15,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:15,215 INFO L87 Difference]: Start difference. First operand 241 states and 313 transitions. Second operand 6 states. [2018-11-18 08:49:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:15,690 INFO L93 Difference]: Finished difference Result 650 states and 865 transitions. [2018-11-18 08:49:15,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:49:15,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 08:49:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:15,693 INFO L225 Difference]: With dead ends: 650 [2018-11-18 08:49:15,693 INFO L226 Difference]: Without dead ends: 436 [2018-11-18 08:49:15,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:49:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-18 08:49:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 371. [2018-11-18 08:49:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 08:49:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 487 transitions. [2018-11-18 08:49:15,732 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 487 transitions. Word has length 80 [2018-11-18 08:49:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:15,732 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 487 transitions. [2018-11-18 08:49:15,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 487 transitions. [2018-11-18 08:49:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:49:15,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:15,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:15,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:15,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:15,739 INFO L82 PathProgramCache]: Analyzing trace with hash -573717790, now seen corresponding path program 1 times [2018-11-18 08:49:15,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:15,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:15,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:49:15,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:15,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:15,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:15,804 INFO L87 Difference]: Start difference. First operand 371 states and 487 transitions. Second operand 6 states. [2018-11-18 08:49:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:15,866 INFO L93 Difference]: Finished difference Result 709 states and 932 transitions. [2018-11-18 08:49:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:15,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 08:49:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:15,869 INFO L225 Difference]: With dead ends: 709 [2018-11-18 08:49:15,869 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 08:49:15,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 08:49:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 376. [2018-11-18 08:49:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-18 08:49:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 490 transitions. [2018-11-18 08:49:15,894 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 490 transitions. Word has length 80 [2018-11-18 08:49:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:15,895 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 490 transitions. [2018-11-18 08:49:15,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 490 transitions. [2018-11-18 08:49:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:49:15,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:15,897 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:15,897 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:15,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1671861664, now seen corresponding path program 1 times [2018-11-18 08:49:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:15,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:15,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:15,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:15,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:15,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:15,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:15,962 INFO L87 Difference]: Start difference. First operand 376 states and 490 transitions. Second operand 4 states. [2018-11-18 08:49:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:16,100 INFO L93 Difference]: Finished difference Result 1027 states and 1355 transitions. [2018-11-18 08:49:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:16,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-18 08:49:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:16,105 INFO L225 Difference]: With dead ends: 1027 [2018-11-18 08:49:16,105 INFO L226 Difference]: Without dead ends: 694 [2018-11-18 08:49:16,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-11-18 08:49:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2018-11-18 08:49:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-11-18 08:49:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 855 transitions. [2018-11-18 08:49:16,137 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 855 transitions. Word has length 80 [2018-11-18 08:49:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:16,137 INFO L480 AbstractCegarLoop]: Abstraction has 672 states and 855 transitions. [2018-11-18 08:49:16,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 855 transitions. [2018-11-18 08:49:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:49:16,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:16,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:16,139 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:16,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:16,139 INFO L82 PathProgramCache]: Analyzing trace with hash -202033233, now seen corresponding path program 1 times [2018-11-18 08:49:16,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:16,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:16,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:16,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:16,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:49:16,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:16,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:16,190 INFO L87 Difference]: Start difference. First operand 672 states and 855 transitions. Second operand 6 states. [2018-11-18 08:49:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:16,264 INFO L93 Difference]: Finished difference Result 1322 states and 1681 transitions. [2018-11-18 08:49:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:16,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-18 08:49:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:16,269 INFO L225 Difference]: With dead ends: 1322 [2018-11-18 08:49:16,269 INFO L226 Difference]: Without dead ends: 693 [2018-11-18 08:49:16,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-11-18 08:49:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2018-11-18 08:49:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-18 08:49:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 867 transitions. [2018-11-18 08:49:16,304 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 867 transitions. Word has length 81 [2018-11-18 08:49:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:16,304 INFO L480 AbstractCegarLoop]: Abstraction has 687 states and 867 transitions. [2018-11-18 08:49:16,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 867 transitions. [2018-11-18 08:49:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:49:16,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:16,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:16,306 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:16,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash -596400019, now seen corresponding path program 1 times [2018-11-18 08:49:16,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:16,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:16,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:16,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:16,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:16,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:16,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:49:16,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:16,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:49:16,370 INFO L87 Difference]: Start difference. First operand 687 states and 867 transitions. Second operand 6 states. [2018-11-18 08:49:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:16,942 INFO L93 Difference]: Finished difference Result 1400 states and 1755 transitions. [2018-11-18 08:49:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:49:16,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-18 08:49:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:16,945 INFO L225 Difference]: With dead ends: 1400 [2018-11-18 08:49:16,946 INFO L226 Difference]: Without dead ends: 854 [2018-11-18 08:49:16,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:49:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-18 08:49:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 703. [2018-11-18 08:49:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-18 08:49:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 876 transitions. [2018-11-18 08:49:16,970 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 876 transitions. Word has length 81 [2018-11-18 08:49:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:16,970 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 876 transitions. [2018-11-18 08:49:16,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 876 transitions. [2018-11-18 08:49:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:49:16,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:16,971 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:16,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:16,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash 105199855, now seen corresponding path program 1 times [2018-11-18 08:49:16,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:16,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:16,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:17,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:17,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:49:17,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:17,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:49:17,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:49:17,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:49:17,006 INFO L87 Difference]: Start difference. First operand 703 states and 876 transitions. Second operand 3 states. [2018-11-18 08:49:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:17,056 INFO L93 Difference]: Finished difference Result 1944 states and 2474 transitions. [2018-11-18 08:49:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:49:17,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-18 08:49:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:17,060 INFO L225 Difference]: With dead ends: 1944 [2018-11-18 08:49:17,060 INFO L226 Difference]: Without dead ends: 1312 [2018-11-18 08:49:17,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:49:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-11-18 08:49:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1308. [2018-11-18 08:49:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2018-11-18 08:49:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1642 transitions. [2018-11-18 08:49:17,111 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1642 transitions. Word has length 81 [2018-11-18 08:49:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:17,111 INFO L480 AbstractCegarLoop]: Abstraction has 1308 states and 1642 transitions. [2018-11-18 08:49:17,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:49:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1642 transitions. [2018-11-18 08:49:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 08:49:17,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:17,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:17,114 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:17,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1911468664, now seen corresponding path program 1 times [2018-11-18 08:49:17,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:17,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:17,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:17,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:17,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:17,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:17,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:17,200 INFO L87 Difference]: Start difference. First operand 1308 states and 1642 transitions. Second operand 5 states. [2018-11-18 08:49:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:17,307 INFO L93 Difference]: Finished difference Result 3672 states and 4841 transitions. [2018-11-18 08:49:17,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:49:17,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-18 08:49:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:17,314 INFO L225 Difference]: With dead ends: 3672 [2018-11-18 08:49:17,314 INFO L226 Difference]: Without dead ends: 2381 [2018-11-18 08:49:17,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:49:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2018-11-18 08:49:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2288. [2018-11-18 08:49:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2288 states. [2018-11-18 08:49:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 2911 transitions. [2018-11-18 08:49:17,393 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 2911 transitions. Word has length 82 [2018-11-18 08:49:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:17,394 INFO L480 AbstractCegarLoop]: Abstraction has 2288 states and 2911 transitions. [2018-11-18 08:49:17,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2911 transitions. [2018-11-18 08:49:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 08:49:17,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:17,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:17,396 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:17,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1947190671, now seen corresponding path program 1 times [2018-11-18 08:49:17,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:17,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:17,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:17,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:17,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:17,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:49:17,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:17,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:17,446 INFO L87 Difference]: Start difference. First operand 2288 states and 2911 transitions. Second operand 5 states. [2018-11-18 08:49:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:17,873 INFO L93 Difference]: Finished difference Result 7220 states and 10005 transitions. [2018-11-18 08:49:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:17,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-18 08:49:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:17,887 INFO L225 Difference]: With dead ends: 7220 [2018-11-18 08:49:17,887 INFO L226 Difference]: Without dead ends: 5022 [2018-11-18 08:49:17,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2018-11-18 08:49:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4867. [2018-11-18 08:49:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2018-11-18 08:49:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6457 transitions. [2018-11-18 08:49:18,118 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 6457 transitions. Word has length 91 [2018-11-18 08:49:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:18,119 INFO L480 AbstractCegarLoop]: Abstraction has 4867 states and 6457 transitions. [2018-11-18 08:49:18,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 6457 transitions. [2018-11-18 08:49:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 08:49:18,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:18,121 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:18,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:18,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:18,121 INFO L82 PathProgramCache]: Analyzing trace with hash -373003328, now seen corresponding path program 1 times [2018-11-18 08:49:18,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:18,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:18,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:18,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:18,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:18,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:18,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:18,151 INFO L87 Difference]: Start difference. First operand 4867 states and 6457 transitions. Second operand 4 states. [2018-11-18 08:49:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:18,410 INFO L93 Difference]: Finished difference Result 6552 states and 8716 transitions. [2018-11-18 08:49:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:18,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-18 08:49:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:18,430 INFO L225 Difference]: With dead ends: 6552 [2018-11-18 08:49:18,430 INFO L226 Difference]: Without dead ends: 6549 [2018-11-18 08:49:18,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:49:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2018-11-18 08:49:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 6375. [2018-11-18 08:49:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6375 states. [2018-11-18 08:49:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 8467 transitions. [2018-11-18 08:49:18,653 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 8467 transitions. Word has length 93 [2018-11-18 08:49:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:18,654 INFO L480 AbstractCegarLoop]: Abstraction has 6375 states and 8467 transitions. [2018-11-18 08:49:18,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 8467 transitions. [2018-11-18 08:49:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 08:49:18,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:18,656 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:18,656 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:18,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1348547457, now seen corresponding path program 1 times [2018-11-18 08:49:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:18,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 08:49:18,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:18,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:18,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:18,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:18,691 INFO L87 Difference]: Start difference. First operand 6375 states and 8467 transitions. Second operand 4 states. [2018-11-18 08:49:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:18,964 INFO L93 Difference]: Finished difference Result 12418 states and 16501 transitions. [2018-11-18 08:49:18,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:18,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-18 08:49:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:18,980 INFO L225 Difference]: With dead ends: 12418 [2018-11-18 08:49:18,980 INFO L226 Difference]: Without dead ends: 6100 [2018-11-18 08:49:18,992 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2018-11-18 08:49:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 6100. [2018-11-18 08:49:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6100 states. [2018-11-18 08:49:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6100 states to 6100 states and 8100 transitions. [2018-11-18 08:49:19,195 INFO L78 Accepts]: Start accepts. Automaton has 6100 states and 8100 transitions. Word has length 94 [2018-11-18 08:49:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:19,196 INFO L480 AbstractCegarLoop]: Abstraction has 6100 states and 8100 transitions. [2018-11-18 08:49:19,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6100 states and 8100 transitions. [2018-11-18 08:49:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 08:49:19,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:19,197 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:19,197 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:19,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1321481855, now seen corresponding path program 1 times [2018-11-18 08:49:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:19,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:19,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:19,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:19,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:19,276 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-18 08:49:19,278 INFO L202 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [90], [96], [100], [103], [105], [109], [110], [113], [114], [126], [130], [136], [139], [142], [148], [151], [161], [164], [176], [186], [188], [190], [191], [192], [201], [207], [209], [232], [238], [240], [246], [248], [252], [262], [264], [266], [267], [268], [271], [282], [288], [296], [298], [301], [306], [317], [318], [319], [320], [321], [322], [323], [324], [325], [329], [330], [331], [332], [333], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [359], [360], [361], [363] [2018-11-18 08:49:19,301 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:19,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:19,470 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 08:49:19,471 INFO L272 AbstractInterpreter]: Visited 90 different actions 94 times. Merged at 3 different actions 3 times. Never widened. Performed 704 root evaluator evaluations with a maximum evaluation depth of 3. Performed 704 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-11-18 08:49:19,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:19,498 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 08:49:19,633 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 79.1% of their original sizes. [2018-11-18 08:49:19,633 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 08:49:19,872 INFO L415 sIntCurrentIteration]: We unified 93 AI predicates to 93 [2018-11-18 08:49:19,872 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 08:49:19,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:19,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2018-11-18 08:49:19,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:19,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 08:49:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 08:49:19,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-11-18 08:49:19,874 INFO L87 Difference]: Start difference. First operand 6100 states and 8100 transitions. Second operand 30 states. [2018-11-18 08:49:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:25,718 INFO L93 Difference]: Finished difference Result 18055 states and 24493 transitions. [2018-11-18 08:49:25,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 08:49:25,718 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-18 08:49:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:25,755 INFO L225 Difference]: With dead ends: 18055 [2018-11-18 08:49:25,755 INFO L226 Difference]: Without dead ends: 11974 [2018-11-18 08:49:25,769 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=434, Invalid=2016, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 08:49:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11974 states. [2018-11-18 08:49:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11974 to 11076. [2018-11-18 08:49:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2018-11-18 08:49:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 14792 transitions. [2018-11-18 08:49:26,198 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 14792 transitions. Word has length 94 [2018-11-18 08:49:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:26,198 INFO L480 AbstractCegarLoop]: Abstraction has 11076 states and 14792 transitions. [2018-11-18 08:49:26,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 08:49:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 14792 transitions. [2018-11-18 08:49:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 08:49:26,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:26,200 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:26,200 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:26,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:26,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1446710870, now seen corresponding path program 1 times [2018-11-18 08:49:26,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:26,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:26,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 08:49:26,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:26,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 08:49:26,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:26,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 08:49:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:49:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:26,267 INFO L87 Difference]: Start difference. First operand 11076 states and 14792 transitions. Second operand 7 states. [2018-11-18 08:49:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:28,037 INFO L93 Difference]: Finished difference Result 34962 states and 51312 transitions. [2018-11-18 08:49:28,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 08:49:28,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-18 08:49:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:28,126 INFO L225 Difference]: With dead ends: 34962 [2018-11-18 08:49:28,126 INFO L226 Difference]: Without dead ends: 21800 [2018-11-18 08:49:28,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-11-18 08:49:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21800 states. [2018-11-18 08:49:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21800 to 20322. [2018-11-18 08:49:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20322 states. [2018-11-18 08:49:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20322 states to 20322 states and 26504 transitions. [2018-11-18 08:49:29,497 INFO L78 Accepts]: Start accepts. Automaton has 20322 states and 26504 transitions. Word has length 104 [2018-11-18 08:49:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:29,497 INFO L480 AbstractCegarLoop]: Abstraction has 20322 states and 26504 transitions. [2018-11-18 08:49:29,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 08:49:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20322 states and 26504 transitions. [2018-11-18 08:49:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 08:49:29,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:29,498 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:29,499 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:29,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1825912664, now seen corresponding path program 1 times [2018-11-18 08:49:29,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:29,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:29,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:29,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 08:49:29,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:29,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:29,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-11-18 08:49:29,556 INFO L202 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [81], [84], [90], [96], [100], [103], [105], [109], [110], [113], [114], [126], [130], [136], [139], [142], [148], [151], [161], [164], [167], [176], [186], [188], [190], [191], [192], [201], [207], [209], [232], [238], [240], [246], [248], [252], [262], [264], [266], [267], [268], [271], [282], [288], [296], [298], [301], [306], [317], [318], [319], [320], [321], [322], [323], [324], [325], [329], [330], [331], [332], [333], [335], [336], [337], [338], [339], [340], [341], [342], [343], [344], [345], [359], [360], [361], [363] [2018-11-18 08:49:29,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:29,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:29,589 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 08:49:29,589 INFO L272 AbstractInterpreter]: Visited 92 different actions 104 times. Merged at 6 different actions 6 times. Never widened. Performed 852 root evaluator evaluations with a maximum evaluation depth of 3. Performed 852 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-11-18 08:49:29,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:29,598 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 08:49:29,664 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 79.93% of their original sizes. [2018-11-18 08:49:29,664 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 08:49:29,969 INFO L415 sIntCurrentIteration]: We unified 116 AI predicates to 116 [2018-11-18 08:49:29,970 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 08:49:29,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:29,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [8] total 45 [2018-11-18 08:49:29,970 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:29,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 08:49:29,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 08:49:29,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 08:49:29,971 INFO L87 Difference]: Start difference. First operand 20322 states and 26504 transitions. Second operand 39 states. [2018-11-18 08:49:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:35,378 INFO L93 Difference]: Finished difference Result 35795 states and 46596 transitions. [2018-11-18 08:49:35,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 08:49:35,378 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 117 [2018-11-18 08:49:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:35,426 INFO L225 Difference]: With dead ends: 35795 [2018-11-18 08:49:35,426 INFO L226 Difference]: Without dead ends: 15628 [2018-11-18 08:49:35,460 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 137 GetRequests, 79 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-11-18 08:49:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15628 states. [2018-11-18 08:49:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15628 to 11499. [2018-11-18 08:49:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11499 states. [2018-11-18 08:49:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11499 states to 11499 states and 14811 transitions. [2018-11-18 08:49:35,987 INFO L78 Accepts]: Start accepts. Automaton has 11499 states and 14811 transitions. Word has length 117 [2018-11-18 08:49:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:35,987 INFO L480 AbstractCegarLoop]: Abstraction has 11499 states and 14811 transitions. [2018-11-18 08:49:35,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 08:49:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 11499 states and 14811 transitions. [2018-11-18 08:49:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 08:49:35,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:35,995 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-18 08:49:35,995 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:35,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1980147113, now seen corresponding path program 1 times [2018-11-18 08:49:35,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:35,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 08:49:36,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:36,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:36,069 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-11-18 08:49:36,069 INFO L202 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], [90], [96], [100], [103], [105], [109], [110], [113], [114], [115], [117], [120], [124], [125], [126], [130], [136], [139], [142], [144], [148], [151], [154], [161], [164], [175], [176], [179], [182], [186], [188], [190], [191], [192], [201], [207], [209], [211], [213], [218], [223], [230], [232], [236], [238], [240], [243], [246], [248], [252], [262], [264], [266], [267], [268], [271], [273], [276], [282], [288], [292], [294], [296], [298], [301], [304], [306], [316], [317], [318], [319], [320], [321], [322], [323], [324], [325], [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], [358], [359], [360], [361], [363] [2018-11-18 08:49:36,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:36,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:36,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:49:36,240 INFO L272 AbstractInterpreter]: Visited 108 different actions 376 times. Merged at 25 different actions 108 times. Never widened. Performed 3494 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3494 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 25 fixpoints after 8 different actions. Largest state had 40 variables. [2018-11-18 08:49:36,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:36,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:49:36,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:36,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:36,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:36,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:49:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:36,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 08:49:36,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 08:49:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:49:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 10 [2018-11-18 08:49:36,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:49:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:49:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:49:36,719 INFO L87 Difference]: Start difference. First operand 11499 states and 14811 transitions. Second operand 3 states. [2018-11-18 08:49:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:37,059 INFO L93 Difference]: Finished difference Result 20618 states and 26867 transitions. [2018-11-18 08:49:37,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:49:37,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-11-18 08:49:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:37,078 INFO L225 Difference]: With dead ends: 20618 [2018-11-18 08:49:37,079 INFO L226 Difference]: Without dead ends: 9982 [2018-11-18 08:49:37,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 396 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-11-18 08:49:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9982 states. [2018-11-18 08:49:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9982 to 9979. [2018-11-18 08:49:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9979 states. [2018-11-18 08:49:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9979 states to 9979 states and 11974 transitions. [2018-11-18 08:49:37,421 INFO L78 Accepts]: Start accepts. Automaton has 9979 states and 11974 transitions. Word has length 197 [2018-11-18 08:49:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:37,421 INFO L480 AbstractCegarLoop]: Abstraction has 9979 states and 11974 transitions. [2018-11-18 08:49:37,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:49:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 9979 states and 11974 transitions. [2018-11-18 08:49:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 08:49:37,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:37,424 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:37,424 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:37,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash -460203412, now seen corresponding path program 1 times [2018-11-18 08:49:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:37,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 08:49:37,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:37,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:37,501 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-18 08:49:37,501 INFO L202 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], [90], [96], [100], [103], [105], [109], [110], [113], [114], [115], [117], [120], [124], [125], [126], [130], [136], [139], [142], [144], [148], [151], [154], [161], [164], [175], [176], [179], [182], [186], [188], [190], [191], [192], [201], [207], [209], [211], [213], [218], [223], [230], [232], [236], [238], [240], [243], [246], [248], [252], [255], [258], [262], [264], [266], [267], [268], [271], [273], [276], [282], [288], [292], [294], [296], [298], [301], [304], [306], [316], [317], [318], [319], [320], [321], [322], [323], [324], [325], [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], [358], [359], [360], [361], [363] [2018-11-18 08:49:37,504 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:37,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:38,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:49:38,005 INFO L272 AbstractInterpreter]: Visited 143 different actions 1758 times. Merged at 67 different actions 558 times. Widened at 1 different actions 1 times. Performed 17556 root evaluator evaluations with a maximum evaluation depth of 3. Performed 17556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 124 fixpoints after 17 different actions. Largest state had 40 variables. [2018-11-18 08:49:38,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:38,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:49:38,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:38,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:38,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:38,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:49:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:38,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 08:49:38,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 08:49:38,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 08:49:38,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 08:49:38,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 08:49:38,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 08:49:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:49:38,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-18 08:49:38,362 INFO L87 Difference]: Start difference. First operand 9979 states and 11974 transitions. Second operand 11 states. [2018-11-18 08:49:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:39,792 INFO L93 Difference]: Finished difference Result 29777 states and 36965 transitions. [2018-11-18 08:49:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 08:49:39,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-11-18 08:49:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:39,825 INFO L225 Difference]: With dead ends: 29777 [2018-11-18 08:49:39,825 INFO L226 Difference]: Without dead ends: 18768 [2018-11-18 08:49:39,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 402 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-11-18 08:49:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2018-11-18 08:49:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 17626. [2018-11-18 08:49:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17626 states. [2018-11-18 08:49:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17626 states to 17626 states and 20765 transitions. [2018-11-18 08:49:40,444 INFO L78 Accepts]: Start accepts. Automaton has 17626 states and 20765 transitions. Word has length 198 [2018-11-18 08:49:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:40,444 INFO L480 AbstractCegarLoop]: Abstraction has 17626 states and 20765 transitions. [2018-11-18 08:49:40,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 08:49:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 17626 states and 20765 transitions. [2018-11-18 08:49:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-18 08:49:40,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:40,449 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 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, 1] [2018-11-18 08:49:40,449 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:40,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:40,450 INFO L82 PathProgramCache]: Analyzing trace with hash 544280201, now seen corresponding path program 1 times [2018-11-18 08:49:40,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:40,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:40,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:40,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:40,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 08:49:40,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:40,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:40,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-11-18 08:49:40,539 INFO L202 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], [90], [96], [100], [103], [105], [109], [110], [113], [114], [115], [117], [120], [124], [125], [126], [130], [136], [139], [142], [144], [148], [151], [154], [161], [164], [170], [175], [176], [179], [182], [186], [188], [190], [191], [192], [201], [207], [209], [211], [213], [218], [223], [230], [232], [236], [238], [240], [243], [246], [248], [252], [255], [258], [262], [264], [266], [267], [268], [271], [273], [276], [282], [288], [292], [294], [298], [301], [306], [316], [317], [318], [319], [320], [321], [322], [323], [324], [325], [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], [358], [359], [360], [361], [363] [2018-11-18 08:49:40,541 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:40,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:40,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:49:40,832 INFO L272 AbstractInterpreter]: Visited 139 different actions 954 times. Merged at 40 different actions 203 times. Widened at 1 different actions 1 times. Performed 10348 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10348 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 57 fixpoints after 9 different actions. Largest state had 40 variables. [2018-11-18 08:49:40,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:40,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:49:40,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:40,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:40,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:40,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:49:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:40,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 08:49:40,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 08:49:41,157 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:49:41,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [9] total 11 [2018-11-18 08:49:41,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:41,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:49:41,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:49:41,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:49:41,158 INFO L87 Difference]: Start difference. First operand 17626 states and 20765 transitions. Second operand 3 states. [2018-11-18 08:49:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:41,718 INFO L93 Difference]: Finished difference Result 33696 states and 39966 transitions. [2018-11-18 08:49:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:49:41,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-18 08:49:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:41,746 INFO L225 Difference]: With dead ends: 33696 [2018-11-18 08:49:41,746 INFO L226 Difference]: Without dead ends: 17339 [2018-11-18 08:49:41,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 406 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-11-18 08:49:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17339 states. [2018-11-18 08:49:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17339 to 17204. [2018-11-18 08:49:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17204 states. [2018-11-18 08:49:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17204 states to 17204 states and 20186 transitions. [2018-11-18 08:49:42,380 INFO L78 Accepts]: Start accepts. Automaton has 17204 states and 20186 transitions. Word has length 205 [2018-11-18 08:49:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:42,380 INFO L480 AbstractCegarLoop]: Abstraction has 17204 states and 20186 transitions. [2018-11-18 08:49:42,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:49:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 17204 states and 20186 transitions. [2018-11-18 08:49:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-18 08:49:42,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:42,383 INFO L375 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, 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-11-18 08:49:42,383 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:42,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 58012655, now seen corresponding path program 1 times [2018-11-18 08:49:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:42,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:42,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:42,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:42,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 08:49:42,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:42,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:49:42,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:42,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:49:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:49:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:42,465 INFO L87 Difference]: Start difference. First operand 17204 states and 20186 transitions. Second operand 4 states. [2018-11-18 08:49:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:42,882 INFO L93 Difference]: Finished difference Result 25813 states and 30551 transitions. [2018-11-18 08:49:42,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:49:42,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-11-18 08:49:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:42,905 INFO L225 Difference]: With dead ends: 25813 [2018-11-18 08:49:42,905 INFO L226 Difference]: Without dead ends: 9560 [2018-11-18 08:49:42,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:49:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9560 states. [2018-11-18 08:49:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9560 to 9494. [2018-11-18 08:49:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9494 states. [2018-11-18 08:49:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 10804 transitions. [2018-11-18 08:49:43,333 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 10804 transitions. Word has length 206 [2018-11-18 08:49:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:43,333 INFO L480 AbstractCegarLoop]: Abstraction has 9494 states and 10804 transitions. [2018-11-18 08:49:43,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:49:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 10804 transitions. [2018-11-18 08:49:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-18 08:49:43,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:43,336 INFO L375 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, 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] [2018-11-18 08:49:43,336 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:43,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2043074778, now seen corresponding path program 1 times [2018-11-18 08:49:43,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:43,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-18 08:49:43,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:43,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:43,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-11-18 08:49:43,586 INFO L202 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], [90], [96], [100], [103], [105], [109], [110], [113], [114], [115], [117], [120], [124], [125], [126], [130], [136], [139], [142], [144], [148], [151], [154], [157], [161], [164], [170], [175], [176], [179], [182], [186], [188], [190], [191], [192], [201], [207], [209], [211], [213], [218], [223], [232], [236], [238], [240], [243], [246], [248], [252], [255], [260], [262], [264], [266], [267], [268], [271], [273], [276], [282], [288], [292], [294], [298], [301], [306], [316], [317], [318], [319], [320], [321], [322], [323], [324], [325], [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], [358], [359], [360], [361], [363] [2018-11-18 08:49:43,587 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:43,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:44,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:49:44,275 INFO L272 AbstractInterpreter]: Visited 141 different actions 1560 times. Merged at 63 different actions 409 times. Widened at 1 different actions 1 times. Performed 15511 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15511 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 119 fixpoints after 21 different actions. Largest state had 40 variables. [2018-11-18 08:49:44,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:44,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:49:44,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:44,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:44,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:44,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:49:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:44,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 32 proven. 73 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 08:49:44,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-18 08:49:44,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 08:49:44,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2018-11-18 08:49:44,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 08:49:44,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 08:49:44,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 08:49:44,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-18 08:49:44,785 INFO L87 Difference]: Start difference. First operand 9494 states and 10804 transitions. Second operand 13 states. [2018-11-18 08:49:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:46,376 INFO L93 Difference]: Finished difference Result 19033 states and 22005 transitions. [2018-11-18 08:49:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 08:49:46,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 207 [2018-11-18 08:49:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:46,403 INFO L225 Difference]: With dead ends: 19033 [2018-11-18 08:49:46,403 INFO L226 Difference]: Without dead ends: 19030 [2018-11-18 08:49:46,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 404 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-11-18 08:49:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19030 states. [2018-11-18 08:49:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19030 to 18500. [2018-11-18 08:49:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18500 states. [2018-11-18 08:49:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18500 states to 18500 states and 21315 transitions. [2018-11-18 08:49:47,137 INFO L78 Accepts]: Start accepts. Automaton has 18500 states and 21315 transitions. Word has length 207 [2018-11-18 08:49:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:47,137 INFO L480 AbstractCegarLoop]: Abstraction has 18500 states and 21315 transitions. [2018-11-18 08:49:47,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 08:49:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 18500 states and 21315 transitions. [2018-11-18 08:49:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 08:49:47,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:47,140 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 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] [2018-11-18 08:49:47,140 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:47,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:47,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2080268162, now seen corresponding path program 2 times [2018-11-18 08:49:47,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:47,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:47,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-18 08:49:47,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:49:47,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:49:47,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:47,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:49:47,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:49:47,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:49:47,196 INFO L87 Difference]: Start difference. First operand 18500 states and 21315 transitions. Second operand 3 states. [2018-11-18 08:49:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:47,820 INFO L93 Difference]: Finished difference Result 31479 states and 36459 transitions. [2018-11-18 08:49:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:49:47,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-18 08:49:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:47,846 INFO L225 Difference]: With dead ends: 31479 [2018-11-18 08:49:47,847 INFO L226 Difference]: Without dead ends: 18059 [2018-11-18 08:49:47,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:49:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2018-11-18 08:49:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 17736. [2018-11-18 08:49:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17736 states. [2018-11-18 08:49:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17736 states to 17736 states and 20170 transitions. [2018-11-18 08:49:48,504 INFO L78 Accepts]: Start accepts. Automaton has 17736 states and 20170 transitions. Word has length 211 [2018-11-18 08:49:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:48,504 INFO L480 AbstractCegarLoop]: Abstraction has 17736 states and 20170 transitions. [2018-11-18 08:49:48,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:49:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17736 states and 20170 transitions. [2018-11-18 08:49:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-18 08:49:48,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:48,508 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-18 08:49:48,508 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:48,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:48,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1091385389, now seen corresponding path program 1 times [2018-11-18 08:49:48,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:48,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:48,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:49:48,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:48,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-11-18 08:49:48,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:48,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:48,580 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-11-18 08:49:48,580 INFO L202 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], [90], [96], [100], [103], [105], [109], [110], [113], [114], [115], [117], [120], [124], [125], [126], [130], [136], [139], [142], [144], [148], [151], [157], [161], [164], [167], [175], [176], [179], [182], [186], [188], [190], [191], [192], [201], [207], [209], [211], [213], [218], [223], [232], [236], [238], [240], [243], [246], [248], [252], [255], [260], [262], [264], [266], [267], [268], [271], [273], [276], [282], [288], [292], [294], [296], [298], [301], [304], [306], [316], [317], [318], [319], [320], [321], [322], [323], [324], [325], [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], [358], [359], [360], [361], [363] [2018-11-18 08:49:48,582 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:48,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:49,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:49:49,040 INFO L272 AbstractInterpreter]: Visited 142 different actions 1918 times. Merged at 62 different actions 633 times. Widened at 1 different actions 1 times. Performed 16190 root evaluator evaluations with a maximum evaluation depth of 3. Performed 16190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 200 fixpoints after 21 different actions. Largest state had 40 variables. [2018-11-18 08:49:49,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:49,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:49:49,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:49,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:49,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:49,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:49:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:49,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-18 08:49:49,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-18 08:49:49,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:49:49,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2018-11-18 08:49:49,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:49,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:49:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:49:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:49:49,377 INFO L87 Difference]: Start difference. First operand 17736 states and 20170 transitions. Second operand 6 states. [2018-11-18 08:49:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:49,946 INFO L93 Difference]: Finished difference Result 29066 states and 33614 transitions. [2018-11-18 08:49:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:49:49,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 287 [2018-11-18 08:49:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:49,970 INFO L225 Difference]: With dead ends: 29066 [2018-11-18 08:49:49,971 INFO L226 Difference]: Without dead ends: 11439 [2018-11-18 08:49:49,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 568 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-11-18 08:49:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11439 states. [2018-11-18 08:49:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11439 to 8798. [2018-11-18 08:49:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8798 states. [2018-11-18 08:49:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8798 states to 8798 states and 9992 transitions. [2018-11-18 08:49:50,355 INFO L78 Accepts]: Start accepts. Automaton has 8798 states and 9992 transitions. Word has length 287 [2018-11-18 08:49:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:50,356 INFO L480 AbstractCegarLoop]: Abstraction has 8798 states and 9992 transitions. [2018-11-18 08:49:50,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:49:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 8798 states and 9992 transitions. [2018-11-18 08:49:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-18 08:49:50,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:50,359 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:50,359 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:50,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2019209883, now seen corresponding path program 1 times [2018-11-18 08:49:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:50,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:50,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:50,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:50,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 58 proven. 7 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-18 08:49:50,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:50,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:50,446 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2018-11-18 08:49:50,447 INFO L202 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], [90], [96], [100], [103], [105], [109], [110], [113], [114], [115], [117], [120], [124], [125], [126], [130], [136], [139], [142], [144], [148], [151], [161], [164], [170], [175], [176], [179], [182], [184], [186], [188], [190], [191], [192], [201], [207], [209], [211], [213], [218], [223], [230], [232], [236], [238], [240], [243], [246], [248], [252], [255], [258], [262], [264], [266], [267], [268], [271], [273], [276], [282], [288], [292], [294], [296], [298], [301], [304], [306], [316], [317], [318], [319], [320], [321], [322], [323], [324], [325], [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], [358], [359], [360], [361], [363] [2018-11-18 08:49:50,448 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:50,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:51,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:49:51,062 INFO L272 AbstractInterpreter]: Visited 148 different actions 2507 times. Merged at 81 different actions 934 times. Widened at 1 different actions 3 times. Performed 21523 root evaluator evaluations with a maximum evaluation depth of 3. Performed 21523 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 240 fixpoints after 27 different actions. Largest state had 40 variables. [2018-11-18 08:49:51,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:51,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:49:51,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:51,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:51,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:51,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:49:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:51,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 08:49:51,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 82 proven. 7 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 08:49:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 08:49:51,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-18 08:49:51,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 08:49:51,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 08:49:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:49:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:49:51,512 INFO L87 Difference]: Start difference. First operand 8798 states and 9992 transitions. Second operand 8 states. [2018-11-18 08:49:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:52,147 INFO L93 Difference]: Finished difference Result 13803 states and 15831 transitions. [2018-11-18 08:49:52,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 08:49:52,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 307 [2018-11-18 08:49:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:52,156 INFO L225 Difference]: With dead ends: 13803 [2018-11-18 08:49:52,156 INFO L226 Difference]: Without dead ends: 5548 [2018-11-18 08:49:52,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 609 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-11-18 08:49:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-11-18 08:49:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5382. [2018-11-18 08:49:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5382 states. [2018-11-18 08:49:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 6106 transitions. [2018-11-18 08:49:52,419 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 6106 transitions. Word has length 307 [2018-11-18 08:49:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:52,419 INFO L480 AbstractCegarLoop]: Abstraction has 5382 states and 6106 transitions. [2018-11-18 08:49:52,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 08:49:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 6106 transitions. [2018-11-18 08:49:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-18 08:49:52,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:49:52,422 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:49:52,422 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:49:52,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1925059715, now seen corresponding path program 1 times [2018-11-18 08:49:52,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:49:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:49:52,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:49:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-18 08:49:52,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:52,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:49:52,517 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2018-11-18 08:49:52,517 INFO L202 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], [90], [96], [100], [103], [105], [109], [110], [113], [114], [115], [117], [120], [124], [125], [126], [130], [136], [139], [142], [144], [148], [151], [154], [157], [161], [164], [170], [175], [176], [179], [182], [186], [188], [190], [191], [192], [201], [207], [209], [211], [213], [218], [223], [232], [236], [238], [240], [243], [246], [248], [252], [255], [260], [262], [264], [266], [267], [268], [271], [273], [276], [282], [288], [292], [294], [298], [301], [304], [306], [316], [317], [318], [319], [320], [321], [322], [323], [324], [325], [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], [358], [359], [360], [361], [363] [2018-11-18 08:49:52,519 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:49:52,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:49:53,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:49:53,685 INFO L272 AbstractInterpreter]: Visited 142 different actions 2925 times. Merged at 63 different actions 992 times. Widened at 3 different actions 5 times. Performed 27117 root evaluator evaluations with a maximum evaluation depth of 3. Performed 27117 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 300 fixpoints after 20 different actions. Largest state had 40 variables. [2018-11-18 08:49:53,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:53,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:49:53,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:49:53,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/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-11-18 08:49:53,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:49:53,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:49:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:53,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:49:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-18 08:49:53,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-18 08:49:53,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:49:53,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2018-11-18 08:49:53,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:49:53,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:49:53,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:49:53,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:49:53,986 INFO L87 Difference]: Start difference. First operand 5382 states and 6106 transitions. Second operand 5 states. [2018-11-18 08:49:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:49:54,275 INFO L93 Difference]: Finished difference Result 6278 states and 7091 transitions. [2018-11-18 08:49:54,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:49:54,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 307 [2018-11-18 08:49:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:49:54,277 INFO L225 Difference]: With dead ends: 6278 [2018-11-18 08:49:54,277 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 08:49:54,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 611 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-11-18 08:49:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 08:49:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 08:49:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 08:49:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 08:49:54,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-11-18 08:49:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:49:54,283 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:49:54,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:49:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:49:54,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 08:49:54,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 08:49:54,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,782 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 182 [2018-11-18 08:49:54,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:54,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:55,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,822 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 185 [2018-11-18 08:49:56,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:56,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:57,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:58,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,389 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 200 [2018-11-18 08:49:59,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:49:59,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,297 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 200 [2018-11-18 08:50:00,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 08:50:00,832 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 83 [2018-11-18 08:50:01,654 WARN L180 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 109 [2018-11-18 08:50:02,251 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 103 [2018-11-18 08:50:04,162 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 354 DAG size of output: 168 [2018-11-18 08:50:05,630 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 340 DAG size of output: 108 [2018-11-18 08:50:05,931 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-11-18 08:50:06,892 WARN L180 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 122 [2018-11-18 08:50:08,161 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 383 DAG size of output: 101 [2018-11-18 08:50:08,924 WARN L180 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 109 [2018-11-18 08:50:09,129 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2018-11-18 08:50:09,794 WARN L180 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 111 [2018-11-18 08:50:10,054 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-11-18 08:50:10,310 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 1 [2018-11-18 08:50:11,307 WARN L180 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 99 [2018-11-18 08:50:12,192 WARN L180 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 91 [2018-11-18 08:50:12,404 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 1 [2018-11-18 08:50:12,647 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 61 [2018-11-18 08:50:13,336 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 109 [2018-11-18 08:50:13,828 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 100 [2018-11-18 08:50:14,299 WARN L180 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 98 [2018-11-18 08:50:15,442 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 322 DAG size of output: 99 [2018-11-18 08:50:16,929 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 321 DAG size of output: 154 [2018-11-18 08:50:17,398 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 100 [2018-11-18 08:50:18,688 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 364 DAG size of output: 109 [2018-11-18 08:50:19,677 WARN L180 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 89 [2018-11-18 08:50:21,536 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 354 DAG size of output: 168 [2018-11-18 08:50:21,907 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 357 DAG size of output: 1 [2018-11-18 08:50:22,742 WARN L180 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 117 [2018-11-18 08:50:23,318 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 1 [2018-11-18 08:50:24,923 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 367 DAG size of output: 158 [2018-11-18 08:50:25,591 WARN L180 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 89 [2018-11-18 08:50:26,803 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 353 DAG size of output: 92 [2018-11-18 08:50:27,033 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 92 [2018-11-18 08:50:28,093 WARN L180 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 129 [2018-11-18 08:50:28,926 WARN L180 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 117 [2018-11-18 08:50:29,531 WARN L180 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 102 [2018-11-18 08:50:29,755 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 93 [2018-11-18 08:50:30,615 WARN L180 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 99 [2018-11-18 08:50:30,743 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2018-11-18 08:50:31,002 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 95 [2018-11-18 08:50:31,080 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-11-18 08:50:31,081 INFO L425 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-11-18 08:50:31,081 INFO L425 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2018-11-18 08:50:31,081 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-11-18 08:50:31,081 INFO L421 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse19 (= 1 ~c_dr_pc~0)) (.cse11 (= 2 ~c_dr_st~0)) (.cse22 (not (= 0 ~c_dr_st~0))) (.cse25 (<= 2 ~p_dw_st~0)) (.cse23 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse15 (not .cse12)) (.cse17 (not (= .cse23 ~p_num_write~0))) (.cse18 (not (= ~q_free~0 0))) (.cse7 (and .cse22 .cse25)) (.cse20 (= ~p_dw_st~0 0)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse6 (not (= 0 ~q_req_up~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse16 (and .cse25 .cse11)) (.cse3 (not .cse19)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse0 (< ~q_write_ev~0 2)) (.cse9 (< ~q_free~0 1)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (< 1 ~q_free~0)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14) (or .cse2 .cse1 .cse3 .cse5 .cse15 .cse16 .cse17 (= 0 ~q_write_ev~0) .cse18 .cse10 .cse6 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse12 .cse13 .cse8 .cse14) (or .cse19 .cse1 .cse2 .cse20 .cse4 .cse21) (or .cse1 .cse2 .cse3 .cse5 .cse15 .cse17 .cse16 .cse0 .cse18 .cse10 .cse8) (or .cse19 .cse1 .cse2 .cse4 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse12 .cse6 .cse8) (or .cse2 (not (= 1 ~c_dr_i~0)) (and .cse20 (= ~c_dr_st~0 0)) (not (= 0 ~c_num_read~0)) (< .cse23 ~q_free~0) .cse14 (not .cse4) (< ~q_free~0 .cse23) .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)) .cse21 .cse6 (not (= 0 ~c_dr_pc~0))) (or (or .cse0 .cse24 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse13 .cse6) .cse8) .cse16) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8) (or .cse2 .cse1 .cse16 .cse3 .cse5 .cse0 .cse9 .cse10 .cse24 .cse13 .cse8 .cse14)))) [2018-11-18 08:50:31,082 INFO L421 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse26 (= 1 ~c_dr_pc~0)) (.cse11 (= 2 ~c_dr_st~0)) (.cse16 (= activate_threads_~tmp~1 0)) (.cse14 (+ ~c_num_read~0 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse25 (not (= 0 ~c_dr_st~0))) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse7 (and .cse25 .cse24)) (.cse20 (not .cse5)) (.cse21 (not (= .cse14 ~p_num_write~0))) (.cse22 (not (= ~q_free~0 0))) (.cse19 (and .cse24 .cse11 .cse16)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< ~q_free~0 1)) (.cse12 (< 1 ~q_free~0)) (.cse0 (< ~q_write_ev~0 2)) (.cse3 (not .cse26)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= 0 ~q_req_up~0))) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse18 (not (= ~q_read_ev~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)|)) (.cse17 (not (= |old(~p_dw_st~0)| 0))) (.cse15 (= ~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 .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse14 ~q_free~0) .cse13 (not .cse4) (< ~q_free~0 .cse14) (and .cse15 (= ~c_dr_st~0 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 .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse5 .cse12 .cse8 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse4 .cse18 .cse5 .cse16 .cse12 .cse8 .cse13) (or .cse2 .cse1 .cse3 .cse19 .cse18 .cse20 .cse21 .cse0 .cse22 .cse10 .cse8) (or .cse2 .cse1 .cse3 .cse18 .cse20 .cse21 (= 0 ~q_write_ev~0) .cse22 .cse10 .cse6 .cse19 .cse8) (or .cse2 .cse1 .cse3 .cse19 .cse18 .cse0 .cse9 .cse10 .cse23 .cse12 .cse8 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse18 .cse11 .cse6 .cse8) (or (or .cse0 .cse23 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse12 .cse6) .cse8) (and .cse24 .cse11) (and (and .cse15 .cse11) (= ~q_read_ev~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse6 (and .cse25 .cse24 .cse16) .cse8) (or .cse26 .cse1 .cse2 .cse4 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8) (or .cse26 .cse1 .cse2 .cse4 .cse18 .cse16) (or .cse26 .cse1 .cse2 .cse4 .cse17 .cse15)))) [2018-11-18 08:50:31,082 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse19 (= 1 ~c_dr_pc~0)) (.cse11 (= 2 ~c_dr_st~0)) (.cse22 (not (= 0 ~c_dr_st~0))) (.cse25 (<= 2 ~p_dw_st~0)) (.cse23 (+ ~c_num_read~0 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse15 (not .cse12)) (.cse17 (not (= .cse23 ~p_num_write~0))) (.cse18 (not (= ~q_free~0 0))) (.cse7 (and .cse22 .cse25)) (.cse20 (= ~p_dw_st~0 0)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse6 (not (= 0 ~q_req_up~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse16 (and .cse25 .cse11)) (.cse3 (not .cse19)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse0 (< ~q_write_ev~0 2)) (.cse9 (< ~q_free~0 1)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (< 1 ~q_free~0)) (.cse8 (< |old(~p_dw_st~0)| 2)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14) (or .cse2 .cse1 .cse3 .cse5 .cse15 .cse16 .cse17 (= 0 ~q_write_ev~0) .cse18 .cse10 .cse6 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse7 .cse4 .cse12 .cse13 .cse8 .cse14) (or .cse19 .cse1 .cse2 .cse20 .cse4 .cse21) (or .cse1 .cse2 .cse3 .cse5 .cse15 .cse17 .cse16 .cse0 .cse18 .cse10 .cse8) (or .cse19 .cse1 .cse2 .cse4 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse6 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse12 .cse6 .cse8) (or .cse2 (not (= 1 ~c_dr_i~0)) (and .cse20 (= ~c_dr_st~0 0)) (not (= 0 ~c_num_read~0)) (< .cse23 ~q_free~0) .cse14 (not .cse4) (< ~q_free~0 .cse23) .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)) .cse21 .cse6 (not (= 0 ~c_dr_pc~0))) (or (or .cse0 .cse24 (or .cse1 .cse2 .cse9 .cse3 .cse10 .cse13 .cse6) .cse8) .cse16) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8) (or .cse2 .cse1 .cse16 .cse3 .cse5 .cse0 .cse9 .cse10 .cse24 .cse13 .cse8 .cse14)))) [2018-11-18 08:50:31,082 INFO L425 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2018-11-18 08:50:31,082 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2018-11-18 08:50:31,083 INFO L421 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse3 (= 0 ~c_dr_st~0)) (.cse24 (+ ~c_num_read~0 1))) (let ((.cse6 (not (= 0 ~c_num_read~0))) (.cse13 (not (= 0 ~c_dr_pc~0))) (.cse9 (< ~q_free~0 .cse24)) (.cse10 (not (= 0 ~p_num_write~0))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse7 (< .cse24 ~q_free~0)) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (< ~q_free~0 1)) (.cse20 (not (= 2 ~c_dr_st~0))) (.cse4 (not (= ~p_dw_st~0 0))) (.cse21 (< 1 ~q_free~0)) (.cse5 (= 1 exists_runnable_thread_~__retres1~2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse0 (= 1 ~c_dr_pc~0)) (.cse14 (not (= ~q_read_ev~0 2))) (.cse15 (not (= ~p_dw_pc~0 1))) (.cse22 (< ~q_write_ev~0 2)) (.cse17 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse16 (not (= ~q_free~0 0))) (.cse12 (not (= 0 ~q_req_up~0))) (.cse18 (not .cse3))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse2 .cse5 (not (= 1 ~c_dr_i~0)) .cse6 .cse7 .cse8 .cse9 .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) .cse10 .cse11 .cse4 .cse12 .cse13) (or .cse2 .cse1 .cse14 .cse15 (not (= ~p_dw_st~0 2)) .cse11 .cse16 .cse17 (not (= 1 ~p_num_write~0)) .cse6 .cse13 .cse18) (or .cse9 .cse2 .cse1 .cse5 .cse14 .cse10 .cse11 .cse19 .cse20 .cse4 .cse21 .cse12 .cse8 .cse7) (or (let ((.cse23 (not (= ~c_num_read~0 ~p_num_write~0)))) (and (or .cse2 .cse1 .cse14 .cse15 .cse22 .cse19 .cse20 .cse4 .cse23 .cse21 .cse8) (or .cse22 .cse15 (or .cse1 .cse19 .cse2 .cse20 .cse14 .cse4 .cse21 .cse12) .cse23))) .cse5) (or .cse1 .cse2 (not .cse0) .cse14 .cse15 (not (= .cse24 ~p_num_write~0)) .cse22 .cse17 .cse16 .cse12 (< ~p_dw_st~0 2) .cse18)))) [2018-11-18 08:50:31,083 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2018-11-18 08:50:31,083 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2018-11-18 08:50:31,083 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2018-11-18 08:50:31,083 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2018-11-18 08:50:31,083 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2018-11-18 08:50:31,083 INFO L421 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse12 (= 1 ~c_dr_pc~0))) (let ((.cse0 (< |old(~q_write_ev~0)| 2)) (.cse4 (or (< ~q_free~0 1) (not .cse12) (< 1 ~q_free~0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (= 0 ~c_dr_st~0)) (.cse9 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse13)) (.cse6 (and .cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= 2 ~c_dr_st~0))) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse11 (= ~p_dw_pc~0 1)) (.cse7 (< ~p_dw_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse7 .cse8) (or .cse12 .cse1 .cse2 .cse10 .cse9) (or .cse6 (or .cse1 .cse2 (not (= ~q_free~0 0)) .cse3 .cse5 (not .cse11) (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= 0 |old(~q_write_ev~0)|) .cse7))))) [2018-11-18 08:50:31,083 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2018-11-18 08:50:31,083 INFO L425 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2018-11-18 08:50:31,083 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse19 (= ~p_dw_pc~0 1)) (.cse1 (+ ~c_num_read~0 1)) (.cse24 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse9 (and .cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse17 (and .cse24 .cse21)) (.cse20 (= 1 ~c_dr_pc~0)) (.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (= .cse1 ~p_num_write~0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (= 2 ~c_dr_st~0))) (.cse7 (not .cse19)) (.cse4 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (< |old(~q_write_ev~0)| 2)) (.cse22 (not (= |old(~q_read_ev~0)| 1))) (.cse23 (and .cse24 (= ~q_read_ev~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse15 (< ~q_free~0 1)) (.cse18 (= 0 ~c_dr_st~0)) (.cse16 (< 1 ~q_free~0)) (.cse5 (not (= 0 ~q_req_up~0))) (.cse14 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse1 ~q_free~0) .cse2 (< ~q_free~0 .cse1) .cse3 (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_read_ev~0 ~q_write_ev~0)) .cse5 (not (= 0 ~c_dr_pc~0)) (or .cse6 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (or .cse3 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (or .cse10 .cse14 (or .cse3 .cse0 .cse15 .cse12 .cse16 .cse5) .cse13) .cse17) (or .cse10 .cse3 .cse0 .cse17 .cse18 .cse19 .cse5 .cse13) (or .cse0 .cse3 .cse6 .cse7 .cse9 .cse8 (= 0 |old(~q_write_ev~0)|) .cse11 .cse12 .cse5 .cse13) (or .cse10 .cse3 .cse15 .cse0 .cse17 .cse18 .cse19 .cse16 .cse13 .cse2) (or .cse20 .cse3 .cse0 .cse18 .cse17) (or .cse0 .cse3 .cse9 .cse6 .cse10 .cse15 .cse12 .cse14 .cse16 .cse13 .cse2) (or .cse10 .cse3 .cse0 .cse18 .cse6 .cse5 .cse17 .cse13) (or (and .cse21 (= 1 ~q_write_ev~0)) .cse0 .cse3 (not .cse20) .cse6 .cse7 .cse8 .cse11 (not (= 1 |old(~q_write_ev~0)|)) .cse5 .cse13) (or (and (or .cse22 (or .cse10 (or .cse3 .cse0 .cse15 .cse12 .cse4 .cse16 .cse5) .cse7 .cse14)) (or .cse10 .cse3 .cse15 .cse0 .cse12 .cse22 .cse7 .cse4 .cse14 .cse16 .cse2)) .cse23) (or .cse10 .cse22 .cse23 (or .cse3 .cse0 .cse15 .cse18 .cse16 .cse5) .cse14 .cse13)))) [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L421 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)) (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)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0)) (not (= 0 ~q_req_up~0)) (not (= 0 ~c_dr_pc~0)))) [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L421 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-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2018-11-18 08:50:31,084 INFO L421 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-11-18 08:50:31,085 INFO L421 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)|)) (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)) (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-11-18 08:50:31,085 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2018-11-18 08:50:31,085 INFO L421 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse14 (= 1 ~c_dr_pc~0)) (.cse4 (+ ~c_num_read~0 1))) (let ((.cse8 (= 0 ~c_dr_st~0)) (.cse19 (< 1 |old(~q_free~0)|)) (.cse9 (< |old(~q_free~0)| .cse4)) (.cse1 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse2 (= ~q_req_up~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= 0 ~p_num_write~0)) (.cse17 (not (= 2 ~c_dr_st~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse10 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse21 (< |old(~q_free~0)| 1)) (.cse16 (not .cse14)) (.cse18 (not (= ~q_read_ev~0 2))) (.cse13 (not (= 0 |old(~q_req_up~0)|))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse20 (= |old(~p_dw_pc~0)| 1)) (.cse7 (< .cse4 |old(~q_free~0)|))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 .cse3 (<= .cse4 ~q_free~0) .cse5 (= ~c_last_read~0 ~p_last_write~0) .cse6) (not (= 0 ~c_num_read~0)) .cse7 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse8) .cse9 .cse10 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse11 .cse12 .cse13 (not (= 0 ~c_dr_pc~0))) (or .cse14 .cse10 .cse0 .cse8 (and .cse1 .cse3)) (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse15 (< ~q_write_ev~0 2))) (and (or .cse15 .cse10 .cse0 .cse16 .cse17 .cse18 .cse13) (or .cse15 (or .cse17 (or .cse0 (or .cse10 .cse16 .cse18 .cse19)))))) (not .cse20))) (and (or (and .cse1 .cse5 .cse3) (and .cse1 .cse2 .cse3)) (= ~c_num_read~0 ~p_num_write~0))) (or .cse14 .cse10 .cse0 .cse2 .cse8 .cse13) (or .cse14 (and .cse5 (<= 1 ~q_free~0)) .cse10 .cse0 .cse21 .cse8 .cse19 .cse13) (or .cse9 (and (and .cse1 .cse2 .cse3 .cse5) (<= (+ ~p_num_write~0 1) ~q_free~0) .cse6) (or .cse17 (or .cse0 (or .cse10 .cse21 .cse16 .cse18)) .cse13) .cse11 .cse12 (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) .cse20 .cse7)))) [2018-11-18 08:50:31,085 INFO L421 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse17 (= 1 ~c_dr_pc~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (+ ~c_num_read~0 1))) (let ((.cse13 (< .cse16 |old(~q_free~0)|)) (.cse0 (< |old(~q_free~0)| .cse16)) (.cse1 (<= .cse16 ~q_free~0)) (.cse3 (= 0 ~p_num_write~0)) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse2 (and (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) .cse15)) (.cse14 (= 0 ~c_dr_st~0)) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse5 (not (= ~p_dw_i~0 1))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not .cse17)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse12 (= |old(~p_dw_pc~0)| 1))) (and (or .cse0 (and .cse1 .cse2 (<= ~q_free~0 (+ ~p_num_write~0 1)) .cse3) (or .cse4 (or .cse5 (or .cse6 (< |old(~q_free~0)| 1) .cse7 .cse8)) .cse9) .cse10 .cse11 (< (+ |old(~p_num_write~0)| 1) |old(~q_free~0)|) .cse12 .cse13) (or .cse5 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) .cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse14) .cse0 (and .cse15 (= ~p_dw_pc~0 0) (= ~q_req_up~0 0) .cse1 (<= ~q_free~0 .cse16) .cse3) .cse6 (not (= 2 ~q_write_ev~0)) (not (= |old(~p_dw_pc~0)| 0)) .cse10 .cse11 .cse9 (not (= 0 ~c_dr_pc~0))) (or .cse17 .cse6 .cse5 .cse2 .cse14) (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse18 (< ~q_write_ev~0 2))) (and (or .cse18 .cse6 .cse5 .cse7 .cse4 .cse8 .cse9) (or .cse18 (or .cse4 (or .cse5 (or .cse6 .cse7 .cse8 (< 1 |old(~q_free~0)|))))))) (not .cse12))) (and .cse15 (= ~p_dw_pc~0 1) (= ~c_num_read~0 ~p_num_write~0)))))) [2018-11-18 08:50:31,085 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 147) no Hoare annotation was computed. [2018-11-18 08:50:31,085 INFO L421 ceAbstractionStarter]: At program point L129-2(lines 117 152) the Hoare annotation is: (let ((.cse10 (= 1 ~c_dr_pc~0)) (.cse9 (+ ~c_num_read~0 1))) (let ((.cse12 (= 0 ~c_dr_st~0)) (.cse17 (< |old(~q_free~0)| .cse9)) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse13 (= ~q_req_up~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= 0 ~p_num_write~0)) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse10)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (= 0 |old(~q_req_up~0)|))) (.cse18 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse16 (< .cse9 |old(~q_free~0)|))) (and (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse0 (< ~q_write_ev~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 (or .cse4 (or .cse2 (or .cse1 .cse3 .cse5 (< 1 |old(~q_free~0)|))))))) (not (= |old(~p_dw_pc~0)| 1)))) (and (= ~p_dw_pc~0 1) .cse7 .cse8 (= .cse9 ~p_num_write~0))) (or .cse10 .cse1 .cse2 (and .cse11 .cse7) .cse12) (or .cse2 (not (= 1 ~c_dr_i~0)) (and .cse11 .cse13 .cse7 (<= .cse9 ~q_free~0) .cse14 (= ~c_last_read~0 ~p_last_write~0) .cse15) (not (= 0 ~c_num_read~0)) .cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (not .cse12) .cse17 .cse1 (not (= 2 ~q_write_ev~0)) (and (= ~p_num_write~0 1) .cse11 .cse7 .cse8) (not (= |old(~p_dw_pc~0)| 0)) .cse18 .cse19 .cse6 (not (= 0 ~c_dr_pc~0))) (let ((.cse20 (+ |old(~p_num_write~0)| 1))) (or .cse17 (and (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 1) .cse11 .cse7 .cse8) (and (and .cse11 .cse13 .cse7 .cse14) (<= (+ ~p_num_write~0 1) ~q_free~0) .cse15) (or .cse4 (or .cse2 (or .cse1 (< |old(~q_free~0)| 1) .cse3 .cse5)) .cse6) .cse18 .cse19 (< .cse20 |old(~q_free~0)|) .cse16))))) [2018-11-18 08:50:31,085 INFO L425 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2018-11-18 08:50:31,085 INFO L425 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L421 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse17 (= 1 ~c_dr_pc~0)) (.cse11 (+ ~c_num_read~0 1))) (let ((.cse14 (< |old(~q_free~0)| .cse11)) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse3 (not .cse17)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (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))) (.cse7 (<= 2 ~p_dw_st~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~q_free~0 0)) (.cse12 (< .cse11 |old(~q_free~0)|)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse13 (= 0 ~c_dr_st~0))) (and (or (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (or (let ((.cse0 (< ~q_write_ev~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 (or .cse4 (or .cse2 (or .cse1 .cse3 .cse5 (< 1 |old(~q_free~0)|))))))) (not (= |old(~p_dw_pc~0)| 1)))) (and .cse7 .cse8 .cse9 .cse10 (= .cse11 ~p_num_write~0))) (or .cse2 (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 .cse1 (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) .cse8 .cse9 .cse10) .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse17 .cse1 .cse2 .cse13 .cse9) (let ((.cse18 (+ |old(~p_num_write~0)| 1))) (or .cse14 (or .cse4 (or .cse2 (or .cse1 (< |old(~q_free~0)| 1) .cse3 .cse5)) .cse6) .cse15 .cse16 (and .cse7 (<= .cse18 ~p_num_write~0) (<= ~p_num_write~0 1) .cse8 .cse9 .cse10) (< .cse18 |old(~q_free~0)|) .cse12)) (or .cse17 .cse1 .cse2 .cse13 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (not (= 1 |old(~p_dw_pc~0)|)))))) [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~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) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L428 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L428 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2018-11-18 08:50:31,086 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2018-11-18 08:50:31,086 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2018-11-18 08:50:31,087 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse18 (= 1 |old(~c_dr_pc~0)|)) (.cse34 (= |old(~p_dw_pc~0)| 1)) (.cse25 (<= 1 ~q_free~0)) (.cse26 (<= ~q_free~0 1)) (.cse37 (+ ~c_num_read~0 1)) (.cse36 (+ |old(~c_num_read~0)| 1)) (.cse20 (not (= 0 ~c_dr_st~0))) (.cse3 (<= 2 ~p_dw_st~0)) (.cse21 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= 1 ~c_dr_pc~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse35 (and .cse20 .cse3 .cse21 .cse5 .cse7 .cse8)) (.cse23 (= ~p_dw_st~0 0)) (.cse30 (not (= |old(~p_dw_st~0)| 0))) (.cse13 (not (= .cse36 |old(~p_num_write~0)|))) (.cse9 (= ~q_free~0 0)) (.cse10 (= .cse37 ~p_num_write~0)) (.cse15 (not (= |old(~q_free~0)| 0))) (.cse38 (and .cse25 .cse26)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse12 (not .cse34)) (.cse31 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse29 (not (= 2 |old(~c_dr_st~0)|))) (.cse16 (not (= 0 |old(~q_req_up~0)|))) (.cse4 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse6 (= ~p_dw_pc~0 1)) (.cse22 (= ~c_num_read~0 ~p_num_write~0)) (.cse24 (= 2 ~c_dr_st~0)) (.cse14 (< ~q_write_ev~0 2)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse28 (< |old(~q_free~0)| 1)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not .cse18)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= 0 |old(~c_dr_st~0)|)) (.cse32 (< 1 |old(~q_free~0)|)) (.cse17 (< |old(~p_dw_st~0)| 2)) (.cse33 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 (and (not (= ~c_dr_pc~0 1)) .cse20 .cse21 .cse8)) (or (or (and .cse4 .cse6 .cse22 .cse23 .cse24 .cse7 .cse8 .cse25 .cse26 .cse27) (and .cse4 .cse6 .cse5 .cse22 .cse23 .cse24 .cse7 .cse8 .cse25 .cse26)) (and (or .cse1 .cse0 .cse2 .cse11 .cse12 .cse14 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (or .cse14 .cse12 (or .cse0 .cse28 .cse1 .cse2 .cse29 .cse11 .cse30 .cse32 .cse16) .cse31))) (or .cse18 (and .cse26 .cse25) .cse0 .cse1 .cse28 .cse19 .cse32 .cse16) (or .cse14 .cse0 .cse28 .cse1 .cse2 .cse29 .cse24 .cse34 .cse32 .cse17 .cse33) (or .cse14 .cse0 .cse1 .cse2 .cse35 .cse19 .cse34 .cse16 .cse17) (or .cse14 .cse0 .cse1 .cse2 .cse19 .cse11 .cse16 .cse35 .cse17) (or .cse1 (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse36 |old(~q_free~0)|) .cse33 (not .cse19) (< |old(~q_free~0)| .cse36) .cse0 (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)) (and .cse23 (= ~c_dr_st~0 0) (= ~c_dr_pc~0 0) .cse21 .cse5 .cse8 (= ~c_num_read~0 0) (<= .cse37 ~q_free~0) .cse26 .cse27 (= 0 ~p_num_write~0)) .cse30 .cse16 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse1 .cse0 .cse2 .cse11 .cse12 (and .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10) .cse13 (= 0 ~q_write_ev~0) .cse15 .cse29 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse5 .cse19 .cse16) (or .cse14 .cse0 .cse1 .cse2 .cse29 .cse24 .cse34 .cse16 .cse17) (or .cse1 .cse0 .cse2 .cse11 (and (= ~c_num_read~0 1) (= ~p_num_write~0 1)) .cse14 .cse28 .cse19 (not (= 1 |old(~p_num_write~0)|)) .cse34 (not (= 1 |old(~c_num_read~0)|)) .cse32 .cse17 .cse33) (or .cse14 .cse24 .cse0 .cse1 .cse2 .cse29 .cse11 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse23 .cse19 .cse30) (or .cse14 .cse38 (or .cse0 .cse1 .cse28 .cse19 .cse34 .cse32 .cse16) .cse17) (or .cse0 .cse1 .cse2 .cse11 .cse12 .cse13 (and .cse3 .cse4 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10) .cse14 .cse15 .cse29 .cse17) (or (or .cse0 .cse28 .cse1 .cse19 .cse11 .cse32 .cse16) .cse38 .cse14 .cse17) (or .cse1 .cse0 (and .cse3 .cse4 .cse6 .cse22 .cse24 .cse7 .cse8 .cse25 .cse26 .cse27) .cse2 .cse11 .cse12 .cse14 .cse28 .cse29 .cse31 .cse32 .cse17 .cse33) (or (or .cse14 .cse12 .cse31 (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse32 .cse16) .cse17) (and .cse3 .cse4 .cse5 .cse6 .cse22 .cse24 .cse7 .cse8 .cse25 .cse26)) (or .cse14 .cse0 .cse28 .cse1 .cse2 (and .cse20 .cse3 .cse21 .cse7 .cse8 .cse25 .cse26 .cse27) .cse19 .cse34 .cse32 .cse17 .cse33)))) [2018-11-18 08:50:31,087 INFO L425 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2018-11-18 08:50:31,087 INFO L425 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2018-11-18 08:50:31,088 INFO L421 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse37 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse17 (+ |old(~p_num_write~0)| 1)) (.cse41 (+ |old(~c_num_read~0)| 1)) (.cse33 (<= 1 ~q_free~0)) (.cse34 (<= ~q_free~0 1)) (.cse26 (not (= 0 ~c_dr_st~0))) (.cse11 (<= 2 ~p_dw_st~0)) (.cse27 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse28 (= ~q_req_up~0 0)) (.cse14 (= 1 ~c_dr_pc~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse42 (= ~p_dw_i~0 1))) (let ((.cse30 (and .cse26 .cse11 .cse27 (<= 2 ~q_write_ev~0) .cse28 .cse14 .cse15 (= 2 ~q_read_ev~0) .cse42)) (.cse1 (and .cse33 .cse34)) (.cse29 (not (= .cse41 |old(~p_num_write~0)|))) (.cse19 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse31 (not (= |old(~q_free~0)| 0))) (.cse39 (= ~c_num_read~0 1)) (.cse40 (= ~p_num_write~0 1)) (.cse16 (<= .cse17 ~p_num_write~0)) (.cse18 (= ~q_free~0 0)) (.cse38 (and (not (= ~c_dr_pc~0 1)) .cse26 .cse15)) (.cse23 (not (= |old(~p_dw_st~0)| 0))) (.cse20 (not (= ~q_read_ev~0 2))) (.cse21 (not .cse7)) (.cse24 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse36 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse32 (= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= 2 ~c_dr_st~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)) (.cse35 (= ~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)) (.cse25 (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 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~p_num_write~0 .cse17) .cse18 .cse19) (and (or .cse3 .cse2 .cse5 .cse20 .cse21 .cse0 .cse4 .cse22 .cse23 .cse24 .cse8 .cse25) (or .cse0 .cse21 (or .cse2 .cse4 .cse3 .cse5 .cse22 .cse20 .cse23 .cse8 .cse9) .cse24))) (or .cse0 .cse2 .cse4 .cse3 .cse5 .cse22 .cse13 .cse7 .cse8 .cse10 .cse25) (or .cse0 .cse2 .cse3 .cse5 (and .cse26 .cse11 .cse27 .cse28 .cse14 .cse15) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 .cse20 .cse21 .cse29 .cse30 .cse0 .cse31 .cse9 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse33 .cse34 .cse35) .cse10) (or .cse3 .cse2 .cse5 .cse20 .cse21 (and .cse11 .cse36 .cse28 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19) .cse29 (= 0 ~q_write_ev~0) .cse31 .cse22 .cse9 .cse10) (or .cse37 .cse2 .cse3 .cse6 .cse38) (or .cse0 .cse2 .cse3 .cse5 .cse22 .cse13 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse20 .cse9 .cse30 .cse10) (or .cse3 .cse2 .cse5 .cse20 (and .cse39 .cse40) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse25) (or .cse0 .cse13 .cse2 .cse3 .cse5 .cse22 .cse20 .cse9 .cse10) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse20 .cse8 .cse9) .cse1 .cse0 .cse10) (or .cse2 .cse3 .cse5 .cse20 .cse21 .cse29 (and .cse11 .cse36 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19) .cse0 .cse31 .cse22 .cse10) (or .cse3 (and .cse11 .cse13 .cse39 .cse33 .cse40 .cse12 .cse15 .cse34 .cse35) (not (= 1 ~c_dr_i~0)) (and .cse11 .cse13 .cse16 (<= ~p_num_write~0 1) .cse12 .cse15 (= ~c_num_read~0 0) .cse18) (not (= 0 |old(~c_num_read~0)|)) (< .cse41 |old(~q_free~0)|) .cse25 (< |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 .cse23 .cse9 (not (= 0 |old(~c_dr_pc~0)|))) (or .cse3 .cse2 (and .cse11 .cse36 .cse12 .cse32 .cse13 .cse14 .cse15 .cse33 .cse34 .cse35) .cse5 .cse20 .cse21 .cse0 .cse4 .cse22 .cse24 .cse8 .cse10 .cse25) (or (or .cse0 .cse21 .cse24 (or .cse2 .cse3 .cse4 .cse5 .cse22 .cse8 .cse9) .cse10) (and .cse11 .cse36 .cse28 .cse12 .cse32 .cse13 .cse14 .cse15 .cse33 .cse34)) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse26 .cse11 .cse27 .cse14 .cse15 .cse33 .cse34 .cse35) .cse6 .cse7 .cse8 .cse10 .cse25)))) [2018-11-18 08:50:31,088 INFO L425 ceAbstractionStarter]: For program point L329-1(lines 329 369) no Hoare annotation was computed. [2018-11-18 08:50:31,088 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2018-11-18 08:50:31,088 INFO L421 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse38 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse48 (+ ~c_num_read~0 1)) (.cse45 (+ |old(~c_num_read~0)| 1)) (.cse22 (<= 1 ~q_free~0)) (.cse23 (<= ~q_free~0 1)) (.cse35 (+ |old(~p_num_write~0)| 1)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse15 (<= 2 ~p_dw_st~0)) (.cse16 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse49 (= ~p_dw_i~0 1))) (let ((.cse31 (and .cse14 .cse15 .cse16 (<= 2 ~q_write_ev~0) .cse17 .cse18 .cse19 (= 2 ~q_read_ev~0) .cse49)) (.cse40 (= ~c_num_read~0 1)) (.cse41 (= ~p_num_write~0 1)) (.cse34 (<= .cse35 ~p_num_write~0)) (.cse39 (and (not (= ~c_dr_pc~0 1)) .cse14 .cse19)) (.cse36 (not (= |old(~p_dw_st~0)| 0))) (.cse33 (= ~p_dw_st~0 0)) (.cse1 (and .cse22 .cse23)) (.cse30 (not (= .cse45 |old(~p_num_write~0)|))) (.cse28 (= ~q_free~0 0)) (.cse29 (= .cse48 ~p_num_write~0)) (.cse32 (not (= |old(~q_free~0)| 0))) (.cse25 (not (= ~q_read_ev~0 2))) (.cse26 (not .cse7)) (.cse37 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse27 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse20 (= ~p_dw_pc~0 1)) (.cse21 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 2 ~c_dr_st~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 .cse38)) (.cse24 (= ~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)) (.cse13 (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 .cse0 .cse2 .cse4 .cse3 .cse5 .cse11 .cse12 .cse7 .cse8 .cse10 .cse13) (or .cse0 .cse2 .cse3 .cse5 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse15 .cse20 .cse21 .cse12 .cse18 .cse19 .cse22 .cse23 .cse24) .cse25 .cse26 (and .cse15 .cse27 .cse17 .cse20 .cse18 .cse19 .cse28 .cse29) .cse30 .cse31 .cse0 .cse32 .cse9 .cse10) (or (or (and .cse27 .cse20 .cse17 .cse21 .cse33 .cse12 .cse18 .cse19 .cse22 .cse23) (and .cse27 .cse20 .cse21 .cse33 .cse12 .cse18 .cse19 .cse22 .cse23 .cse24)) (and .cse15 .cse20 .cse12 .cse18 .cse19 .cse34 (<= ~p_num_write~0 .cse35) .cse28 .cse29) (and (or .cse3 .cse2 .cse5 .cse25 .cse26 .cse0 .cse4 .cse11 .cse36 .cse37 .cse8 .cse13) (or .cse0 .cse26 (or .cse2 .cse4 .cse3 .cse5 .cse11 .cse25 .cse36 .cse8 .cse9) .cse37))) (or .cse3 .cse2 .cse5 .cse25 .cse26 (and .cse15 .cse27 .cse17 .cse20 .cse12 .cse18 .cse19 .cse28 .cse29) .cse30 (= 0 ~q_write_ev~0) .cse32 .cse11 .cse9 .cse10) (or .cse38 .cse2 .cse3 .cse6 .cse39) (or .cse0 .cse2 .cse3 .cse5 .cse11 .cse12 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse25 .cse9 .cse31 .cse10) (or .cse3 .cse2 .cse5 .cse25 (and .cse40 .cse41) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse13) (or .cse0 .cse12 .cse2 .cse3 .cse5 .cse11 .cse25 .cse9 .cse10) (let ((.cse43 (<= 1 eval_~tmp___1~0)) (.cse46 (= ~c_dr_pc~0 0)) (.cse47 (= ~c_num_read~0 0)) (.cse42 (<= .cse48 ~q_free~0)) (.cse44 (= 0 ~p_num_write~0))) (or (and .cse33 .cse12 .cse16 .cse27 .cse17 .cse19 .cse42 .cse23 .cse43 .cse24 .cse44) .cse3 (and .cse15 .cse12 .cse40 .cse22 .cse41 .cse20 .cse19 .cse23 .cse24) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse45 |old(~q_free~0)|) .cse13 (< |old(~q_free~0)| .cse45) .cse2 (and (= ~p_dw_st~0 2) .cse41 .cse46 .cse20 .cse19 .cse47 .cse28 .cse43) (and .cse15 .cse12 .cse34 (<= ~p_num_write~0 1) .cse20 .cse19 .cse47 .cse28) (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)) .cse39 .cse36 .cse9 (not (= 0 |old(~c_dr_pc~0)|)) (and .cse33 .cse46 .cse16 .cse17 .cse19 .cse47 .cse42 .cse23 .cse24 .cse44))) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse25 .cse8 .cse9) .cse1 .cse0 .cse10) (or .cse2 .cse3 .cse5 .cse25 .cse26 .cse30 (and .cse15 .cse27 .cse20 .cse12 .cse18 .cse19 .cse28 .cse29) .cse0 .cse32 .cse11 .cse10) (or .cse3 .cse2 (and .cse15 .cse27 .cse20 .cse21 .cse12 .cse18 .cse19 .cse22 .cse23 .cse24) .cse5 .cse25 .cse26 .cse0 .cse4 .cse11 .cse37 .cse8 .cse10 .cse13) (or (or .cse0 .cse26 .cse37 (or .cse2 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9) .cse10) (and .cse15 .cse27 .cse17 .cse20 .cse21 .cse12 .cse18 .cse19 .cse22 .cse23)) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse14 .cse15 .cse16 .cse18 .cse19 .cse22 .cse23 .cse24) .cse6 .cse7 .cse8 .cse10 .cse13)))) [2018-11-18 08:50:31,088 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2018-11-18 08:50:31,088 INFO L421 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 1 |old(~c_dr_pc~0)|)) (.cse26 (= |old(~p_dw_pc~0)| 1)) (.cse30 (+ |old(~c_num_read~0)| 1))) (let ((.cse6 (not (= |old(~q_free~0)| 0))) (.cse5 (not (= .cse30 |old(~p_num_write~0)|))) (.cse4 (not .cse26)) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse15 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse14 (< |old(~q_free~0)| 1)) (.cse16 (< 1 |old(~q_free~0)|)) (.cse13 (< ~q_write_ev~0 2)) (.cse2 (not .cse10)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse9 (< |old(~p_dw_st~0)| 2)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse24 (<= 1 eval_~tmp___1~0)) (.cse18 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse23 (= ~q_req_up~0 0)) (.cse20 (= 2 ~c_dr_st~0)) (.cse19 (<= ~q_free~0 1)) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (and (not (= ~c_dr_pc~0 1)) (not (= 0 ~c_dr_st~0)) .cse22)) (.cse25 (not (= |old(~p_dw_st~0)| 0))) (.cse8 (not (= 0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~q_write_ev~0) .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse1 .cse0 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse7 .cse15 .cse16 .cse9 .cse17) (or .cse13 .cse15 (or .cse1 .cse0 .cse14 .cse2 .cse7 .cse16 .cse8) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse9) (or .cse13 .cse1 .cse0 .cse2 .cse6 .cse3 .cse4 .cse5 .cse8 .cse9) (or (and (and (= |old(~c_num_read~0)| ~c_num_read~0) (let ((.cse21 (= 1 ~c_dr_pc~0))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse18 .cse23 .cse20 .cse21 .cse22))) (= ~c_num_read~0 ~p_num_write~0)) .cse24) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse7 .cse25 .cse15 .cse16 .cse17) (or .cse13 .cse4 (or .cse1 .cse14 .cse0 .cse2 .cse7 .cse3 .cse25 .cse16 .cse8) .cse15))) (or .cse13 .cse1 .cse14 .cse0 .cse2 .cse11 .cse26 .cse16 .cse9 .cse17) (or .cse13 .cse1 .cse0 .cse2 .cse11 .cse26 .cse8 .cse9) (or .cse13 .cse1 .cse0 .cse2 .cse11 .cse3 .cse8 .cse9) (let ((.cse29 (+ ~c_num_read~0 1))) (let ((.cse27 (<= .cse29 ~q_free~0)) (.cse28 (= 0 ~p_num_write~0))) (or .cse0 (not (= 1 ~c_dr_i~0)) (and (= ~c_dr_pc~0 0) .cse18 .cse23 .cse22 (= ~c_num_read~0 0) .cse27 .cse19 .cse24 (= ~c_last_read~0 ~p_last_write~0) .cse28) (not (= 0 |old(~c_num_read~0)|)) (and .cse27 (<= ~q_free~0 .cse29) .cse24 (and .cse18 .cse23 .cse20 .cse22 (<= 1 ~q_free~0) .cse19) .cse28) (< .cse30 |old(~q_free~0)|) .cse17 (< |old(~q_free~0)| .cse30) .cse1 (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 .cse25 .cse8 (not (= 0 |old(~c_dr_pc~0)|)))))))) [2018-11-18 08:50:31,088 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2018-11-18 08:50:31,089 INFO L425 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2018-11-18 08:50:31,089 INFO L425 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-11-18 08:50:31,089 INFO L421 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse38 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse48 (+ ~c_num_read~0 1)) (.cse45 (+ |old(~c_num_read~0)| 1)) (.cse22 (<= 1 ~q_free~0)) (.cse23 (<= ~q_free~0 1)) (.cse35 (+ |old(~p_num_write~0)| 1)) (.cse14 (not (= 0 ~c_dr_st~0))) (.cse15 (<= 2 ~p_dw_st~0)) (.cse16 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|)) (.cse17 (= ~q_req_up~0 0)) (.cse18 (= 1 ~c_dr_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse49 (= ~p_dw_i~0 1))) (let ((.cse31 (and .cse14 .cse15 .cse16 (<= 2 ~q_write_ev~0) .cse17 .cse18 .cse19 (= 2 ~q_read_ev~0) .cse49)) (.cse40 (= ~c_num_read~0 1)) (.cse41 (= ~p_num_write~0 1)) (.cse34 (<= .cse35 ~p_num_write~0)) (.cse39 (and (not (= ~c_dr_pc~0 1)) .cse14 .cse19)) (.cse36 (not (= |old(~p_dw_st~0)| 0))) (.cse33 (= ~p_dw_st~0 0)) (.cse1 (and .cse22 .cse23)) (.cse30 (not (= .cse45 |old(~p_num_write~0)|))) (.cse28 (= ~q_free~0 0)) (.cse29 (= .cse48 ~p_num_write~0)) (.cse32 (not (= |old(~q_free~0)| 0))) (.cse25 (not (= ~q_read_ev~0 2))) (.cse26 (not .cse7)) (.cse37 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse9 (not (= 0 |old(~q_req_up~0)|))) (.cse27 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse20 (= ~p_dw_pc~0 1)) (.cse21 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 2 ~c_dr_st~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 .cse38)) (.cse24 (= ~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)) (.cse13 (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 .cse0 .cse2 .cse4 .cse3 .cse5 .cse11 .cse12 .cse7 .cse8 .cse10 .cse13) (or .cse0 .cse2 .cse3 .cse5 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse6 .cse7 .cse9 .cse10) (or .cse2 .cse3 .cse5 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse15 .cse20 .cse21 .cse12 .cse18 .cse19 .cse22 .cse23 .cse24) .cse25 .cse26 (and .cse15 .cse27 .cse17 .cse20 .cse18 .cse19 .cse28 .cse29) .cse30 .cse31 .cse0 .cse32 .cse9 .cse10) (or (or (and .cse27 .cse20 .cse17 .cse21 .cse33 .cse12 .cse18 .cse19 .cse22 .cse23) (and .cse27 .cse20 .cse21 .cse33 .cse12 .cse18 .cse19 .cse22 .cse23 .cse24)) (and .cse15 .cse20 .cse12 .cse18 .cse19 .cse34 (<= ~p_num_write~0 .cse35) .cse28 .cse29) (and (or .cse3 .cse2 .cse5 .cse25 .cse26 .cse0 .cse4 .cse11 .cse36 .cse37 .cse8 .cse13) (or .cse0 .cse26 (or .cse2 .cse4 .cse3 .cse5 .cse11 .cse25 .cse36 .cse8 .cse9) .cse37))) (or .cse3 .cse2 .cse5 .cse25 .cse26 (and .cse15 .cse27 .cse17 .cse20 .cse12 .cse18 .cse19 .cse28 .cse29) .cse30 (= 0 ~q_write_ev~0) .cse32 .cse11 .cse9 .cse10) (or .cse38 .cse2 .cse3 .cse6 .cse39) (or .cse0 .cse2 .cse3 .cse5 .cse11 .cse12 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse25 .cse9 .cse31 .cse10) (or .cse3 .cse2 .cse5 .cse25 (and .cse40 .cse41) .cse0 .cse4 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse10 .cse13) (or .cse0 .cse12 .cse2 .cse3 .cse5 .cse11 .cse25 .cse9 .cse10) (let ((.cse43 (<= 1 eval_~tmp___1~0)) (.cse46 (= ~c_dr_pc~0 0)) (.cse47 (= ~c_num_read~0 0)) (.cse42 (<= .cse48 ~q_free~0)) (.cse44 (= 0 ~p_num_write~0))) (or (and .cse33 .cse12 .cse16 .cse27 .cse17 .cse19 .cse42 .cse23 .cse43 .cse24 .cse44) .cse3 (and .cse15 .cse12 .cse40 .cse22 .cse41 .cse20 .cse19 .cse23 .cse24) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (< .cse45 |old(~q_free~0)|) .cse13 (< |old(~q_free~0)| .cse45) .cse2 (and (= ~p_dw_st~0 2) .cse41 .cse46 .cse20 .cse19 .cse47 .cse28 .cse43) (and .cse15 .cse12 .cse34 (<= ~p_num_write~0 1) .cse20 .cse19 .cse47 .cse28) (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)) .cse39 .cse36 .cse9 (not (= 0 |old(~c_dr_pc~0)|)) (and .cse33 .cse46 .cse16 .cse17 .cse19 .cse47 .cse42 .cse23 .cse24 .cse44))) (or (or .cse2 .cse4 .cse3 .cse5 .cse6 .cse25 .cse8 .cse9) .cse1 .cse0 .cse10) (or .cse2 .cse3 .cse5 .cse25 .cse26 .cse30 (and .cse15 .cse27 .cse20 .cse12 .cse18 .cse19 .cse28 .cse29) .cse0 .cse32 .cse11 .cse10) (or .cse3 .cse2 (and .cse15 .cse27 .cse20 .cse21 .cse12 .cse18 .cse19 .cse22 .cse23 .cse24) .cse5 .cse25 .cse26 .cse0 .cse4 .cse11 .cse37 .cse8 .cse10 .cse13) (or (or .cse0 .cse26 .cse37 (or .cse2 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9) .cse10) (and .cse15 .cse27 .cse17 .cse20 .cse21 .cse12 .cse18 .cse19 .cse22 .cse23)) (or .cse0 .cse2 .cse4 .cse3 .cse5 (and .cse14 .cse15 .cse16 .cse18 .cse19 .cse22 .cse23 .cse24) .cse6 .cse7 .cse8 .cse10 .cse13)))) [2018-11-18 08:50:31,089 INFO L421 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse27 (= |old(~p_dw_pc~0)| 1)) (.cse9 (+ |old(~c_num_read~0)| 1))) (let ((.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (not (= 0 ~c_dr_st~0))) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse14 (+ ~c_num_read~0 1)) (.cse8 (<= 1 eval_~tmp___1~0)) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse23 (= 0 |old(~c_dr_st~0)|)) (.cse18 (not (= .cse9 |old(~p_num_write~0)|))) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse21 (< |old(~p_dw_st~0)| 2)) (.cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse19 (< ~q_write_ev~0 2)) (.cse17 (not .cse27)) (.cse11 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse25 (< |old(~q_free~0)| 1)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse12 (not (= |old(~p_dw_st~0)| 0))) (.cse26 (< 1 |old(~q_free~0)|)) (.cse13 (not (= 0 |old(~q_req_up~0)|))) (.cse24 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)))) (and (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_num_read~0 0))) (or .cse0 (not (= 1 ~c_dr_i~0)) (and .cse1 .cse2 (= ~p_num_write~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (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)|)) (and .cse1 (= ~p_dw_st~0 0) .cse3 (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_req_up~0 0) .cse5 .cse6 (<= .cse14 ~q_free~0) (<= ~q_free~0 1) .cse8 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)))) (or .cse11 .cse0 (not .cse15) .cse16 .cse17 .cse18 .cse19 (and .cse2 .cse1 (= |old(~c_num_read~0)| ~c_num_read~0) .cse4 (= 1 ~c_dr_pc~0) .cse5 .cse7 (= .cse14 ~p_num_write~0) .cse8) .cse20 .cse13 .cse21) (or .cse0 .cse11 .cse16 .cse17 .cse18 (= 0 ~q_write_ev~0) .cse20 .cse22 .cse13 .cse21) (or .cse15 .cse11 .cse0 .cse23) (or .cse19 .cse24 (or .cse11 .cse0 .cse25 .cse22 .cse26 .cse13) .cse21) (or .cse19 .cse11 .cse25 .cse0 .cse23 .cse27 .cse26 .cse21 .cse10) (or .cse0 .cse11 .cse16 .cse17 .cse19 .cse25 .cse22 .cse12 .cse24 .cse26 .cse10) (or .cse19 .cse11 .cse0 .cse23 .cse27 .cse13 .cse21) (or .cse19 .cse11 .cse0 .cse23 .cse16 .cse13 .cse21) (or .cse0 .cse11 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21) (or .cse0 .cse11 .cse16 .cse19 .cse25 .cse22 .cse24 .cse26 .cse21 .cse10) (or .cse19 .cse17 (or .cse11 .cse25 .cse0 .cse22 .cse16 .cse12 .cse26 .cse13) .cse24)))) [2018-11-18 08:50:31,089 INFO L428 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2018-11-18 08:50:31,089 INFO L421 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse20 (= 1 ~c_dr_pc~0)) (.cse18 (+ ~c_num_read~0 1))) (let ((.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse3 (= 0 ~c_dr_st~0)) (.cse12 (not (= .cse18 ~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)) (.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))) (.cse19 (not (= ~p_dw_st~0 0))) (.cse10 (< 1 ~q_free~0)) (.cse6 (not (= 0 ~q_req_up~0))) (.cse9 (= ~p_dw_pc~0 1)) (.cse17 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse16 (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 .cse12 .cse5 .cse13 .cse0 .cse14 .cse15 .cse4 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse5 .cse7) (or (or .cse0 (or (or .cse1 .cse2 .cse8 .cse3 .cse10) .cse6) .cse7) .cse5 .cse16 .cse17) (or .cse5 (or .cse17 (or .cse0 (or (or .cse1 .cse2 .cse8 .cse15 .cse10) .cse6) .cse7))) (or .cse2 (not (= 1 ~c_dr_i~0)) (= is_do_read_c_triggered_~__retres1~1 0) (not (= 0 ~c_num_read~0)) (< .cse18 ~q_free~0) .cse11 (< ~q_free~0 .cse18) .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)) .cse19 .cse6 (not (= 0 ~c_dr_pc~0))) (or .cse2 .cse1 .cse0 .cse8 .cse15 .cse4 .cse17 .cse10 .cse5 .cse7 .cse11) (or .cse1 .cse2 .cse5 .cse3 .cse20) (or .cse2 .cse1 .cse12 (= 0 ~q_write_ev~0) .cse13 .cse5 .cse14 .cse15 .cse4 (= 1 ~q_write_ev~0) .cse6 .cse7) (or (or .cse0 (or .cse1 .cse2 .cse8 .cse15 .cse19 .cse10 .cse6) (not .cse9) .cse17) .cse16 .cse5)))) [2018-11-18 08:50:31,090 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2018-11-18 08:50:31,090 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-18 08:50:31,090 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2018-11-18 08:50:31,090 INFO L425 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2018-11-18 08:50:31,090 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2018-11-18 08:50:31,090 INFO L421 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-11-18 08:50:31,090 INFO L425 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-18 08:50:31,090 INFO L421 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)) (.cse18 (+ ~c_num_read~0 1))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= .cse18 ~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)) (.cse19 (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 .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) (<= .cse18 ~q_free~0) .cse9 .cse10 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (and .cse14 .cse3 .cse4 .cse19 .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 .cse19 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|))))) [2018-11-18 08:50:31,090 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-18 08:50:31,093 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2018-11-18 08:50:31,093 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 431) no Hoare annotation was computed. [2018-11-18 08:50:31,093 INFO L421 ceAbstractionStarter]: At program point L409-2(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)) (.cse18 (+ ~c_num_read~0 1))) (let ((.cse1 (= ~q_free~0 0)) (.cse2 (= .cse18 ~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)) (.cse19 (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 .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) (<= .cse18 ~q_free~0) .cse9 .cse10 (= ~q_read_ev~0 ~q_write_ev~0) (= 0 ~p_num_write~0)) (and .cse14 .cse3 .cse4 .cse19 .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 .cse19 .cse4 .cse9 .cse10 .cse7 .cse12) (not (= 0 |old(~q_req_up~0)|))))) [2018-11-18 08:50:31,093 INFO L421 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)) (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)) (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(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-11-18 08:50:31,094 INFO L421 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)) (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)) (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(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-11-18 08:50:31,097 INFO L428 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2018-11-18 08:50:31,098 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-11-18 08:50:31,098 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-18 08:50:31,098 INFO L421 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-11-18 08:50:31,098 INFO L421 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)) (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)) (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(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-11-18 08:50:31,101 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-18 08:50:31,101 INFO L421 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)) (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-11-18 08:50:31,101 INFO L421 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)) (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)) (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(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-11-18 08:50:31,102 INFO L421 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)) (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)) (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(~q_req_up~0)|)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-11-18 08:50:31,104 INFO L421 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-11-18 08:50:31,104 INFO L421 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-11-18 08:50:31,106 INFO L421 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-11-18 08:50:31,107 INFO L421 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)) (.cse1 (+ ~c_num_read~0 1)) (.cse15 (= ~p_dw_pc~0 1))) (let ((.cse6 (not .cse15)) (.cse7 (not (= .cse1 ~p_num_write~0))) (.cse10 (not (= ~q_free~0 0))) (.cse8 (and .cse19 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse17 (< ~q_free~0 1)) (.cse11 (not (= 2 ~c_dr_st~0))) (.cse16 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse18 (< 1 ~q_free~0)) (.cse2 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (< |old(~q_write_ev~0)| 2)) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse14 (= 0 ~c_dr_st~0)) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse4 (not (= 0 ~q_req_up~0))) (.cse13 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse19)) (.cse12 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse1 ~q_free~0) .cse2 (< ~q_free~0 .cse1) .cse3 (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)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_read_ev~0 ~q_write_ev~0)) .cse4 (not (= 0 ~c_dr_pc~0))) (or .cse3 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse9 .cse3 .cse0 .cse13 .cse14 .cse15 .cse4 .cse12) (or (or .cse9 .cse16 (or .cse3 .cse0 .cse17 .cse11 .cse18 .cse4) .cse12) .cse8) (or .cse9 .cse3 .cse17 .cse0 .cse13 .cse14 .cse15 .cse18 .cse12 .cse2) (or .cse3 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse4 .cse12) (or (= 1 ~c_dr_pc~0) .cse3 .cse0 .cse14 .cse13) (or .cse0 .cse3 .cse8 .cse5 .cse9 .cse17 .cse11 .cse16 .cse18 .cse12 .cse2) (or .cse9 .cse3 .cse0 .cse14 .cse5 .cse4 .cse13 .cse12)))) [2018-11-18 08:50:31,111 INFO L425 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2018-11-18 08:50:31,111 INFO L425 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2018-11-18 08:50:31,112 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2018-11-18 08:50:31,112 INFO L421 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse9 (= ~q_req_up~0 0)) (.cse11 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse24 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse10 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse22 (+ ~c_num_read~0 1)) (.cse20 (= ~p_dw_pc~0 1))) (let ((.cse13 (not .cse20)) (.cse14 (not (= .cse22 ~p_num_write~0))) (.cse16 (not (= ~q_free~0 0))) (.cse17 (= 1 ~c_dr_pc~0)) (.cse19 (and .cse24 .cse10)) (.cse15 (and .cse10 .cse11)) (.cse4 (< ~q_free~0 1)) (.cse5 (not (= 2 ~c_dr_st~0))) (.cse1 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse6 (< 1 ~q_free~0)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< |old(~q_write_ev~0)| 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse18 (= 0 ~c_dr_st~0)) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse7 (not (= 0 |old(~q_req_up~0)|))) (.cse23 (and .cse24 .cse9 .cse10)) (.cse8 (< ~p_dw_st~0 2))) (and (or (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (and (and .cse9 .cse10) .cse11)) (or .cse2 .cse3 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16 .cse5 .cse8) (or .cse3 .cse2 .cse12 .cse13 (and .cse9 .cse10 .cse11) .cse14 (= 0 |old(~q_write_ev~0)|) .cse16 .cse5 .cse7 .cse8) (or .cse17 .cse2 .cse3 .cse9 .cse18 .cse7) (or .cse0 .cse2 .cse4 .cse3 .cse19 .cse18 .cse20 .cse6 .cse8 .cse21) (or .cse17 .cse2 .cse3 .cse18 .cse19) (or .cse3 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse22 ~q_free~0) .cse21 (< ~q_free~0 .cse22) .cse2 (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)) (and (= ~q_read_ev~0 |old(~q_read_ev~0)|) .cse9 (= ~q_read_ev~0 ~q_write_ev~0)) .cse7 (not (= 0 ~c_dr_pc~0))) (or .cse3 .cse2 .cse15 .cse12 .cse0 .cse4 .cse5 .cse1 .cse6 .cse8 .cse21) (or .cse0 .cse2 .cse3 .cse23 .cse18 .cse20 .cse7 .cse8) (or .cse0 .cse2 .cse3 .cse18 .cse12 .cse7 .cse23 .cse8)))) [2018-11-18 08:50:31,113 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2018-11-18 08:50:31,113 INFO L421 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1)) (.cse16 (= ~p_dw_pc~0 1)) (.cse20 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse17 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse20)) (.cse7 (< ~q_free~0 1)) (.cse6 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse9 (< 1 ~q_free~0)) (.cse11 (and .cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse5 (< |old(~q_write_ev~0)| 2)) (.cse3 (= 0 ~c_dr_st~0)) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse13 (not .cse16)) (.cse14 (not (= .cse19 ~p_num_write~0))) (.cse15 (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))) (.cse18 (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 .cse1 .cse2 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse8 .cse10) (or .cse5 .cse1 .cse2 .cse3 .cse16 .cse4 .cse10) (or .cse5 .cse1 .cse7 .cse2 .cse17 .cse3 .cse16 .cse9 .cse10 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse17) (or .cse2 .cse1 .cse12 .cse5 .cse7 .cse8 .cse6 .cse9 .cse11 .cse10 .cse18) (or .cse5 .cse1 .cse2 .cse3 .cse12 .cse4 .cse10) (or .cse2 .cse1 .cse12 .cse13 .cse14 (= 0 |old(~q_write_ev~0)|) .cse15 .cse8 .cse4 .cse10) (or .cse2 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse19 ~q_free~0) .cse18 (< ~q_free~0 .cse19) .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-11-18 08:50:31,113 INFO L425 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2018-11-18 08:50:31,113 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:50:31,114 INFO L421 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-11-18 08:50:31,114 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 08:50:31,114 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:50:31,114 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2018-11-18 08:50:31,114 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L428 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2018-11-18 08:50:31,115 INFO L421 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse1 (+ ~c_num_read~0 1)) (.cse15 (= ~p_dw_pc~0 1))) (let ((.cse10 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (= 1 ~c_dr_pc~0)) (.cse8 (< ~q_free~0 1)) (.cse11 (< 1 ~q_free~0)) (.cse2 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not .cse15)) (.cse17 (not (= .cse1 ~p_num_write~0))) (.cse18 (not (= ~q_free~0 0))) (.cse9 (not (= 2 ~c_dr_st~0))) (.cse7 (< ~q_write_ev~0 2)) (.cse5 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse14 (= 0 ~c_dr_st~0)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse4 (not (= 0 ~q_req_up~0))) (.cse12 (< ~p_dw_st~0 2))) (and (or .cse0 (not (= 1 ~c_dr_i~0)) (not (= 0 ~c_num_read~0)) (< .cse1 ~q_free~0) .cse2 (< ~q_free~0 .cse1) .cse3 (= is_do_write_p_triggered_~__retres1~0 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 (= ~p_dw_st~0 0)) .cse4 (not (= 0 ~c_dr_pc~0))) (or .cse5 .cse0 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2) (or .cse13 .cse3 .cse0 .cse5 .cse14 .cse6) (or (or .cse7 .cse10 (or .cse3 .cse0 .cse8 (not .cse13) .cse9 .cse11 .cse4) .cse12) (= ~q_read_ev~0 1) .cse5) (or .cse13 .cse3 .cse0 (and (= 1 ~p_dw_pc~0) (not (= 0 ~q_read_ev~0))) .cse14 .cse5) (or .cse7 .cse3 .cse0 .cse14 .cse5 .cse15 .cse4 .cse12) (or .cse0 .cse3 .cse5 .cse6 .cse16 .cse17 (= 0 ~q_write_ev~0) .cse18 .cse9 .cse4 .cse12) (or .cse7 .cse3 .cse8 .cse0 .cse14 .cse5 .cse15 .cse11 .cse12 .cse2) (or .cse0 .cse3 .cse6 .cse16 .cse17 .cse7 .cse18 .cse9 .cse5 .cse12) (or .cse7 .cse5 .cse3 .cse0 .cse14 .cse6 .cse4 .cse12)))) [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2018-11-18 08:50:31,115 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 201) no Hoare annotation was computed. [2018-11-18 08:50:31,116 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2018-11-18 08:50:31,116 INFO L421 ceAbstractionStarter]: At program point L193(line 193) 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)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.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 .cse0 (or .cse3 (not (= 1 |old(~c_dr_pc~0)|)))) .cse5 .cse7) .cse10) .cse9 .cse8 (not (= .cse2 ~p_num_write~0))))) [2018-11-18 08:50:31,116 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2018-11-18 08:50:31,116 INFO L421 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse9 (= ~q_free~0 0)) (.cse3 (not (= ~q_read_ev~0 2))) (.cse6 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (< ~p_dw_st~0 2)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (+ |old(~c_num_read~0)| 1)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse13 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse2 (= 0 |old(~c_dr_st~0)|)) (.cse15 (not (= 0 |old(~c_dr_pc~0)|))) (.cse8 (not (= 0 ~c_dr_st~0))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse10 (+ ~c_num_read~0 1))) (and (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse1 (not (= 1 |old(~c_dr_pc~0)|)))) .cse2 .cse3) .cse4) .cse5 .cse6 (not (= .cse7 ~p_num_write~0)) (and .cse8 (= 1 ~c_dr_pc~0) .cse9 (= .cse10 ~p_num_write~0))) (or .cse0 .cse1 (and .cse8 .cse11 .cse12 .cse9) .cse3 .cse6 .cse13 .cse5 .cse2 (not (= 1 ~p_num_write~0)) .cse14 .cse15 .cse4) (or .cse0 (not (= 1 ~c_dr_i~0)) .cse14 (< .cse7 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse7) .cse1 (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse13 .cse2 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse15 (and .cse8 .cse11 (= ~q_req_up~0 0) .cse12 (<= .cse10 ~q_free~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0))))) [2018-11-18 08:50:31,116 INFO L425 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2018-11-18 08:50:31,116 INFO L421 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse13 (not (= 0 |old(~c_dr_pc~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.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))) (.cse15 (+ |old(~c_num_read~0)| 1)) (.cse6 (= 2 ~c_dr_st~0)) (.cse8 (= 1 ~c_dr_pc~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~q_free~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~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 .cse0 (not (= 1 ~c_dr_i~0)) (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) .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 .cse11 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse13) (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse1 (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)))) [2018-11-18 08:50:31,117 INFO L421 ceAbstractionStarter]: At program point L198(line 198) 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)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.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 .cse0 (or .cse3 (not (= 1 |old(~c_dr_pc~0)|)))) .cse5 .cse7) .cse10) .cse9 .cse8 (not (= .cse2 ~p_num_write~0))))) [2018-11-18 08:50:31,117 INFO L421 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse15 (< ~p_dw_st~0 2)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse3 (not (= ~p_dw_pc~0 1))) (.cse6 (<= 1 ~q_free~0)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (+ |old(~c_num_read~0)| 1)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= 0 ~c_dr_st~0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse7 (<= ~q_free~0 1)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse10 (= 0 |old(~c_dr_st~0)|)) (.cse14 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (= ~c_num_read~0 1) .cse6 .cse7 .cse8) .cse9 .cse10 (not (= 1 ~p_num_write~0)) .cse11 (and .cse5 .cse12 .cse13 (= ~q_free~0 0)) .cse14 .cse15) (or (or (< ~q_write_ev~0 2) (or (or .cse0 (or .cse1 (not (= 1 |old(~c_dr_pc~0)|)))) .cse10 .cse2) .cse15) .cse9 .cse3 (not (= .cse16 ~p_num_write~0)) (and .cse5 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8)) (or .cse0 (not (= 1 ~c_dr_i~0)) .cse11 (< .cse16 |old(~q_free~0)|) (not (= |old(~c_last_read~0)| ~p_last_write~0)) (< |old(~q_free~0)| .cse16) .cse1 (and .cse5 .cse12 (= ~q_req_up~0 0) .cse13 (<= (+ ~c_num_read~0 1) ~q_free~0) .cse7 .cse8) (not (= 2 ~q_write_ev~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~p_num_write~0)) .cse4 .cse10 (not (= ~p_dw_st~0 0)) (not (= 0 |old(~q_req_up~0)|)) .cse14))) [2018-11-18 08:50:31,118 INFO L421 ceAbstractionStarter]: At program point L163(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))) (.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 .cse0 (or .cse3 (not (= 1 |old(~c_dr_pc~0)|)))) .cse5 .cse7) .cse8) .cse9 .cse10 (not (= .cse2 ~p_num_write~0)) (and (not (= 0 ~c_dr_st~0)) (= 1 ~c_dr_pc~0) (= ~q_free~0 0) (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or .cse0 .cse3 .cse7 .cse10 .cse4 .cse9 .cse5 (not (= 1 ~p_num_write~0)) .cse1 .cse6 .cse8))) [2018-11-18 08:50:31,119 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2018-11-18 08:50:31,119 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2018-11-18 08:50:31,119 INFO L421 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-11-18 08:50:31,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:50:31 BoogieIcfgContainer [2018-11-18 08:50:31,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:50:31,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:50:31,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:50:31,169 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:50:31,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:14" (3/4) ... [2018-11-18 08:50:31,172 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 08:50:31,176 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 08:50:31,177 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 08:50:31,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 08:50:31,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-18 08:50:31,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-18 08:50:31,178 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 08:50:31,184 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-18 08:50:31,184 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 08:50:31,210 WARN L220 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)) || (((((((((((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)) || (((((!(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)) [2018-11-18 08:50:31,211 WARN L220 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) && ((((((((((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)) || (((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_dw_pc == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(\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))) || \old(p_dw_st) < 2)) && ((((((((((((\old(c_num_read) == c_num_read && p_dw_pc == 1) && q_req_up == 0) && 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) || (((((((((\old(c_num_read) == c_num_read && p_dw_pc == 1) && 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)) || ((((((((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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \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)) && (((((((((((((((((((((((((((((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) || !(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)) || !(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)) || !(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_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))) && ((((((((((!(\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)) && ((((((((((!(\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 && \old(c_num_read) == c_num_read) && p_dw_pc == 1) && 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)) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && 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)) || !(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(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(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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && 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))) && ((((((((((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-11-18 08:50:31,211 WARN L220 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) && (((((((((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))) || !(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)) && (((((((((((!(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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \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)) && ((((((((((!(\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)) && ((((((((((!(\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 && \old(c_num_read) == c_num_read) && p_dw_pc == 1) && 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)) && ((((((((((((((((!(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)))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && 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)) || !(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(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(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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && 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))) && ((((((((((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-11-18 08:50:31,211 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(c_num_read == \old(p_num_write)) || (((((((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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || (((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) && ((((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)) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || ((((((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)) || !(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)) || (((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))) && (((((((\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)) || (((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && q_free <= 1) && p_num_write + 1 <= q_free) && 0 == p_num_write)) || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 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)) || c_num_read + 1 < \old(q_free)) [2018-11-18 08:50:31,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(c_num_read == \old(p_num_write)) || (((((((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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || ((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == 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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 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-11-18 08:50:31,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(q_free) < c_num_read + 1 || (((c_num_read + 1 <= q_free && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free <= p_num_write + 1) && 0 == p_num_write)) || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 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)) && ((((((((((((((!(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) || (((((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)) || !(\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))) && ((((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)) && ((!(c_num_read == \old(p_num_write)) || (((((((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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || ((p_last_write == q_buf_0 && p_dw_pc == 1) && c_num_read == p_num_write)) [2018-11-18 08:50:31,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(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 == c_dr_st) && c_dr_pc == 0) && c_num_read == 0) && q_free == 0)) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(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) || !(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)) || ((((((!(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)) || !(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))) [2018-11-18 08:50:31,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_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) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || ((((((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_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)))) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(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)) [2018-11-18 08:50:31,212 WARN L220 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))) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(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) && 1 == c_dr_pc) && q_free == 0) && c_num_read + 1 == p_num_write))) && ((((((((((!(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) [2018-11-18 08:50:31,242 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d58e002a-1b4d-4a83-a5ee-70a1e666f785/bin-2019/utaipan/witness.graphml [2018-11-18 08:50:31,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:50:31,243 INFO L168 Benchmark]: Toolchain (without parser) took 77619.24 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 960.2 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-18 08:50:31,243 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:50:31,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 943.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:50:31,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.96 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:50:31,244 INFO L168 Benchmark]: Boogie Preprocessor took 60.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -208.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:50:31,244 INFO L168 Benchmark]: RCFGBuilder took 334.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:50:31,244 INFO L168 Benchmark]: TraceAbstraction took 76943.15 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-11-18 08:50:31,244 INFO L168 Benchmark]: Witness Printer took 73.88 ms. Allocated memory is still 5.0 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:50:31,246 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.26 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 943.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.96 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -208.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76943.15 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 73.88 ms. Allocated memory is still 5.0 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || !(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))) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(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) && 1 == c_dr_pc) && q_free == 0) && c_num_read + 1 == p_num_write))) && ((((((((((!(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) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((!(c_num_read == \old(p_num_write)) || (((((((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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || ((((2 <= p_dw_st && p_dw_pc == 1) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == 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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 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: 117]: Loop Invariant Derived loop invariant: ((((!(c_num_read == \old(p_num_write)) || (((((((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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || (((p_dw_pc == 1 && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) && ((((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)) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || ((((((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)) || !(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)) || (((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))) && (((((((\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)) || (((((p_dw_pc == \old(p_dw_pc) && q_req_up == 0) && p_last_write == q_buf_0) && q_free <= 1) && p_num_write + 1 <= q_free) && 0 == p_num_write)) || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 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)) || c_num_read + 1 < \old(q_free)) - 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) && ((((((((((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)) || (((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_dw_pc == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(\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))) || \old(p_dw_st) < 2)) && ((((((((((((\old(c_num_read) == c_num_read && p_dw_pc == 1) && q_req_up == 0) && 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) || (((((((((\old(c_num_read) == c_num_read && p_dw_pc == 1) && 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)) || ((((((((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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \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)) && (((((((((((((((((((((((((((((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) || !(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)) || !(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)) || !(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_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))) && ((((((((((!(\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)) && ((((((((((!(\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 && \old(c_num_read) == c_num_read) && p_dw_pc == 1) && 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)) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && 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)) || !(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(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(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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && 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))) && ((((((((((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) || !(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)) || __retres1 == 0) || !(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)) && ((((((((((0 == __retres1 || !(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)) || !(c_num_read == p_num_write)) || 1 < q_free) || p_dw_st < 2) || !(c_last_read == p_last_write))) && (((((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)) && (((((((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))) && (((((((((!(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)) || 0 == __retres1) || p_dw_st < 2)) && (((((((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) && (((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || ((((((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_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)))) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(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)) - 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)) || (((((((((((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)) || (((((!(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)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((\old(q_free) < c_num_read + 1 || (((c_num_read + 1 <= q_free && p_dw_pc == \old(p_dw_pc) && p_last_write == q_buf_0) && q_free <= p_num_write + 1) && 0 == p_num_write)) || (!(2 == c_dr_st) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || \old(q_free) < 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)) && ((((((((((((((!(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) || (((((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)) || !(\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))) && ((((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)) && ((!(c_num_read == \old(p_num_write)) || (((((((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) || !(p_dw_i == 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || 1 < \old(q_free))) || !(\old(p_dw_pc) == 1)) || ((p_last_write == q_buf_0 && p_dw_pc == 1) && c_num_read == p_num_write)) - 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) && (((((((((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))) || !(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)) && (((((((((((!(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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && p_dw_pc == 1) && 2 == c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && q_free == 0) && c_num_read + 1 == p_num_write)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || 0 == q_write_ev) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(0 == \old(q_req_up))) || \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)) && ((((((((((!(\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)) && ((((((((((!(\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 && \old(c_num_read) == c_num_read) && p_dw_pc == 1) && 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)) && ((((((((((((((((!(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)))) && ((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((2 <= p_dw_st && \old(c_num_read) == c_num_read) && 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)) || !(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(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(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 && \old(c_num_read) == c_num_read) && q_req_up == 0) && 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))) && ((((((((((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: 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) || 1 == __retres1) || !(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))) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 <= __retres1) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st))) && (((((((((((((q_free < c_num_read + 1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || 1 == __retres1) || !(q_read_ev == 2)) || !(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)) && ((((((((((((!(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))) || 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) || 1 <= __retres1) || !(q_free == 0)) || !(0 == q_req_up)) || p_dw_st < 2) || !(0 == c_dr_st)) - InvariantResult [Line: 158]: 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)) || ((((!(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 == c_dr_st) && c_dr_pc == 0) && c_num_read == 0) && q_free == 0)) || !(0 == \old(c_dr_pc))) || p_dw_st < 2) && ((((((q_write_ev < 2 || ((!(p_dw_i == 1) || !(q_buf_0 == p_last_write) || !(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) || !(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)) || ((((((!(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)) || !(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))) - 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)) || !(c_num_read + 1 == p_num_write)) || 0 == __retres1) || !(1 == p_dw_pc)) || q_write_ev < 2) || !(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)) || 0 == c_dr_st) || p_dw_pc == 1) || !(0 == q_req_up)) || 0 == __retres1) || 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) || 0 == __retres1) || !(q_read_ev == 1)) || !(c_num_read == p_num_write))) && (0 == __retres1 || !(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)) && ((((((((((((((!(p_dw_i == 1) || !(1 == c_dr_i)) || __retres1 == 0) || !(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))) && ((((((((((!(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)) || !(c_num_read == p_num_write)) || 1 < q_free) || 0 == __retres1) || p_dw_st < 2) || !(c_last_read == p_last_write))) && ((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || 1 == c_dr_pc)) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(c_num_read + 1 == p_num_write)) || 0 == q_write_ev) || !(1 == p_dw_pc)) || 0 == __retres1) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || 1 == q_write_ev) || !(0 == q_req_up)) || p_dw_st < 2)) && (((((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, 134 locations, 1 error locations. SAFE Result, 76.8s OverallTime, 23 OverallIterations, 8 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 36.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5301 SDtfs, 9016 SDslu, 14735 SDs, 0 SdLazy, 12366 SolverSat, 3051 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3933 GetRequests, 3608 SyntacticMatches, 46 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20322occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.2s AbstIntTime, 9 AbstIntIterations, 2 AbstIntStrong, 0.983920362403334 AbsIntWeakeningRatio, 0.7081339712918661 AbsIntAvgWeakeningVarsNumRemoved, 22.33492822966507 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 12206 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 47982 PreInvPairs, 51492 NumberOfFragments, 16970 HoareAnnotationTreeSize, 47982 FomulaSimplifications, 436278 FormulaSimplificationTreeSizeReduction, 6.1s HoareSimplificationTime, 56 FomulaSimplificationsInter, 326120 FormulaSimplificationTreeSizeReductionInter, 30.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 5071 NumberOfCodeBlocks, 5071 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 6742 ConstructedInterpolants, 0 QuantifiedInterpolants, 2381333 SizeOfPredicates, 10 NumberOfNonLiveVariables, 7705 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 4566/4866 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...